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-f4eb214f-m [2019-10-13 21:28:59,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:28:59,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:28:59,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:28:59,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:28:59,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:28:59,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:28:59,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:28:59,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:28:59,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:28:59,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:28:59,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:28:59,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:28:59,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:28:59,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:28:59,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:28:59,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:28:59,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:28:59,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:28:59,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:28:59,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:28:59,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:28:59,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:28:59,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:28:59,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:28:59,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:28:59,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:28:59,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:28:59,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:28:59,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:28:59,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:28:59,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:28:59,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:28:59,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:28:59,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:28:59,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:28:59,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:28:59,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:28:59,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:28:59,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:28:59,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:28:59,449 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-13 21:28:59,462 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:28:59,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:28:59,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:28:59,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:28:59,464 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:28:59,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:28:59,465 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:28:59,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:28:59,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:28:59,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:28:59,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:28:59,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:28:59,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:28:59,466 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:28:59,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:28:59,467 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:28:59,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:28:59,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:28:59,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:28:59,467 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:28:59,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:28:59,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:28:59,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:28:59,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:28:59,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:28:59,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:28:59,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:28:59,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:28:59,469 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-13 21:28:59,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:28:59,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:28:59,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:28:59,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:28:59,771 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:28:59,771 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-13 21:28:59,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29aaf4804/8b1d7a3c44d14a2e8d58daa1de3e2736/FLAGf97ff401c [2019-10-13 21:29:00,405 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:29:00,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-10-13 21:29:00,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29aaf4804/8b1d7a3c44d14a2e8d58daa1de3e2736/FLAGf97ff401c [2019-10-13 21:29:00,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29aaf4804/8b1d7a3c44d14a2e8d58daa1de3e2736 [2019-10-13 21:29:00,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:29:00,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:29:00,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:00,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:29:00,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:29:00,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:00" (1/1) ... [2019-10-13 21:29:00,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6063a733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:00, skipping insertion in model container [2019-10-13 21:29:00,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:00" (1/1) ... [2019-10-13 21:29:00,763 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:29:00,820 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:29:01,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:01,071 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:29:01,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:01,280 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:29:01,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:01 WrapperNode [2019-10-13 21:29:01,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:01,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:29:01,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:29:01,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:29:01,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:01" (1/1) ... [2019-10-13 21:29:01,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:01" (1/1) ... [2019-10-13 21:29:01,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:01" (1/1) ... [2019-10-13 21:29:01,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:01" (1/1) ... [2019-10-13 21:29:01,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:01" (1/1) ... [2019-10-13 21:29:01,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:01" (1/1) ... [2019-10-13 21:29:01,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:01" (1/1) ... [2019-10-13 21:29:01,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:29:01,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:29:01,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:29:01,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:29:01,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:01" (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-13 21:29:01,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:29:01,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:29:01,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 21:29:01,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:29:01,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:29:01,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:29:01,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:29:01,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 21:29:01,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 21:29:01,401 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 21:29:01,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:29:01,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:29:01,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:29:01,633 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:29:02,349 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 21:29:02,349 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 21:29:02,352 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:29:02,352 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:29:02,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:02 BoogieIcfgContainer [2019-10-13 21:29:02,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:29:02,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:29:02,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:29:02,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:29:02,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:29:00" (1/3) ... [2019-10-13 21:29:02,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd08a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:02, skipping insertion in model container [2019-10-13 21:29:02,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:01" (2/3) ... [2019-10-13 21:29:02,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd08a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:02, skipping insertion in model container [2019-10-13 21:29:02,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:02" (3/3) ... [2019-10-13 21:29:02,364 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-10-13 21:29:02,376 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:29:02,387 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:29:02,400 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:29:02,429 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:29:02,429 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:29:02,429 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:29:02,430 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:29:02,430 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:29:02,430 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:29:02,430 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:29:02,430 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:29:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-13 21:29:02,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 21:29:02,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:02,467 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-13 21:29:02,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:02,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:02,476 INFO L82 PathProgramCache]: Analyzing trace with hash 882212075, now seen corresponding path program 1 times [2019-10-13 21:29:02,483 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:02,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982876133] [2019-10-13 21:29:02,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:02,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:02,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:02,822 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-13 21:29:02,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982876133] [2019-10-13 21:29:02,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:02,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:02,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891125144] [2019-10-13 21:29:02,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:02,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:02,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:02,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:02,860 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-13 21:29:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:03,299 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-13 21:29:03,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:03,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-13 21:29:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:03,316 INFO L225 Difference]: With dead ends: 337 [2019-10-13 21:29:03,316 INFO L226 Difference]: Without dead ends: 180 [2019-10-13 21:29:03,323 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-13 21:29:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-13 21:29:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-13 21:29:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 21:29:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-13 21:29:03,387 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-13 21:29:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:03,388 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-13 21:29:03,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-13 21:29:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 21:29:03,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:03,391 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-13 21:29:03,392 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1571615886, now seen corresponding path program 1 times [2019-10-13 21:29:03,393 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:03,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188586255] [2019-10-13 21:29:03,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:03,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:03,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:03,501 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-13 21:29:03,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188586255] [2019-10-13 21:29:03,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:03,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:03,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484749245] [2019-10-13 21:29:03,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:03,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:03,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:03,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:03,506 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-13 21:29:03,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:03,838 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-13 21:29:03,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:03,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-13 21:29:03,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:03,842 INFO L225 Difference]: With dead ends: 385 [2019-10-13 21:29:03,842 INFO L226 Difference]: Without dead ends: 221 [2019-10-13 21:29:03,844 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-13 21:29:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-13 21:29:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-13 21:29:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-13 21:29:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-13 21:29:03,872 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-13 21:29:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:03,873 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-13 21:29:03,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-13 21:29:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:29:03,877 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:03,877 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-13 21:29:03,878 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:03,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1796709690, now seen corresponding path program 1 times [2019-10-13 21:29:03,879 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:03,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94683197] [2019-10-13 21:29:03,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:03,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:03,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:04,029 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-13 21:29:04,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94683197] [2019-10-13 21:29:04,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:04,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:04,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758770802] [2019-10-13 21:29:04,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:04,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:04,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:04,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:04,041 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-13 21:29:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:04,322 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-13 21:29:04,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:04,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-13 21:29:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:04,325 INFO L225 Difference]: With dead ends: 450 [2019-10-13 21:29:04,325 INFO L226 Difference]: Without dead ends: 247 [2019-10-13 21:29:04,327 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-13 21:29:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-13 21:29:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-13 21:29:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-13 21:29:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-13 21:29:04,350 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-13 21:29:04,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:04,350 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-13 21:29:04,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-13 21:29:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:29:04,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:04,359 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-13 21:29:04,360 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash 903111100, now seen corresponding path program 1 times [2019-10-13 21:29:04,360 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:04,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039625613] [2019-10-13 21:29:04,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:04,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:04,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:04,462 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-13 21:29:04,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039625613] [2019-10-13 21:29:04,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:04,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:04,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032183942] [2019-10-13 21:29:04,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:04,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:04,465 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-13 21:29:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:04,670 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-13 21:29:04,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:04,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 21:29:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:04,673 INFO L225 Difference]: With dead ends: 498 [2019-10-13 21:29:04,673 INFO L226 Difference]: Without dead ends: 264 [2019-10-13 21:29:04,674 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-13 21:29:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-13 21:29:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-13 21:29:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-13 21:29:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-13 21:29:04,694 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-13 21:29:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:04,695 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-13 21:29:04,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-13 21:29:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:29:04,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:04,699 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-13 21:29:04,700 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:04,702 INFO L82 PathProgramCache]: Analyzing trace with hash -890466136, now seen corresponding path program 1 times [2019-10-13 21:29:04,702 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:04,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058196141] [2019-10-13 21:29:04,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:04,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:04,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:04,793 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-13 21:29:04,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058196141] [2019-10-13 21:29:04,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:04,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:04,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381814762] [2019-10-13 21:29:04,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:04,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:04,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:04,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:04,796 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-13 21:29:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:05,034 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2019-10-13 21:29:05,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:05,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 21:29:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:05,039 INFO L225 Difference]: With dead ends: 557 [2019-10-13 21:29:05,039 INFO L226 Difference]: Without dead ends: 308 [2019-10-13 21:29:05,040 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-13 21:29:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-13 21:29:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-10-13 21:29:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 21:29:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-13 21:29:05,060 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-13 21:29:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:05,060 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-13 21:29:05,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-13 21:29:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:29:05,064 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:05,064 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-13 21:29:05,064 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:05,065 INFO L82 PathProgramCache]: Analyzing trace with hash -550567068, now seen corresponding path program 1 times [2019-10-13 21:29:05,065 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:05,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714732132] [2019-10-13 21:29:05,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:05,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:05,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:05,163 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-13 21:29:05,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714732132] [2019-10-13 21:29:05,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:05,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:05,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533086273] [2019-10-13 21:29:05,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:05,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:05,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:05,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:05,169 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-13 21:29:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:05,367 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-13 21:29:05,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:05,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 21:29:05,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:05,370 INFO L225 Difference]: With dead ends: 597 [2019-10-13 21:29:05,371 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 21:29:05,372 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-13 21:29:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 21:29:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-13 21:29:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 21:29:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-13 21:29:05,387 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-13 21:29:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:05,387 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-13 21:29:05,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-13 21:29:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:29:05,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:05,389 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-13 21:29:05,389 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash -80048661, now seen corresponding path program 1 times [2019-10-13 21:29:05,390 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:05,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48417576] [2019-10-13 21:29:05,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:05,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:05,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:05,475 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-13 21:29:05,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48417576] [2019-10-13 21:29:05,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:05,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:05,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688995148] [2019-10-13 21:29:05,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:05,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:05,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:05,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:05,478 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-13 21:29:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:05,722 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2019-10-13 21:29:05,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:05,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 21:29:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:05,725 INFO L225 Difference]: With dead ends: 599 [2019-10-13 21:29:05,725 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 21:29:05,726 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-13 21:29:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 21:29:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-10-13 21:29:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-13 21:29:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-13 21:29:05,754 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-13 21:29:05,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:05,754 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-13 21:29:05,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-13 21:29:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:29:05,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:05,759 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-13 21:29:05,760 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:05,760 INFO L82 PathProgramCache]: Analyzing trace with hash 597213445, now seen corresponding path program 1 times [2019-10-13 21:29:05,760 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:05,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529952133] [2019-10-13 21:29:05,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:05,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:05,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:05,841 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-13 21:29:05,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529952133] [2019-10-13 21:29:05,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:05,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:05,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429909116] [2019-10-13 21:29:05,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:05,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:05,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:05,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:05,844 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-13 21:29:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:06,031 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-13 21:29:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:06,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 21:29:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:06,034 INFO L225 Difference]: With dead ends: 600 [2019-10-13 21:29:06,034 INFO L226 Difference]: Without dead ends: 311 [2019-10-13 21:29:06,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-13 21:29:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-13 21:29:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-13 21:29:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-13 21:29:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-13 21:29:06,050 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-13 21:29:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:06,051 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-13 21:29:06,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-13 21:29:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:29:06,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:06,053 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-13 21:29:06,053 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash 301165919, now seen corresponding path program 1 times [2019-10-13 21:29:06,054 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:06,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773281136] [2019-10-13 21:29:06,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:06,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:06,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:06,116 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-13 21:29:06,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773281136] [2019-10-13 21:29:06,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:06,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:06,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860296202] [2019-10-13 21:29:06,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:06,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:06,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:06,120 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-13 21:29:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:06,325 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-13 21:29:06,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:06,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 21:29:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:06,328 INFO L225 Difference]: With dead ends: 640 [2019-10-13 21:29:06,329 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 21:29:06,330 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-13 21:29:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 21:29:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-13 21:29:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-13 21:29:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-13 21:29:06,345 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-13 21:29:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:06,347 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-13 21:29:06,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-13 21:29:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:29:06,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:06,350 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-13 21:29:06,350 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash -283935385, now seen corresponding path program 1 times [2019-10-13 21:29:06,351 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:06,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912111137] [2019-10-13 21:29:06,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:06,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:06,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:06,421 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-13 21:29:06,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912111137] [2019-10-13 21:29:06,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:06,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:06,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855870341] [2019-10-13 21:29:06,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:06,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:06,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:06,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:06,425 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-13 21:29:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:06,662 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-13 21:29:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:06,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 21:29:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:06,665 INFO L225 Difference]: With dead ends: 669 [2019-10-13 21:29:06,665 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 21:29:06,666 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-13 21:29:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 21:29:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-13 21:29:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-13 21:29:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-13 21:29:06,683 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-13 21:29:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:06,683 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-13 21:29:06,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-13 21:29:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:29:06,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:06,685 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-13 21:29:06,686 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:06,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:06,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1626624529, now seen corresponding path program 1 times [2019-10-13 21:29:06,686 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:06,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269979654] [2019-10-13 21:29:06,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:06,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:06,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:06,750 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-13 21:29:06,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269979654] [2019-10-13 21:29:06,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:06,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:06,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519619363] [2019-10-13 21:29:06,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:06,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:06,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:06,753 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-13 21:29:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:07,028 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-13 21:29:07,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:07,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-13 21:29:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:07,032 INFO L225 Difference]: With dead ends: 702 [2019-10-13 21:29:07,032 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 21:29:07,034 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-13 21:29:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 21:29:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-13 21:29:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 21:29:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-13 21:29:07,057 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-13 21:29:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:07,058 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-13 21:29:07,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-13 21:29:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:07,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:07,062 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-13 21:29:07,062 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:07,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1291287383, now seen corresponding path program 1 times [2019-10-13 21:29:07,063 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:07,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793718800] [2019-10-13 21:29:07,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:07,137 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-13 21:29:07,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793718800] [2019-10-13 21:29:07,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:07,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:07,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585293950] [2019-10-13 21:29:07,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:07,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:07,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:07,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:07,139 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-13 21:29:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:07,430 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-13 21:29:07,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:07,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:07,436 INFO L225 Difference]: With dead ends: 729 [2019-10-13 21:29:07,436 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 21:29:07,438 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-13 21:29:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 21:29:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-13 21:29:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 21:29:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-13 21:29:07,464 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-13 21:29:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:07,464 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-13 21:29:07,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-13 21:29:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:29:07,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:07,468 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-13 21:29:07,468 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:07,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:07,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1329985514, now seen corresponding path program 1 times [2019-10-13 21:29:07,469 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:07,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127279076] [2019-10-13 21:29:07,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:07,637 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-13 21:29:07,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127279076] [2019-10-13 21:29:07,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:07,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:07,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709283014] [2019-10-13 21:29:07,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:07,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:07,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:07,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:07,642 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-13 21:29:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:07,855 INFO L93 Difference]: Finished difference Result 746 states and 1198 transitions. [2019-10-13 21:29:07,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:07,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-13 21:29:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:07,858 INFO L225 Difference]: With dead ends: 746 [2019-10-13 21:29:07,858 INFO L226 Difference]: Without dead ends: 392 [2019-10-13 21:29:07,859 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-13 21:29:07,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-13 21:29:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-13 21:29:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 21:29:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-13 21:29:07,878 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-13 21:29:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:07,879 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-13 21:29:07,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-13 21:29:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:29:07,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:07,881 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-13 21:29:07,881 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:07,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1711185522, now seen corresponding path program 1 times [2019-10-13 21:29:07,882 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:07,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439879540] [2019-10-13 21:29:07,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:07,936 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-13 21:29:07,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439879540] [2019-10-13 21:29:07,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:07,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:07,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826314028] [2019-10-13 21:29:07,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:07,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:07,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:07,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:07,938 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-13 21:29:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:08,137 INFO L93 Difference]: Finished difference Result 767 states and 1221 transitions. [2019-10-13 21:29:08,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:08,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-13 21:29:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:08,140 INFO L225 Difference]: With dead ends: 767 [2019-10-13 21:29:08,140 INFO L226 Difference]: Without dead ends: 392 [2019-10-13 21:29:08,142 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-13 21:29:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-13 21:29:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-13 21:29:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 21:29:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-13 21:29:08,162 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-13 21:29:08,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:08,162 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-13 21:29:08,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-13 21:29:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 21:29:08,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:08,165 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-13 21:29:08,165 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1344904457, now seen corresponding path program 1 times [2019-10-13 21:29:08,166 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39395718] [2019-10-13 21:29:08,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:08,231 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-13 21:29:08,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39395718] [2019-10-13 21:29:08,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:08,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:08,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959278358] [2019-10-13 21:29:08,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:08,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:08,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:08,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:08,234 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-13 21:29:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:08,291 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-13 21:29:08,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:08,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-13 21:29:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:08,296 INFO L225 Difference]: With dead ends: 763 [2019-10-13 21:29:08,296 INFO L226 Difference]: Without dead ends: 761 [2019-10-13 21:29:08,298 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-13 21:29:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-13 21:29:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-13 21:29:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-13 21:29:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-13 21:29:08,343 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-13 21:29:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:08,343 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-13 21:29:08,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-13 21:29:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:29:08,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:08,346 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-13 21:29:08,347 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash -773137702, now seen corresponding path program 1 times [2019-10-13 21:29:08,347 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59272238] [2019-10-13 21:29:08,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:08,428 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-13 21:29:08,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59272238] [2019-10-13 21:29:08,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:08,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:08,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492079790] [2019-10-13 21:29:08,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:08,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:08,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:08,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:08,438 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 5 states. [2019-10-13 21:29:08,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:08,711 INFO L93 Difference]: Finished difference Result 1593 states and 2521 transitions. [2019-10-13 21:29:08,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:08,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-10-13 21:29:08,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:08,717 INFO L225 Difference]: With dead ends: 1593 [2019-10-13 21:29:08,718 INFO L226 Difference]: Without dead ends: 845 [2019-10-13 21:29:08,720 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-13 21:29:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-10-13 21:29:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2019-10-13 21:29:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-10-13 21:29:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1319 transitions. [2019-10-13 21:29:08,755 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1319 transitions. Word has length 127 [2019-10-13 21:29:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:08,755 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1319 transitions. [2019-10-13 21:29:08,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1319 transitions. [2019-10-13 21:29:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:29:08,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:08,758 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-13 21:29:08,759 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash -260517251, now seen corresponding path program 1 times [2019-10-13 21:29:08,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219533127] [2019-10-13 21:29:08,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:08,816 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-13 21:29:08,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219533127] [2019-10-13 21:29:08,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:08,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:08,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057249184] [2019-10-13 21:29:08,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:08,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:08,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:08,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:08,819 INFO L87 Difference]: Start difference. First operand 837 states and 1319 transitions. Second operand 5 states. [2019-10-13 21:29:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,078 INFO L93 Difference]: Finished difference Result 1669 states and 2633 transitions. [2019-10-13 21:29:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-13 21:29:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,084 INFO L225 Difference]: With dead ends: 1669 [2019-10-13 21:29:09,084 INFO L226 Difference]: Without dead ends: 841 [2019-10-13 21:29:09,087 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-13 21:29:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-10-13 21:29:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 833. [2019-10-13 21:29:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-10-13 21:29:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1307 transitions. [2019-10-13 21:29:09,125 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1307 transitions. Word has length 128 [2019-10-13 21:29:09,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,125 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1307 transitions. [2019-10-13 21:29:09,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1307 transitions. [2019-10-13 21:29:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 21:29:09,128 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,128 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-13 21:29:09,129 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1086305590, now seen corresponding path program 1 times [2019-10-13 21:29:09,129 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434904567] [2019-10-13 21:29:09,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,206 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-13 21:29:09,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434904567] [2019-10-13 21:29:09,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:09,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140581052] [2019-10-13 21:29:09,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:09,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:09,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:09,208 INFO L87 Difference]: Start difference. First operand 833 states and 1307 transitions. Second operand 5 states. [2019-10-13 21:29:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,489 INFO L93 Difference]: Finished difference Result 1729 states and 2717 transitions. [2019-10-13 21:29:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-13 21:29:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,495 INFO L225 Difference]: With dead ends: 1729 [2019-10-13 21:29:09,496 INFO L226 Difference]: Without dead ends: 909 [2019-10-13 21:29:09,498 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-13 21:29:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-10-13 21:29:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 905. [2019-10-13 21:29:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-10-13 21:29:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1415 transitions. [2019-10-13 21:29:09,574 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1415 transitions. Word has length 160 [2019-10-13 21:29:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,575 INFO L462 AbstractCegarLoop]: Abstraction has 905 states and 1415 transitions. [2019-10-13 21:29:09,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1415 transitions. [2019-10-13 21:29:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:29:09,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,582 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-13 21:29:09,582 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash -643380505, now seen corresponding path program 1 times [2019-10-13 21:29:09,583 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255490216] [2019-10-13 21:29:09,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,680 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-13 21:29:09,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255490216] [2019-10-13 21:29:09,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:09,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071893942] [2019-10-13 21:29:09,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:09,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:09,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:09,684 INFO L87 Difference]: Start difference. First operand 905 states and 1415 transitions. Second operand 5 states. [2019-10-13 21:29:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,020 INFO L93 Difference]: Finished difference Result 1801 states and 2817 transitions. [2019-10-13 21:29:10,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:10,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-13 21:29:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,027 INFO L225 Difference]: With dead ends: 1801 [2019-10-13 21:29:10,027 INFO L226 Difference]: Without dead ends: 905 [2019-10-13 21:29:10,031 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-13 21:29:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-10-13 21:29:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 901. [2019-10-13 21:29:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-13 21:29:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1401 transitions. [2019-10-13 21:29:10,087 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1401 transitions. Word has length 161 [2019-10-13 21:29:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,088 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1401 transitions. [2019-10-13 21:29:10,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1401 transitions. [2019-10-13 21:29:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-13 21:29:10,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,096 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-13 21:29:10,097 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash -306607681, now seen corresponding path program 1 times [2019-10-13 21:29:10,098 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876135231] [2019-10-13 21:29:10,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,294 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-13 21:29:10,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876135231] [2019-10-13 21:29:10,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:10,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775261282] [2019-10-13 21:29:10,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:10,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:10,298 INFO L87 Difference]: Start difference. First operand 901 states and 1401 transitions. Second operand 5 states. [2019-10-13 21:29:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,637 INFO L93 Difference]: Finished difference Result 1861 states and 2897 transitions. [2019-10-13 21:29:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:10,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-10-13 21:29:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,645 INFO L225 Difference]: With dead ends: 1861 [2019-10-13 21:29:10,645 INFO L226 Difference]: Without dead ends: 973 [2019-10-13 21:29:10,648 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-13 21:29:10,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-10-13 21:29:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 969. [2019-10-13 21:29:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-10-13 21:29:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1499 transitions. [2019-10-13 21:29:10,714 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1499 transitions. Word has length 191 [2019-10-13 21:29:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,715 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1499 transitions. [2019-10-13 21:29:10,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1499 transitions. [2019-10-13 21:29:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 21:29:10,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,722 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-13 21:29:10,722 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1259797154, now seen corresponding path program 1 times [2019-10-13 21:29:10,723 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617523316] [2019-10-13 21:29:10,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,835 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-13 21:29:10,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617523316] [2019-10-13 21:29:10,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:10,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387864238] [2019-10-13 21:29:10,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:10,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:10,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:10,846 INFO L87 Difference]: Start difference. First operand 969 states and 1499 transitions. Second operand 5 states. [2019-10-13 21:29:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,164 INFO L93 Difference]: Finished difference Result 1929 states and 2985 transitions. [2019-10-13 21:29:11,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:11,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-10-13 21:29:11,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,170 INFO L225 Difference]: With dead ends: 1929 [2019-10-13 21:29:11,170 INFO L226 Difference]: Without dead ends: 969 [2019-10-13 21:29:11,173 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-13 21:29:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-10-13 21:29:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 965. [2019-10-13 21:29:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-10-13 21:29:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1483 transitions. [2019-10-13 21:29:11,217 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1483 transitions. Word has length 192 [2019-10-13 21:29:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,218 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1483 transitions. [2019-10-13 21:29:11,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1483 transitions. [2019-10-13 21:29:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-13 21:29:11,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,222 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-13 21:29:11,223 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,223 INFO L82 PathProgramCache]: Analyzing trace with hash 637510067, now seen corresponding path program 1 times [2019-10-13 21:29:11,224 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876939064] [2019-10-13 21:29:11,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,353 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-13 21:29:11,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876939064] [2019-10-13 21:29:11,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:11,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687132424] [2019-10-13 21:29:11,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:11,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:11,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:11,355 INFO L87 Difference]: Start difference. First operand 965 states and 1483 transitions. Second operand 5 states. [2019-10-13 21:29:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,610 INFO L93 Difference]: Finished difference Result 1993 states and 3073 transitions. [2019-10-13 21:29:11,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:11,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-10-13 21:29:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,619 INFO L225 Difference]: With dead ends: 1993 [2019-10-13 21:29:11,619 INFO L226 Difference]: Without dead ends: 1041 [2019-10-13 21:29:11,624 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-13 21:29:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-13 21:29:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-10-13 21:29:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-13 21:29:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1547 transitions. [2019-10-13 21:29:11,691 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1547 transitions. Word has length 209 [2019-10-13 21:29:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,691 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1547 transitions. [2019-10-13 21:29:11,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1547 transitions. [2019-10-13 21:29:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-13 21:29:11,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,698 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-13 21:29:11,698 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1262219653, now seen corresponding path program 1 times [2019-10-13 21:29:11,699 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207847133] [2019-10-13 21:29:11,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,812 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-13 21:29:11,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207847133] [2019-10-13 21:29:11,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:11,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542886482] [2019-10-13 21:29:11,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:11,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:11,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:11,817 INFO L87 Difference]: Start difference. First operand 1015 states and 1547 transitions. Second operand 5 states. [2019-10-13 21:29:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,092 INFO L93 Difference]: Finished difference Result 2043 states and 3119 transitions. [2019-10-13 21:29:12,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:12,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-10-13 21:29:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,100 INFO L225 Difference]: With dead ends: 2043 [2019-10-13 21:29:12,101 INFO L226 Difference]: Without dead ends: 1041 [2019-10-13 21:29:12,104 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-13 21:29:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-13 21:29:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-10-13 21:29:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-13 21:29:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1529 transitions. [2019-10-13 21:29:12,162 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1529 transitions. Word has length 210 [2019-10-13 21:29:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,163 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1529 transitions. [2019-10-13 21:29:12,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1529 transitions. [2019-10-13 21:29:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-13 21:29:12,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,168 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-13 21:29:12,168 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1315202570, now seen corresponding path program 1 times [2019-10-13 21:29:12,169 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189025183] [2019-10-13 21:29:12,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,285 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-13 21:29:12,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189025183] [2019-10-13 21:29:12,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:12,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225340722] [2019-10-13 21:29:12,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:12,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:12,289 INFO L87 Difference]: Start difference. First operand 1015 states and 1529 transitions. Second operand 5 states. [2019-10-13 21:29:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,623 INFO L93 Difference]: Finished difference Result 2025 states and 3051 transitions. [2019-10-13 21:29:12,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:12,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-10-13 21:29:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,632 INFO L225 Difference]: With dead ends: 2025 [2019-10-13 21:29:12,632 INFO L226 Difference]: Without dead ends: 1023 [2019-10-13 21:29:12,638 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-13 21:29:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-10-13 21:29:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1015. [2019-10-13 21:29:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-13 21:29:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1517 transitions. [2019-10-13 21:29:12,718 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1517 transitions. Word has length 222 [2019-10-13 21:29:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,719 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1517 transitions. [2019-10-13 21:29:12,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1517 transitions. [2019-10-13 21:29:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-13 21:29:12,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,727 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-13 21:29:12,727 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1975125977, now seen corresponding path program 1 times [2019-10-13 21:29:12,731 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211019724] [2019-10-13 21:29:12,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,824 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-13 21:29:12,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211019724] [2019-10-13 21:29:12,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:12,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967366410] [2019-10-13 21:29:12,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:12,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:12,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:12,827 INFO L87 Difference]: Start difference. First operand 1015 states and 1517 transitions. Second operand 5 states. [2019-10-13 21:29:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,064 INFO L93 Difference]: Finished difference Result 2025 states and 3027 transitions. [2019-10-13 21:29:13,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:13,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-10-13 21:29:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,070 INFO L225 Difference]: With dead ends: 2025 [2019-10-13 21:29:13,070 INFO L226 Difference]: Without dead ends: 1005 [2019-10-13 21:29:13,072 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-13 21:29:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-10-13 21:29:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 997. [2019-10-13 21:29:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-10-13 21:29:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1479 transitions. [2019-10-13 21:29:13,119 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1479 transitions. Word has length 223 [2019-10-13 21:29:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,119 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1479 transitions. [2019-10-13 21:29:13,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1479 transitions. [2019-10-13 21:29:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-13 21:29:13,123 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,123 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-13 21:29:13,124 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1054088717, now seen corresponding path program 1 times [2019-10-13 21:29:13,124 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438217148] [2019-10-13 21:29:13,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,224 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-13 21:29:13,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438217148] [2019-10-13 21:29:13,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:13,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:13,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464952231] [2019-10-13 21:29:13,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:13,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:13,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:13,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:13,226 INFO L87 Difference]: Start difference. First operand 997 states and 1479 transitions. Second operand 5 states. [2019-10-13 21:29:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,499 INFO L93 Difference]: Finished difference Result 2035 states and 3025 transitions. [2019-10-13 21:29:13,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:13,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-10-13 21:29:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,506 INFO L225 Difference]: With dead ends: 2035 [2019-10-13 21:29:13,506 INFO L226 Difference]: Without dead ends: 1051 [2019-10-13 21:29:13,509 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-13 21:29:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-10-13 21:29:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1043. [2019-10-13 21:29:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-10-13 21:29:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1533 transitions. [2019-10-13 21:29:13,590 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1533 transitions. Word has length 230 [2019-10-13 21:29:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,591 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1533 transitions. [2019-10-13 21:29:13,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1533 transitions. [2019-10-13 21:29:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-13 21:29:13,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,598 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-13 21:29:13,599 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash 364858085, now seen corresponding path program 1 times [2019-10-13 21:29:13,600 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547525467] [2019-10-13 21:29:13,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,683 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-13 21:29:13,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547525467] [2019-10-13 21:29:13,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:13,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:13,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681629074] [2019-10-13 21:29:13,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:13,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:13,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:13,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:13,686 INFO L87 Difference]: Start difference. First operand 1043 states and 1533 transitions. Second operand 5 states. [2019-10-13 21:29:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,916 INFO L93 Difference]: Finished difference Result 2081 states and 3059 transitions. [2019-10-13 21:29:13,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:13,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-10-13 21:29:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,922 INFO L225 Difference]: With dead ends: 2081 [2019-10-13 21:29:13,922 INFO L226 Difference]: Without dead ends: 1043 [2019-10-13 21:29:13,924 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-13 21:29:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-10-13 21:29:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1035. [2019-10-13 21:29:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-10-13 21:29:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1501 transitions. [2019-10-13 21:29:13,978 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1501 transitions. Word has length 231 [2019-10-13 21:29:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,978 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1501 transitions. [2019-10-13 21:29:13,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1501 transitions. [2019-10-13 21:29:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-13 21:29:13,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,983 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-13 21:29:13,983 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,984 INFO L82 PathProgramCache]: Analyzing trace with hash -567208800, now seen corresponding path program 1 times [2019-10-13 21:29:13,984 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267148006] [2019-10-13 21:29:13,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:14,145 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-13 21:29:14,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267148006] [2019-10-13 21:29:14,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69453954] [2019-10-13 21:29:14,145 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-13 21:29:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:14,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:14,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:14,391 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-13 21:29:14,392 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:14,482 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-13 21:29:14,483 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:14,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-13 21:29:14,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650688826] [2019-10-13 21:29:14,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:14,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:14,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:14,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:14,485 INFO L87 Difference]: Start difference. First operand 1035 states and 1501 transitions. Second operand 3 states. [2019-10-13 21:29:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:14,603 INFO L93 Difference]: Finished difference Result 2567 states and 3726 transitions. [2019-10-13 21:29:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:14,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-10-13 21:29:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:14,611 INFO L225 Difference]: With dead ends: 2567 [2019-10-13 21:29:14,612 INFO L226 Difference]: Without dead ends: 1545 [2019-10-13 21:29:14,614 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-13 21:29:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2019-10-13 21:29:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2019-10-13 21:29:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2019-10-13 21:29:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2241 transitions. [2019-10-13 21:29:14,722 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2241 transitions. Word has length 267 [2019-10-13 21:29:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:14,722 INFO L462 AbstractCegarLoop]: Abstraction has 1545 states and 2241 transitions. [2019-10-13 21:29:14,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2241 transitions. [2019-10-13 21:29:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-13 21:29:14,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:14,729 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-13 21:29:14,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:14,943 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,943 INFO L82 PathProgramCache]: Analyzing trace with hash 767374129, now seen corresponding path program 1 times [2019-10-13 21:29:14,944 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:14,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272368140] [2019-10-13 21:29:14,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,176 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-13 21:29:15,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272368140] [2019-10-13 21:29:15,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:15,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:15,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344316425] [2019-10-13 21:29:15,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:15,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:15,179 INFO L87 Difference]: Start difference. First operand 1545 states and 2241 transitions. Second operand 3 states. [2019-10-13 21:29:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:15,332 INFO L93 Difference]: Finished difference Result 4528 states and 6569 transitions. [2019-10-13 21:29:15,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:15,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-13 21:29:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:15,346 INFO L225 Difference]: With dead ends: 4528 [2019-10-13 21:29:15,347 INFO L226 Difference]: Without dead ends: 2996 [2019-10-13 21:29:15,351 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-13 21:29:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-10-13 21:29:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2994. [2019-10-13 21:29:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2019-10-13 21:29:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 4335 transitions. [2019-10-13 21:29:15,583 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 4335 transitions. Word has length 274 [2019-10-13 21:29:15,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:15,583 INFO L462 AbstractCegarLoop]: Abstraction has 2994 states and 4335 transitions. [2019-10-13 21:29:15,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 4335 transitions. [2019-10-13 21:29:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-13 21:29:15,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:15,593 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-13 21:29:15,593 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:15,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1658002288, now seen corresponding path program 1 times [2019-10-13 21:29:15,594 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:15,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950867031] [2019-10-13 21:29:15,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,881 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-13 21:29:15,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950867031] [2019-10-13 21:29:15,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:15,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:15,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096932191] [2019-10-13 21:29:15,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:15,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:15,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:15,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:15,883 INFO L87 Difference]: Start difference. First operand 2994 states and 4335 transitions. Second operand 3 states. [2019-10-13 21:29:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:16,223 INFO L93 Difference]: Finished difference Result 6095 states and 8845 transitions. [2019-10-13 21:29:16,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:16,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-13 21:29:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:16,237 INFO L225 Difference]: With dead ends: 6095 [2019-10-13 21:29:16,237 INFO L226 Difference]: Without dead ends: 1997 [2019-10-13 21:29:16,247 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-13 21:29:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-10-13 21:29:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1977. [2019-10-13 21:29:16,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-10-13 21:29:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2813 transitions. [2019-10-13 21:29:16,410 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2813 transitions. Word has length 311 [2019-10-13 21:29:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:16,411 INFO L462 AbstractCegarLoop]: Abstraction has 1977 states and 2813 transitions. [2019-10-13 21:29:16,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2813 transitions. [2019-10-13 21:29:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-13 21:29:16,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:16,429 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-13 21:29:16,429 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash -872859034, now seen corresponding path program 1 times [2019-10-13 21:29:16,430 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:16,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296921090] [2019-10-13 21:29:16,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,674 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-13 21:29:16,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296921090] [2019-10-13 21:29:16,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484200968] [2019-10-13 21:29:16,685 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-13 21:29:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:16,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:17,136 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-13 21:29:17,136 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:17,324 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-13 21:29:17,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [670067703] [2019-10-13 21:29:17,334 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 378 [2019-10-13 21:29:17,414 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:17,415 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:17,716 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:29:19,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:19,718 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-13 21:29:19,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:19,726 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:19,726 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:19,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:29:19,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68448774] [2019-10-13 21:29:19,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:19,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:19,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:19,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:19,728 INFO L87 Difference]: Start difference. First operand 1977 states and 2813 transitions. Second operand 6 states. [2019-10-13 21:29:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:20,473 INFO L93 Difference]: Finished difference Result 4565 states and 6483 transitions. [2019-10-13 21:29:20,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:29:20,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 377 [2019-10-13 21:29:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:20,487 INFO L225 Difference]: With dead ends: 4565 [2019-10-13 21:29:20,487 INFO L226 Difference]: Without dead ends: 2551 [2019-10-13 21:29:20,493 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-13 21:29:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-10-13 21:29:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 1910. [2019-10-13 21:29:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-13 21:29:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2606 transitions. [2019-10-13 21:29:20,645 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2606 transitions. Word has length 377 [2019-10-13 21:29:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:20,646 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2606 transitions. [2019-10-13 21:29:20,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2606 transitions. [2019-10-13 21:29:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-10-13 21:29:20,662 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:20,663 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-13 21:29:20,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:20,868 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:20,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1790317548, now seen corresponding path program 1 times [2019-10-13 21:29:20,869 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:20,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406448096] [2019-10-13 21:29:20,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:21,355 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-13 21:29:21,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406448096] [2019-10-13 21:29:21,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251238437] [2019-10-13 21:29:21,357 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-13 21:29:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:21,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:21,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:21,989 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-13 21:29:21,989 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:22,266 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-13 21:29:22,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [89921720] [2019-10-13 21:29:22,267 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 606 [2019-10-13 21:29:22,272 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:22,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:22,336 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:29:23,822 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:23,822 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-13 21:29:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:23,823 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:23,823 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:23,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:29:23,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307558865] [2019-10-13 21:29:23,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:23,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:23,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:23,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:23,826 INFO L87 Difference]: Start difference. First operand 1910 states and 2606 transitions. Second operand 6 states. [2019-10-13 21:29:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:24,516 INFO L93 Difference]: Finished difference Result 5910 states and 8155 transitions. [2019-10-13 21:29:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:29:24,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 605 [2019-10-13 21:29:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:24,543 INFO L225 Difference]: With dead ends: 5910 [2019-10-13 21:29:24,544 INFO L226 Difference]: Without dead ends: 3877 [2019-10-13 21:29:24,550 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-13 21:29:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2019-10-13 21:29:24,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 2166. [2019-10-13 21:29:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-10-13 21:29:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2994 transitions. [2019-10-13 21:29:24,672 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2994 transitions. Word has length 605 [2019-10-13 21:29:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:24,673 INFO L462 AbstractCegarLoop]: Abstraction has 2166 states and 2994 transitions. [2019-10-13 21:29:24,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2994 transitions. [2019-10-13 21:29:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-10-13 21:29:24,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:24,682 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-13 21:29:24,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:24,890 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:24,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:24,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1901319823, now seen corresponding path program 1 times [2019-10-13 21:29:24,890 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:24,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688511551] [2019-10-13 21:29:24,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:25,397 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-13 21:29:25,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688511551] [2019-10-13 21:29:25,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:25,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:25,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106576846] [2019-10-13 21:29:25,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:25,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:25,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:25,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:25,400 INFO L87 Difference]: Start difference. First operand 2166 states and 2994 transitions. Second operand 3 states. [2019-10-13 21:29:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:25,623 INFO L93 Difference]: Finished difference Result 4353 states and 6010 transitions. [2019-10-13 21:29:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:25,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 675 [2019-10-13 21:29:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:25,629 INFO L225 Difference]: With dead ends: 4353 [2019-10-13 21:29:25,629 INFO L226 Difference]: Without dead ends: 2206 [2019-10-13 21:29:25,635 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-13 21:29:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2019-10-13 21:29:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2166. [2019-10-13 21:29:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-10-13 21:29:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2974 transitions. [2019-10-13 21:29:25,736 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2974 transitions. Word has length 675 [2019-10-13 21:29:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:25,736 INFO L462 AbstractCegarLoop]: Abstraction has 2166 states and 2974 transitions. [2019-10-13 21:29:25,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2974 transitions. [2019-10-13 21:29:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-10-13 21:29:25,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:25,745 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-13 21:29:25,745 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:25,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:25,745 INFO L82 PathProgramCache]: Analyzing trace with hash -554544010, now seen corresponding path program 1 times [2019-10-13 21:29:25,746 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:25,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276087029] [2019-10-13 21:29:25,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:25,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:25,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:26,144 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-13 21:29:26,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276087029] [2019-10-13 21:29:26,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:26,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:26,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394325558] [2019-10-13 21:29:26,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:26,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:26,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:26,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:26,146 INFO L87 Difference]: Start difference. First operand 2166 states and 2974 transitions. Second operand 3 states. [2019-10-13 21:29:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:26,371 INFO L93 Difference]: Finished difference Result 4334 states and 5948 transitions. [2019-10-13 21:29:26,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:26,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-10-13 21:29:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:26,376 INFO L225 Difference]: With dead ends: 4334 [2019-10-13 21:29:26,376 INFO L226 Difference]: Without dead ends: 2187 [2019-10-13 21:29:26,380 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-13 21:29:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-10-13 21:29:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2166. [2019-10-13 21:29:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-10-13 21:29:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2958 transitions. [2019-10-13 21:29:26,484 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2958 transitions. Word has length 689 [2019-10-13 21:29:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:26,485 INFO L462 AbstractCegarLoop]: Abstraction has 2166 states and 2958 transitions. [2019-10-13 21:29:26,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2958 transitions. [2019-10-13 21:29:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-10-13 21:29:26,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:26,493 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-13 21:29:26,493 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:26,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:26,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1850705057, now seen corresponding path program 1 times [2019-10-13 21:29:26,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:26,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323874130] [2019-10-13 21:29:26,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:26,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:26,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:26,822 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-13 21:29:26,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323874130] [2019-10-13 21:29:26,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:26,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:26,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493713132] [2019-10-13 21:29:26,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:26,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:26,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:26,824 INFO L87 Difference]: Start difference. First operand 2166 states and 2958 transitions. Second operand 3 states. [2019-10-13 21:29:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:27,043 INFO L93 Difference]: Finished difference Result 4387 states and 5993 transitions. [2019-10-13 21:29:27,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:27,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2019-10-13 21:29:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:27,049 INFO L225 Difference]: With dead ends: 4387 [2019-10-13 21:29:27,049 INFO L226 Difference]: Without dead ends: 2222 [2019-10-13 21:29:27,053 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-13 21:29:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2019-10-13 21:29:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2208. [2019-10-13 21:29:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2019-10-13 21:29:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2991 transitions. [2019-10-13 21:29:27,157 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2991 transitions. Word has length 717 [2019-10-13 21:29:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:27,158 INFO L462 AbstractCegarLoop]: Abstraction has 2208 states and 2991 transitions. [2019-10-13 21:29:27,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2991 transitions. [2019-10-13 21:29:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-10-13 21:29:27,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:27,167 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-13 21:29:27,168 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1896110854, now seen corresponding path program 1 times [2019-10-13 21:29:27,168 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:27,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107256773] [2019-10-13 21:29:27,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:27,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:27,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:27,535 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-13 21:29:27,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107256773] [2019-10-13 21:29:27,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:27,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:27,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059494197] [2019-10-13 21:29:27,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:27,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:27,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:27,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:27,537 INFO L87 Difference]: Start difference. First operand 2208 states and 2991 transitions. Second operand 3 states. [2019-10-13 21:29:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:27,699 INFO L93 Difference]: Finished difference Result 2838 states and 3828 transitions. [2019-10-13 21:29:27,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:27,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-10-13 21:29:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:27,700 INFO L225 Difference]: With dead ends: 2838 [2019-10-13 21:29:27,701 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:29:27,707 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-13 21:29:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:29:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:29:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:29:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:29:27,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2019-10-13 21:29:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:27,709 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:29:27,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:29:27,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:29:27,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:29:27,831 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 148 [2019-10-13 21:29:28,689 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 183 [2019-10-13 21:29:29,107 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 162 [2019-10-13 21:29:29,504 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 190