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_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:00,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:00,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:00,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:00,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:00,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:00,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:00,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:00,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:00,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:00,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:00,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:00,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:00,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:00,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:00,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:00,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:00,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:00,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:00,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:00,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:00,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:00,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:00,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:00,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:00,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:00,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:00,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:00,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:00,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:00,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:00,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:00,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:00,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:00,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:00,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:00,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:00,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:00,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:00,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:00,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:00,469 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:00,494 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:00,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:00,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:00,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:00,496 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:00,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:00,497 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:00,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:00,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:00,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:00,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:00,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:00,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:00,498 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:00,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:00,498 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:00,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:00,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:00,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:00,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:00,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:00,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:00,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:00,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:00,500 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:00,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:00,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:00,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:00,501 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:00,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:00,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:00,793 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:00,794 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:00,794 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:00,795 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-10-15 01:28:00,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5914e77ea/d1117379df3947909ab0eab1d450065c/FLAGce6748ea1 [2019-10-15 01:28:01,365 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:01,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-10-15 01:28:01,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5914e77ea/d1117379df3947909ab0eab1d450065c/FLAGce6748ea1 [2019-10-15 01:28:01,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5914e77ea/d1117379df3947909ab0eab1d450065c [2019-10-15 01:28:01,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:01,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:01,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:01,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:01,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:01,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:01" (1/1) ... [2019-10-15 01:28:01,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e2977e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:01, skipping insertion in model container [2019-10-15 01:28:01,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:01" (1/1) ... [2019-10-15 01:28:01,798 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:01,860 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:02,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:02,142 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:02,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:02,324 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:02,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:02 WrapperNode [2019-10-15 01:28:02,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:02,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:02,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:02,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:02,335 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:02" (1/1) ... [2019-10-15 01:28:02,335 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:02" (1/1) ... [2019-10-15 01:28:02,343 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:02" (1/1) ... [2019-10-15 01:28:02,344 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:02" (1/1) ... [2019-10-15 01:28:02,356 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:02" (1/1) ... [2019-10-15 01:28:02,369 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:02" (1/1) ... [2019-10-15 01:28:02,375 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:02" (1/1) ... [2019-10-15 01:28:02,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:02,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:02,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:02,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:02,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:02" (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:02,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:02,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:02,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 01:28:02,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:28:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:28:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:28:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 01:28:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:02,622 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:28:03,176 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 01:28:03,177 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 01:28:03,179 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:03,180 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:28:03,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:03 BoogieIcfgContainer [2019-10-15 01:28:03,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:03,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:03,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:03,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:03,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:01" (1/3) ... [2019-10-15 01:28:03,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335bc299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:03, skipping insertion in model container [2019-10-15 01:28:03,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:02" (2/3) ... [2019-10-15 01:28:03,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335bc299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:03, skipping insertion in model container [2019-10-15 01:28:03,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:03" (3/3) ... [2019-10-15 01:28:03,191 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-10-15 01:28:03,201 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:03,210 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:03,221 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:03,249 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:03,249 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:03,250 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:03,250 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:03,250 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:03,250 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:03,250 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:03,251 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-15 01:28:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:28:03,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:03,284 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:03,285 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:03,291 INFO L82 PathProgramCache]: Analyzing trace with hash 882212075, now seen corresponding path program 1 times [2019-10-15 01:28:03,298 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:03,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899224004] [2019-10-15 01:28:03,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:03,612 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:03,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899224004] [2019-10-15 01:28:03,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:03,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:03,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882024391] [2019-10-15 01:28:03,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:03,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:03,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:03,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:03,638 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-15 01:28:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,097 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-15 01:28:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:04,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-15 01:28:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,115 INFO L225 Difference]: With dead ends: 337 [2019-10-15 01:28:04,115 INFO L226 Difference]: Without dead ends: 180 [2019-10-15 01:28:04,119 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:04,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-15 01:28:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-15 01:28:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-15 01:28:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-15 01:28:04,231 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-15 01:28:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,233 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-15 01:28:04,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-15 01:28:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:28:04,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,239 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:04,240 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1571615886, now seen corresponding path program 1 times [2019-10-15 01:28:04,241 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713313053] [2019-10-15 01:28:04,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,242 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,419 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,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713313053] [2019-10-15 01:28:04,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:04,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:04,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139648766] [2019-10-15 01:28:04,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:04,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:04,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:04,426 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-15 01:28:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,722 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-15 01:28:04,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:04,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-15 01:28:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,728 INFO L225 Difference]: With dead ends: 385 [2019-10-15 01:28:04,728 INFO L226 Difference]: Without dead ends: 221 [2019-10-15 01:28:04,733 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:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-15 01:28:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-15 01:28:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-15 01:28:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-15 01:28:04,779 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-15 01:28:04,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,780 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-15 01:28:04,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-15 01:28:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:04,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,789 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:04,790 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1796709690, now seen corresponding path program 1 times [2019-10-15 01:28:04,794 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641596262] [2019-10-15 01:28:04,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:04,937 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:04,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641596262] [2019-10-15 01:28:04,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:04,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:04,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021553270] [2019-10-15 01:28:04,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:04,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:04,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:04,944 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-15 01:28:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,195 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-15 01:28:05,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,199 INFO L225 Difference]: With dead ends: 450 [2019-10-15 01:28:05,199 INFO L226 Difference]: Without dead ends: 247 [2019-10-15 01:28:05,204 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,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-15 01:28:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-15 01:28:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-15 01:28:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-15 01:28:05,232 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-15 01:28:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,232 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-15 01:28:05,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-15 01:28:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:28:05,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,235 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:05,235 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,236 INFO L82 PathProgramCache]: Analyzing trace with hash 903111100, now seen corresponding path program 1 times [2019-10-15 01:28:05,236 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132063269] [2019-10-15 01:28:05,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,325 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:05,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132063269] [2019-10-15 01:28:05,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:05,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197285828] [2019-10-15 01:28:05,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:05,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:05,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:05,327 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-15 01:28:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,522 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-15 01:28:05,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-15 01:28:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,525 INFO L225 Difference]: With dead ends: 498 [2019-10-15 01:28:05,525 INFO L226 Difference]: Without dead ends: 264 [2019-10-15 01:28:05,526 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,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-15 01:28:05,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-15 01:28:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-15 01:28:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-15 01:28:05,540 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-15 01:28:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,540 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-15 01:28:05,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-15 01:28:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:28:05,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,543 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:05,543 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,544 INFO L82 PathProgramCache]: Analyzing trace with hash -890466136, now seen corresponding path program 1 times [2019-10-15 01:28:05,544 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752046497] [2019-10-15 01:28:05,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,644 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:05,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752046497] [2019-10-15 01:28:05,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:05,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397548349] [2019-10-15 01:28:05,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:05,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:05,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:05,648 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-15 01:28:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,878 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2019-10-15 01:28:05,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-15 01:28:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,882 INFO L225 Difference]: With dead ends: 557 [2019-10-15 01:28:05,882 INFO L226 Difference]: Without dead ends: 308 [2019-10-15 01:28:05,883 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,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-15 01:28:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-10-15 01:28:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-15 01:28:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-15 01:28:05,896 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-15 01:28:05,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,896 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-15 01:28:05,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-15 01:28:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:28:05,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,898 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:05,899 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,899 INFO L82 PathProgramCache]: Analyzing trace with hash -550567068, now seen corresponding path program 1 times [2019-10-15 01:28:05,899 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768318432] [2019-10-15 01:28:05,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,964 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:05,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768318432] [2019-10-15 01:28:05,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:05,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329626005] [2019-10-15 01:28:05,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:05,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:05,966 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-15 01:28:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,146 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-15 01:28:06,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:06,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-15 01:28:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,149 INFO L225 Difference]: With dead ends: 597 [2019-10-15 01:28:06,149 INFO L226 Difference]: Without dead ends: 306 [2019-10-15 01:28:06,150 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,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-15 01:28:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-15 01:28:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-15 01:28:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-15 01:28:06,164 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-15 01:28:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,164 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-15 01:28:06,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-15 01:28:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:28:06,166 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,166 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:06,166 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash -80048661, now seen corresponding path program 1 times [2019-10-15 01:28:06,167 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674225213] [2019-10-15 01:28:06,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:06,225 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:06,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674225213] [2019-10-15 01:28:06,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:06,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:06,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5485200] [2019-10-15 01:28:06,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:06,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:06,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:06,228 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-15 01:28:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,455 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2019-10-15 01:28:06,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:06,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-15 01:28:06,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,458 INFO L225 Difference]: With dead ends: 599 [2019-10-15 01:28:06,458 INFO L226 Difference]: Without dead ends: 306 [2019-10-15 01:28:06,459 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,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-15 01:28:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-10-15 01:28:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-15 01:28:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-15 01:28:06,472 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-15 01:28:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,472 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-15 01:28:06,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-15 01:28:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:28:06,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,474 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:06,474 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,475 INFO L82 PathProgramCache]: Analyzing trace with hash 597213445, now seen corresponding path program 1 times [2019-10-15 01:28:06,475 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164307619] [2019-10-15 01:28:06,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:06,575 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:06,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164307619] [2019-10-15 01:28:06,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:06,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:06,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491379808] [2019-10-15 01:28:06,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:06,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:06,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:06,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:06,578 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-15 01:28:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,774 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-15 01:28:06,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:06,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 01:28:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,776 INFO L225 Difference]: With dead ends: 600 [2019-10-15 01:28:06,776 INFO L226 Difference]: Without dead ends: 311 [2019-10-15 01:28:06,777 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,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-15 01:28:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-15 01:28:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-15 01:28:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-15 01:28:06,790 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-15 01:28:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,791 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-15 01:28:06,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-15 01:28:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:28:06,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,793 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:06,793 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash 301165919, now seen corresponding path program 1 times [2019-10-15 01:28:06,793 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529952133] [2019-10-15 01:28:06,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:06,841 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:06,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529952133] [2019-10-15 01:28:06,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:06,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:06,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429909116] [2019-10-15 01:28:06,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:06,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:06,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:06,844 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-15 01:28:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,031 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-15 01:28:07,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:07,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-15 01:28:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,035 INFO L225 Difference]: With dead ends: 640 [2019-10-15 01:28:07,035 INFO L226 Difference]: Without dead ends: 342 [2019-10-15 01:28:07,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:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-15 01:28:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-15 01:28:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-15 01:28:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-15 01:28:07,054 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-15 01:28:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,054 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-15 01:28:07,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-15 01:28:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:28:07,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,057 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:07,057 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash -283935385, now seen corresponding path program 1 times [2019-10-15 01:28:07,058 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128849569] [2019-10-15 01:28:07,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,134 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:07,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128849569] [2019-10-15 01:28:07,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:07,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448054636] [2019-10-15 01:28:07,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:07,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:07,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:07,137 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-15 01:28:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,384 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-15 01:28:07,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:07,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-15 01:28:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,386 INFO L225 Difference]: With dead ends: 669 [2019-10-15 01:28:07,387 INFO L226 Difference]: Without dead ends: 342 [2019-10-15 01:28:07,388 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,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-15 01:28:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-15 01:28:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-15 01:28:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-15 01:28:07,406 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-15 01:28:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,407 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-15 01:28:07,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-15 01:28:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:07,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,409 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:07,410 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1626624529, now seen corresponding path program 1 times [2019-10-15 01:28:07,410 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166063556] [2019-10-15 01:28:07,411 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,411 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,475 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:07,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166063556] [2019-10-15 01:28:07,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:07,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920768184] [2019-10-15 01:28:07,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:07,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:07,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:07,477 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-15 01:28:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,669 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-15 01:28:07,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:07,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,672 INFO L225 Difference]: With dead ends: 702 [2019-10-15 01:28:07,672 INFO L226 Difference]: Without dead ends: 375 [2019-10-15 01:28:07,673 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,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-15 01:28:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-15 01:28:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-15 01:28:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-15 01:28:07,688 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-15 01:28:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,689 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-15 01:28:07,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-15 01:28:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:07,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,691 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:07,691 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1291287383, now seen corresponding path program 1 times [2019-10-15 01:28:07,691 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73229301] [2019-10-15 01:28:07,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,742 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:07,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73229301] [2019-10-15 01:28:07,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:07,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145976801] [2019-10-15 01:28:07,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:07,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:07,744 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-15 01:28:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,941 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-15 01:28:07,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:07,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,944 INFO L225 Difference]: With dead ends: 729 [2019-10-15 01:28:07,944 INFO L226 Difference]: Without dead ends: 375 [2019-10-15 01:28:07,945 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,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-15 01:28:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-15 01:28:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-15 01:28:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-15 01:28:07,961 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-15 01:28:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,962 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-15 01:28:07,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-15 01:28:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:28:07,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,964 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:07,964 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1329985514, now seen corresponding path program 1 times [2019-10-15 01:28:07,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358636683] [2019-10-15 01:28:07,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,024 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:08,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358636683] [2019-10-15 01:28:08,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:08,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844362023] [2019-10-15 01:28:08,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:08,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:08,026 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-15 01:28:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:08,213 INFO L93 Difference]: Finished difference Result 746 states and 1198 transitions. [2019-10-15 01:28:08,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:08,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-15 01:28:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:08,216 INFO L225 Difference]: With dead ends: 746 [2019-10-15 01:28:08,216 INFO L226 Difference]: Without dead ends: 392 [2019-10-15 01:28:08,217 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,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-15 01:28:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-15 01:28:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-15 01:28:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-15 01:28:08,235 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-15 01:28:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:08,235 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-15 01:28:08,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-15 01:28:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:28:08,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:08,237 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:08,238 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1711185522, now seen corresponding path program 1 times [2019-10-15 01:28:08,238 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709283014] [2019-10-15 01:28:08,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,284 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:08,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709283014] [2019-10-15 01:28:08,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:08,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413700199] [2019-10-15 01:28:08,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:08,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:08,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:08,287 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-15 01:28:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:08,461 INFO L93 Difference]: Finished difference Result 767 states and 1221 transitions. [2019-10-15 01:28:08,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:08,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-15 01:28:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:08,464 INFO L225 Difference]: With dead ends: 767 [2019-10-15 01:28:08,464 INFO L226 Difference]: Without dead ends: 392 [2019-10-15 01:28:08,466 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,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-15 01:28:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-15 01:28:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-15 01:28:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-15 01:28:08,485 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-15 01:28:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:08,485 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-15 01:28:08,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-15 01:28:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-15 01:28:08,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:08,488 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:08,488 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1344904457, now seen corresponding path program 1 times [2019-10-15 01:28:08,489 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005237585] [2019-10-15 01:28:08,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,562 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:08,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005237585] [2019-10-15 01:28:08,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:08,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930172536] [2019-10-15 01:28:08,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:08,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:08,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:08,565 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-15 01:28:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:08,609 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-15 01:28:08,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:08,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-15 01:28:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:08,614 INFO L225 Difference]: With dead ends: 763 [2019-10-15 01:28:08,614 INFO L226 Difference]: Without dead ends: 761 [2019-10-15 01:28:08,615 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:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-15 01:28:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-15 01:28:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-15 01:28:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-15 01:28:08,648 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-15 01:28:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:08,649 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-15 01:28:08,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-15 01:28:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:28:08,651 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:08,652 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, 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] [2019-10-15 01:28:08,652 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,652 INFO L82 PathProgramCache]: Analyzing trace with hash -773137702, now seen corresponding path program 1 times [2019-10-15 01:28:08,653 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888488712] [2019-10-15 01:28:08,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:28:08,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888488712] [2019-10-15 01:28:08,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:08,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009123216] [2019-10-15 01:28:08,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:08,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:08,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:08,715 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 5 states. [2019-10-15 01:28:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,034 INFO L93 Difference]: Finished difference Result 1593 states and 2521 transitions. [2019-10-15 01:28:09,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:09,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-10-15 01:28:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,041 INFO L225 Difference]: With dead ends: 1593 [2019-10-15 01:28:09,042 INFO L226 Difference]: Without dead ends: 845 [2019-10-15 01:28:09,044 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,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-10-15 01:28:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2019-10-15 01:28:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-10-15 01:28:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1319 transitions. [2019-10-15 01:28:09,095 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1319 transitions. Word has length 127 [2019-10-15 01:28:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,095 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1319 transitions. [2019-10-15 01:28:09,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1319 transitions. [2019-10-15 01:28:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:28:09,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,100 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, 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] [2019-10-15 01:28:09,101 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,101 INFO L82 PathProgramCache]: Analyzing trace with hash -260517251, now seen corresponding path program 1 times [2019-10-15 01:28:09,102 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525732873] [2019-10-15 01:28:09,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:28:09,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525732873] [2019-10-15 01:28:09,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:09,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:09,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316793934] [2019-10-15 01:28:09,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:09,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:09,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:09,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:09,181 INFO L87 Difference]: Start difference. First operand 837 states and 1319 transitions. Second operand 5 states. [2019-10-15 01:28:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,497 INFO L93 Difference]: Finished difference Result 1669 states and 2633 transitions. [2019-10-15 01:28:09,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:09,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-15 01:28:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,504 INFO L225 Difference]: With dead ends: 1669 [2019-10-15 01:28:09,504 INFO L226 Difference]: Without dead ends: 841 [2019-10-15 01:28:09,507 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,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-10-15 01:28:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 833. [2019-10-15 01:28:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-10-15 01:28:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1307 transitions. [2019-10-15 01:28:09,549 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1307 transitions. Word has length 128 [2019-10-15 01:28:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,549 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1307 transitions. [2019-10-15 01:28:09,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1307 transitions. [2019-10-15 01:28:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:28:09,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,552 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:09,553 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1086305590, now seen corresponding path program 1 times [2019-10-15 01:28:09,553 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950208408] [2019-10-15 01:28:09,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-15 01:28:09,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950208408] [2019-10-15 01:28:09,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:09,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:09,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213516491] [2019-10-15 01:28:09,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:09,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:09,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:09,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:09,620 INFO L87 Difference]: Start difference. First operand 833 states and 1307 transitions. Second operand 5 states. [2019-10-15 01:28:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,866 INFO L93 Difference]: Finished difference Result 1729 states and 2717 transitions. [2019-10-15 01:28:09,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:09,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-15 01:28:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,871 INFO L225 Difference]: With dead ends: 1729 [2019-10-15 01:28:09,871 INFO L226 Difference]: Without dead ends: 909 [2019-10-15 01:28:09,873 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,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-10-15 01:28:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 905. [2019-10-15 01:28:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-10-15 01:28:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1415 transitions. [2019-10-15 01:28:09,914 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1415 transitions. Word has length 160 [2019-10-15 01:28:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,915 INFO L462 AbstractCegarLoop]: Abstraction has 905 states and 1415 transitions. [2019-10-15 01:28:09,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1415 transitions. [2019-10-15 01:28:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:28:09,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,918 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:09,918 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash -643380505, now seen corresponding path program 1 times [2019-10-15 01:28:09,919 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932959194] [2019-10-15 01:28:09,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-15 01:28:10,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932959194] [2019-10-15 01:28:10,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:10,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845337844] [2019-10-15 01:28:10,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:10,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:10,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:10,017 INFO L87 Difference]: Start difference. First operand 905 states and 1415 transitions. Second operand 5 states. [2019-10-15 01:28:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,241 INFO L93 Difference]: Finished difference Result 1801 states and 2817 transitions. [2019-10-15 01:28:10,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:10,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-15 01:28:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,246 INFO L225 Difference]: With dead ends: 1801 [2019-10-15 01:28:10,246 INFO L226 Difference]: Without dead ends: 905 [2019-10-15 01:28:10,249 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:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-10-15 01:28:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 901. [2019-10-15 01:28:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-15 01:28:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1401 transitions. [2019-10-15 01:28:10,288 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1401 transitions. Word has length 161 [2019-10-15 01:28:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,288 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1401 transitions. [2019-10-15 01:28:10,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1401 transitions. [2019-10-15 01:28:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-15 01:28:10,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,292 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:10,292 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,293 INFO L82 PathProgramCache]: Analyzing trace with hash -306607681, now seen corresponding path program 1 times [2019-10-15 01:28:10,293 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496300831] [2019-10-15 01:28:10,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-15 01:28:10,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496300831] [2019-10-15 01:28:10,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:10,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743144716] [2019-10-15 01:28:10,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:10,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:10,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:10,369 INFO L87 Difference]: Start difference. First operand 901 states and 1401 transitions. Second operand 5 states. [2019-10-15 01:28:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,599 INFO L93 Difference]: Finished difference Result 1861 states and 2897 transitions. [2019-10-15 01:28:10,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:10,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-10-15 01:28:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,604 INFO L225 Difference]: With dead ends: 1861 [2019-10-15 01:28:10,604 INFO L226 Difference]: Without dead ends: 973 [2019-10-15 01:28:10,607 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:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-10-15 01:28:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 969. [2019-10-15 01:28:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-10-15 01:28:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1499 transitions. [2019-10-15 01:28:10,648 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1499 transitions. Word has length 191 [2019-10-15 01:28:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,648 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1499 transitions. [2019-10-15 01:28:10,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1499 transitions. [2019-10-15 01:28:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-15 01:28:10,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,653 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:10,653 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1259797154, now seen corresponding path program 1 times [2019-10-15 01:28:10,654 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063720068] [2019-10-15 01:28:10,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-15 01:28:10,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063720068] [2019-10-15 01:28:10,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:10,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723949279] [2019-10-15 01:28:10,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:10,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:10,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:10,752 INFO L87 Difference]: Start difference. First operand 969 states and 1499 transitions. Second operand 5 states. [2019-10-15 01:28:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,054 INFO L93 Difference]: Finished difference Result 1929 states and 2985 transitions. [2019-10-15 01:28:11,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:11,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-10-15 01:28:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,062 INFO L225 Difference]: With dead ends: 1929 [2019-10-15 01:28:11,062 INFO L226 Difference]: Without dead ends: 969 [2019-10-15 01:28:11,066 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:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-10-15 01:28:11,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 965. [2019-10-15 01:28:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-10-15 01:28:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1483 transitions. [2019-10-15 01:28:11,129 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1483 transitions. Word has length 192 [2019-10-15 01:28:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,129 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1483 transitions. [2019-10-15 01:28:11,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1483 transitions. [2019-10-15 01:28:11,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-15 01:28:11,137 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,137 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:11,137 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,138 INFO L82 PathProgramCache]: Analyzing trace with hash 637510067, now seen corresponding path program 1 times [2019-10-15 01:28:11,138 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832837211] [2019-10-15 01:28:11,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-15 01:28:11,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832837211] [2019-10-15 01:28:11,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:11,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921425824] [2019-10-15 01:28:11,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:11,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:11,268 INFO L87 Difference]: Start difference. First operand 965 states and 1483 transitions. Second operand 5 states. [2019-10-15 01:28:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,558 INFO L93 Difference]: Finished difference Result 1993 states and 3073 transitions. [2019-10-15 01:28:11,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:11,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-10-15 01:28:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,565 INFO L225 Difference]: With dead ends: 1993 [2019-10-15 01:28:11,565 INFO L226 Difference]: Without dead ends: 1041 [2019-10-15 01:28:11,568 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:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-15 01:28:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-10-15 01:28:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-15 01:28:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1547 transitions. [2019-10-15 01:28:11,625 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1547 transitions. Word has length 209 [2019-10-15 01:28:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,625 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1547 transitions. [2019-10-15 01:28:11,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1547 transitions. [2019-10-15 01:28:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-15 01:28:11,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,631 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:11,631 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1262219653, now seen corresponding path program 1 times [2019-10-15 01:28:11,632 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846858411] [2019-10-15 01:28:11,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-15 01:28:11,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846858411] [2019-10-15 01:28:11,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:11,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762341953] [2019-10-15 01:28:11,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:11,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:11,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:11,789 INFO L87 Difference]: Start difference. First operand 1015 states and 1547 transitions. Second operand 5 states. [2019-10-15 01:28:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,011 INFO L93 Difference]: Finished difference Result 2043 states and 3119 transitions. [2019-10-15 01:28:12,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:12,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-10-15 01:28:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,017 INFO L225 Difference]: With dead ends: 2043 [2019-10-15 01:28:12,017 INFO L226 Difference]: Without dead ends: 1041 [2019-10-15 01:28:12,019 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:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-15 01:28:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-10-15 01:28:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-15 01:28:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1529 transitions. [2019-10-15 01:28:12,063 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1529 transitions. Word has length 210 [2019-10-15 01:28:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,063 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1529 transitions. [2019-10-15 01:28:12,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1529 transitions. [2019-10-15 01:28:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-15 01:28:12,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,067 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:12,068 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1315202570, now seen corresponding path program 1 times [2019-10-15 01:28:12,068 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096667361] [2019-10-15 01:28:12,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-15 01:28:12,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096667361] [2019-10-15 01:28:12,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:12,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:12,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450039711] [2019-10-15 01:28:12,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:12,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:12,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:12,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,152 INFO L87 Difference]: Start difference. First operand 1015 states and 1529 transitions. Second operand 5 states. [2019-10-15 01:28:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,434 INFO L93 Difference]: Finished difference Result 2025 states and 3051 transitions. [2019-10-15 01:28:12,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:12,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-10-15 01:28:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,441 INFO L225 Difference]: With dead ends: 2025 [2019-10-15 01:28:12,441 INFO L226 Difference]: Without dead ends: 1023 [2019-10-15 01:28:12,445 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:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-10-15 01:28:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1015. [2019-10-15 01:28:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-15 01:28:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1517 transitions. [2019-10-15 01:28:12,576 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1517 transitions. Word has length 222 [2019-10-15 01:28:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,577 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1517 transitions. [2019-10-15 01:28:12,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1517 transitions. [2019-10-15 01:28:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-15 01:28:12,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,583 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:12,584 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1975125977, now seen corresponding path program 1 times [2019-10-15 01:28:12,586 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490413808] [2019-10-15 01:28:12,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-15 01:28:12,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490413808] [2019-10-15 01:28:12,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:12,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:12,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358567350] [2019-10-15 01:28:12,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:12,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,716 INFO L87 Difference]: Start difference. First operand 1015 states and 1517 transitions. Second operand 5 states. [2019-10-15 01:28:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,030 INFO L93 Difference]: Finished difference Result 2025 states and 3027 transitions. [2019-10-15 01:28:13,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-10-15 01:28:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,039 INFO L225 Difference]: With dead ends: 2025 [2019-10-15 01:28:13,039 INFO L226 Difference]: Without dead ends: 1005 [2019-10-15 01:28:13,042 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:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-10-15 01:28:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 997. [2019-10-15 01:28:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-10-15 01:28:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1479 transitions. [2019-10-15 01:28:13,117 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1479 transitions. Word has length 223 [2019-10-15 01:28:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,118 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1479 transitions. [2019-10-15 01:28:13,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1479 transitions. [2019-10-15 01:28:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-15 01:28:13,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,126 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:13,126 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1054088717, now seen corresponding path program 1 times [2019-10-15 01:28:13,127 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472331287] [2019-10-15 01:28:13,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-15 01:28:13,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472331287] [2019-10-15 01:28:13,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712436278] [2019-10-15 01:28:13,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,252 INFO L87 Difference]: Start difference. First operand 997 states and 1479 transitions. Second operand 5 states. [2019-10-15 01:28:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,508 INFO L93 Difference]: Finished difference Result 2035 states and 3025 transitions. [2019-10-15 01:28:13,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-10-15 01:28:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,514 INFO L225 Difference]: With dead ends: 2035 [2019-10-15 01:28:13,514 INFO L226 Difference]: Without dead ends: 1051 [2019-10-15 01:28:13,527 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:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-10-15 01:28:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1043. [2019-10-15 01:28:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-10-15 01:28:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1533 transitions. [2019-10-15 01:28:13,605 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1533 transitions. Word has length 230 [2019-10-15 01:28:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,606 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1533 transitions. [2019-10-15 01:28:13,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1533 transitions. [2019-10-15 01:28:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-15 01:28:13,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,610 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:13,610 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash 364858085, now seen corresponding path program 1 times [2019-10-15 01:28:13,611 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045478061] [2019-10-15 01:28:13,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-15 01:28:13,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045478061] [2019-10-15 01:28:13,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078217770] [2019-10-15 01:28:13,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,713 INFO L87 Difference]: Start difference. First operand 1043 states and 1533 transitions. Second operand 5 states. [2019-10-15 01:28:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,962 INFO L93 Difference]: Finished difference Result 2081 states and 3059 transitions. [2019-10-15 01:28:13,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-10-15 01:28:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,967 INFO L225 Difference]: With dead ends: 2081 [2019-10-15 01:28:13,967 INFO L226 Difference]: Without dead ends: 1043 [2019-10-15 01:28:13,970 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:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-10-15 01:28:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1035. [2019-10-15 01:28:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-10-15 01:28:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1501 transitions. [2019-10-15 01:28:14,023 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1501 transitions. Word has length 231 [2019-10-15 01:28:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,023 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1501 transitions. [2019-10-15 01:28:14,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1501 transitions. [2019-10-15 01:28:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-15 01:28:14,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,029 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,029 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,030 INFO L82 PathProgramCache]: Analyzing trace with hash -567208800, now seen corresponding path program 1 times [2019-10-15 01:28:14,030 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637990836] [2019-10-15 01:28:14,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-15 01:28:14,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637990836] [2019-10-15 01:28:14,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749228758] [2019-10-15 01:28:14,130 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:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:14,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-15 01:28:14,500 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-15 01:28:14,607 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:14,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:14,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665990407] [2019-10-15 01:28:14,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:14,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:14,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,609 INFO L87 Difference]: Start difference. First operand 1035 states and 1501 transitions. Second operand 3 states. [2019-10-15 01:28:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,699 INFO L93 Difference]: Finished difference Result 2567 states and 3726 transitions. [2019-10-15 01:28:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:14,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-10-15 01:28:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,707 INFO L225 Difference]: With dead ends: 2567 [2019-10-15 01:28:14,707 INFO L226 Difference]: Without dead ends: 1545 [2019-10-15 01:28:14,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 533 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2019-10-15 01:28:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2019-10-15 01:28:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2019-10-15 01:28:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2241 transitions. [2019-10-15 01:28:14,790 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2241 transitions. Word has length 267 [2019-10-15 01:28:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,791 INFO L462 AbstractCegarLoop]: Abstraction has 1545 states and 2241 transitions. [2019-10-15 01:28:14,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2241 transitions. [2019-10-15 01:28:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-15 01:28:14,796 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,797 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:15,001 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 767374129, now seen corresponding path program 1 times [2019-10-15 01:28:15,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023635301] [2019-10-15 01:28:15,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-15 01:28:15,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023635301] [2019-10-15 01:28:15,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:15,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137361970] [2019-10-15 01:28:15,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:15,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:15,298 INFO L87 Difference]: Start difference. First operand 1545 states and 2241 transitions. Second operand 3 states. [2019-10-15 01:28:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:15,502 INFO L93 Difference]: Finished difference Result 4528 states and 6569 transitions. [2019-10-15 01:28:15,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:15,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-15 01:28:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:15,519 INFO L225 Difference]: With dead ends: 4528 [2019-10-15 01:28:15,519 INFO L226 Difference]: Without dead ends: 2996 [2019-10-15 01:28:15,525 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:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-10-15 01:28:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2994. [2019-10-15 01:28:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2019-10-15 01:28:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 4335 transitions. [2019-10-15 01:28:15,688 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 4335 transitions. Word has length 274 [2019-10-15 01:28:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,689 INFO L462 AbstractCegarLoop]: Abstraction has 2994 states and 4335 transitions. [2019-10-15 01:28:15,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 4335 transitions. [2019-10-15 01:28:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-15 01:28:15,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,698 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 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] [2019-10-15 01:28:15,698 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1658002288, now seen corresponding path program 1 times [2019-10-15 01:28:15,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207642109] [2019-10-15 01:28:15,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-15 01:28:15,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207642109] [2019-10-15 01:28:15,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:15,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244041495] [2019-10-15 01:28:15,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:15,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:15,804 INFO L87 Difference]: Start difference. First operand 2994 states and 4335 transitions. Second operand 3 states. [2019-10-15 01:28:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:16,151 INFO L93 Difference]: Finished difference Result 6095 states and 8845 transitions. [2019-10-15 01:28:16,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:16,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-15 01:28:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:16,166 INFO L225 Difference]: With dead ends: 6095 [2019-10-15 01:28:16,166 INFO L226 Difference]: Without dead ends: 1997 [2019-10-15 01:28:16,214 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:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-10-15 01:28:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1977. [2019-10-15 01:28:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-10-15 01:28:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2813 transitions. [2019-10-15 01:28:16,379 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2813 transitions. Word has length 311 [2019-10-15 01:28:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:16,380 INFO L462 AbstractCegarLoop]: Abstraction has 1977 states and 2813 transitions. [2019-10-15 01:28:16,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2813 transitions. [2019-10-15 01:28:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-15 01:28:16,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:16,394 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,395 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:16,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:16,395 INFO L82 PathProgramCache]: Analyzing trace with hash -872859034, now seen corresponding path program 1 times [2019-10-15 01:28:16,396 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:16,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338972297] [2019-10-15 01:28:16,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-15 01:28:16,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338972297] [2019-10-15 01:28:16,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089729790] [2019-10-15 01:28:16,643 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:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:16,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:16,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-15 01:28:17,087 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-15 01:28:17,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1106150144] [2019-10-15 01:28:17,293 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 378 [2019-10-15 01:28:17,370 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:17,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:17,596 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:19,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:19,569 INFO L272 AbstractInterpreter]: Visited 99 different actions 2022 times. Merged at 85 different actions 1683 times. Widened at 18 different actions 251 times. Performed 4681 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4681 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 209 fixpoints after 27 different actions. Largest state had 97 variables. [2019-10-15 01:28:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,575 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:19,576 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:19,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:19,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491820486] [2019-10-15 01:28:19,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:19,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:19,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:19,578 INFO L87 Difference]: Start difference. First operand 1977 states and 2813 transitions. Second operand 6 states. [2019-10-15 01:28:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,176 INFO L93 Difference]: Finished difference Result 4565 states and 6483 transitions. [2019-10-15 01:28:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:28:20,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 377 [2019-10-15 01:28:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,189 INFO L225 Difference]: With dead ends: 4565 [2019-10-15 01:28:20,189 INFO L226 Difference]: Without dead ends: 2551 [2019-10-15 01:28:20,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-10-15 01:28:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 1910. [2019-10-15 01:28:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-15 01:28:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2606 transitions. [2019-10-15 01:28:20,296 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2606 transitions. Word has length 377 [2019-10-15 01:28:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,297 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2606 transitions. [2019-10-15 01:28:20,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2606 transitions. [2019-10-15 01:28:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-10-15 01:28:20,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,312 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, 1] [2019-10-15 01:28:20,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:20,517 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1790317548, now seen corresponding path program 1 times [2019-10-15 01:28:20,518 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:20,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612875263] [2019-10-15 01:28:20,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-15 01:28:20,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612875263] [2019-10-15 01:28:20,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850578889] [2019-10-15 01:28:20,907 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,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:21,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-15 01:28:21,397 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-15 01:28:21,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2063860728] [2019-10-15 01:28:21,725 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 606 [2019-10-15 01:28:21,739 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:21,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:21,838 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:23,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:23,763 INFO L272 AbstractInterpreter]: Visited 111 different actions 2284 times. Merged at 94 different actions 1847 times. Widened at 22 different actions 291 times. Performed 5547 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5547 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 278 fixpoints after 22 different actions. Largest state had 101 variables. [2019-10-15 01:28:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:23,764 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:23,764 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:23,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:23,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174110645] [2019-10-15 01:28:23,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:23,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:23,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:23,768 INFO L87 Difference]: Start difference. First operand 1910 states and 2606 transitions. Second operand 6 states. [2019-10-15 01:28:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,537 INFO L93 Difference]: Finished difference Result 5910 states and 8155 transitions. [2019-10-15 01:28:24,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:28:24,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 605 [2019-10-15 01:28:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,548 INFO L225 Difference]: With dead ends: 5910 [2019-10-15 01:28:24,549 INFO L226 Difference]: Without dead ends: 3877 [2019-10-15 01:28:24,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1212 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2019-10-15 01:28:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 2166. [2019-10-15 01:28:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-10-15 01:28:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2994 transitions. [2019-10-15 01:28:24,665 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2994 transitions. Word has length 605 [2019-10-15 01:28:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,666 INFO L462 AbstractCegarLoop]: Abstraction has 2166 states and 2994 transitions. [2019-10-15 01:28:24,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2994 transitions. [2019-10-15 01:28:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-10-15 01:28:24,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:24,683 INFO L380 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:24,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:24,888 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:24,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:24,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1901319823, now seen corresponding path program 1 times [2019-10-15 01:28:24,889 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:24,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808849775] [2019-10-15 01:28:24,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-10-15 01:28:25,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808849775] [2019-10-15 01:28:25,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:25,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:25,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844512949] [2019-10-15 01:28:25,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:25,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:25,223 INFO L87 Difference]: Start difference. First operand 2166 states and 2994 transitions. Second operand 3 states. [2019-10-15 01:28:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:25,524 INFO L93 Difference]: Finished difference Result 4353 states and 6010 transitions. [2019-10-15 01:28:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:25,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 675 [2019-10-15 01:28:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:25,539 INFO L225 Difference]: With dead ends: 4353 [2019-10-15 01:28:25,540 INFO L226 Difference]: Without dead ends: 2206 [2019-10-15 01:28:25,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:25,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2019-10-15 01:28:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2166. [2019-10-15 01:28:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-10-15 01:28:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2974 transitions. [2019-10-15 01:28:25,662 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2974 transitions. Word has length 675 [2019-10-15 01:28:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:25,662 INFO L462 AbstractCegarLoop]: Abstraction has 2166 states and 2974 transitions. [2019-10-15 01:28:25,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2974 transitions. [2019-10-15 01:28:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-10-15 01:28:25,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:25,685 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:28:25,686 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:25,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:25,686 INFO L82 PathProgramCache]: Analyzing trace with hash -554544010, now seen corresponding path program 1 times [2019-10-15 01:28:25,686 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:25,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347365268] [2019-10-15 01:28:25,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-10-15 01:28:25,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347365268] [2019-10-15 01:28:25,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:25,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:25,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102963281] [2019-10-15 01:28:25,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:25,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:25,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:25,995 INFO L87 Difference]: Start difference. First operand 2166 states and 2974 transitions. Second operand 3 states. [2019-10-15 01:28:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:26,244 INFO L93 Difference]: Finished difference Result 4334 states and 5948 transitions. [2019-10-15 01:28:26,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:26,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-10-15 01:28:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:26,251 INFO L225 Difference]: With dead ends: 4334 [2019-10-15 01:28:26,251 INFO L226 Difference]: Without dead ends: 2187 [2019-10-15 01:28:26,255 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:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-10-15 01:28:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2166. [2019-10-15 01:28:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-10-15 01:28:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2958 transitions. [2019-10-15 01:28:26,367 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2958 transitions. Word has length 689 [2019-10-15 01:28:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:26,368 INFO L462 AbstractCegarLoop]: Abstraction has 2166 states and 2958 transitions. [2019-10-15 01:28:26,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2958 transitions. [2019-10-15 01:28:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-10-15 01:28:26,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:26,392 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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:26,392 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:26,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:26,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1850705057, now seen corresponding path program 1 times [2019-10-15 01:28:26,393 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:26,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514531205] [2019-10-15 01:28:26,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:26,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:26,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-10-15 01:28:26,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514531205] [2019-10-15 01:28:26,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:26,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:26,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388729736] [2019-10-15 01:28:26,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:26,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:26,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:26,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:26,709 INFO L87 Difference]: Start difference. First operand 2166 states and 2958 transitions. Second operand 3 states. [2019-10-15 01:28:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:26,943 INFO L93 Difference]: Finished difference Result 4387 states and 5993 transitions. [2019-10-15 01:28:26,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:26,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2019-10-15 01:28:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:26,950 INFO L225 Difference]: With dead ends: 4387 [2019-10-15 01:28:26,950 INFO L226 Difference]: Without dead ends: 2222 [2019-10-15 01:28:26,955 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:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2019-10-15 01:28:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2208. [2019-10-15 01:28:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2019-10-15 01:28:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2991 transitions. [2019-10-15 01:28:27,089 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2991 transitions. Word has length 717 [2019-10-15 01:28:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:27,093 INFO L462 AbstractCegarLoop]: Abstraction has 2208 states and 2991 transitions. [2019-10-15 01:28:27,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2991 transitions. [2019-10-15 01:28:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-10-15 01:28:27,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:27,102 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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] [2019-10-15 01:28:27,102 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1896110854, now seen corresponding path program 1 times [2019-10-15 01:28:27,103 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:27,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413370287] [2019-10-15 01:28:27,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:27,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:27,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-10-15 01:28:27,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413370287] [2019-10-15 01:28:27,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:27,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:27,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360612774] [2019-10-15 01:28:27,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:27,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:27,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:27,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:27,491 INFO L87 Difference]: Start difference. First operand 2208 states and 2991 transitions. Second operand 3 states. [2019-10-15 01:28:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:27,635 INFO L93 Difference]: Finished difference Result 2838 states and 3828 transitions. [2019-10-15 01:28:27,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:27,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-10-15 01:28:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:27,636 INFO L225 Difference]: With dead ends: 2838 [2019-10-15 01:28:27,636 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:27,642 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:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:27,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2019-10-15 01:28:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:27,643 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:27,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:27,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:27,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:28,878 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 183 [2019-10-15 01:28:29,345 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 162 [2019-10-15 01:28:29,775 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 190 [2019-10-15 01:28:30,681 WARN L191 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 116