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_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:27:58,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:27:58,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:27:58,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:27:58,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:27:58,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:27:58,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:27:58,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:27:58,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:27:58,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:27:58,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:27:58,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:27:58,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:27:59,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:27:59,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:27:59,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:27:59,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:27:59,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:27:59,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:27:59,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:27:59,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:27:59,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:27:59,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:27:59,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:27:59,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:27:59,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:27:59,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:27:59,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:27:59,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:27:59,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:27:59,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:27:59,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:27:59,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:27:59,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:27:59,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:27:59,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:27:59,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:27:59,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:27:59,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:27:59,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:27:59,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:27:59,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:27:59,067 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:27:59,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:27:59,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:27:59,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:27:59,070 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:27:59,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:27:59,071 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:27:59,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:27:59,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:27:59,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:27:59,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:27:59,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:27:59,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:27:59,072 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:27:59,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:27:59,072 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:27:59,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:27:59,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:27:59,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:27:59,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:27:59,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:27:59,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:59,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:27:59,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:27:59,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:27:59,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:27:59,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:27:59,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:27:59,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:27:59,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:27:59,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:27:59,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:27:59,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:27:59,417 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:27:59,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-10-15 01:27:59,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb8e200a/655aeef77b2344d89f84381ee167b33b/FLAG7553b6a01 [2019-10-15 01:28:00,079 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:00,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-10-15 01:28:00,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb8e200a/655aeef77b2344d89f84381ee167b33b/FLAG7553b6a01 [2019-10-15 01:28:00,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb8e200a/655aeef77b2344d89f84381ee167b33b [2019-10-15 01:28:00,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:00,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:00,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:00,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:00,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:00,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:00" (1/1) ... [2019-10-15 01:28:00,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39fb0a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:00, skipping insertion in model container [2019-10-15 01:28:00,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:00" (1/1) ... [2019-10-15 01:28:00,447 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:00,515 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:00,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:00,931 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:01,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:01,033 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:01,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:01 WrapperNode [2019-10-15 01:28:01,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:01,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:01,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:01,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:01,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:01" (1/1) ... [2019-10-15 01:28:01,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:01" (1/1) ... [2019-10-15 01:28:01,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:01" (1/1) ... [2019-10-15 01:28:01,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:01" (1/1) ... [2019-10-15 01:28:01,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:01" (1/1) ... [2019-10-15 01:28:01,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:01" (1/1) ... [2019-10-15 01:28:01,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:01" (1/1) ... [2019-10-15 01:28:01,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:01,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:01,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:01,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:01,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28: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-15 01:28:01,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:01,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:01,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 01:28:01,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:01,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:28:01,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:01,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:28:01,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:28:01,165 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 01:28:01,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:01,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:01,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:01,457 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:28:01,944 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 01:28:01,944 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 01:28:01,947 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:01,947 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:28:01,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:01 BoogieIcfgContainer [2019-10-15 01:28:01,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:01,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:01,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:01,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:01,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:00" (1/3) ... [2019-10-15 01:28:01,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722113cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:01, skipping insertion in model container [2019-10-15 01:28:01,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:01" (2/3) ... [2019-10-15 01:28:01,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722113cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:01, skipping insertion in model container [2019-10-15 01:28:01,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:01" (3/3) ... [2019-10-15 01:28:01,958 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2019-10-15 01:28:01,969 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:01,978 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:01,991 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:02,020 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:02,021 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:02,021 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:02,021 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:02,021 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:02,022 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:02,022 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:02,022 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-15 01:28:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:28:02,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:02,058 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:02,060 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:02,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:02,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-10-15 01:28:02,077 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:02,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903779537] [2019-10-15 01:28:02,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:02,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903779537] [2019-10-15 01:28:02,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:02,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:02,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529475770] [2019-10-15 01:28:02,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:02,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:02,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:02,492 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-15 01:28:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:02,962 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-15 01:28:02,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:02,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-15 01:28:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:02,981 INFO L225 Difference]: With dead ends: 337 [2019-10-15 01:28:02,981 INFO L226 Difference]: Without dead ends: 180 [2019-10-15 01:28:02,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-15 01:28:03,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-15 01:28:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-15 01:28:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-15 01:28:03,115 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-15 01:28:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:03,117 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-15 01:28:03,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-15 01:28:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:28:03,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:03,122 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:03,123 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:03,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:03,124 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-10-15 01:28:03,124 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:03,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470751222] [2019-10-15 01:28:03,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:03,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470751222] [2019-10-15 01:28:03,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:03,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:03,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363906255] [2019-10-15 01:28:03,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:03,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:03,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:03,314 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-15 01:28:03,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:03,634 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-15 01:28:03,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:03,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-15 01:28:03,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:03,641 INFO L225 Difference]: With dead ends: 385 [2019-10-15 01:28:03,642 INFO L226 Difference]: Without dead ends: 221 [2019-10-15 01:28:03,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-15 01:28:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-15 01:28:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-15 01:28:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-15 01:28:03,687 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-15 01:28:03,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:03,688 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-15 01:28:03,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-15 01:28:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:03,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:03,695 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:03,695 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:03,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:03,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2018770907, now seen corresponding path program 1 times [2019-10-15 01:28:03,698 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:03,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511522211] [2019-10-15 01:28:03,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:03,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511522211] [2019-10-15 01:28:03,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:03,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:03,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78200142] [2019-10-15 01:28:03,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:03,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:03,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:03,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:03,858 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-15 01:28:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,097 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-15 01:28:04,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:04,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,101 INFO L225 Difference]: With dead ends: 450 [2019-10-15 01:28:04,101 INFO L226 Difference]: Without dead ends: 247 [2019-10-15 01:28:04,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-15 01:28:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-15 01:28:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-15 01:28:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-15 01:28:04,120 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-15 01:28:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,121 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-15 01:28:04,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-15 01:28:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:28:04,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,124 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:04,124 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1670289669, now seen corresponding path program 1 times [2019-10-15 01:28:04,125 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938718312] [2019-10-15 01:28:04,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:04,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938718312] [2019-10-15 01:28:04,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:04,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:04,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273671490] [2019-10-15 01:28:04,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:04,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:04,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:04,224 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-15 01:28:04,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,450 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-15 01:28:04,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:04,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-15 01:28:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,453 INFO L225 Difference]: With dead ends: 498 [2019-10-15 01:28:04,453 INFO L226 Difference]: Without dead ends: 264 [2019-10-15 01:28:04,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-15 01:28:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-15 01:28:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-15 01:28:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-15 01:28:04,470 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-15 01:28:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,471 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-15 01:28:04,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-15 01:28:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:28:04,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,474 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:04,474 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,475 INFO L82 PathProgramCache]: Analyzing trace with hash -288738650, now seen corresponding path program 1 times [2019-10-15 01:28:04,475 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155516054] [2019-10-15 01:28:04,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:04,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155516054] [2019-10-15 01:28:04,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:04,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:04,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293326338] [2019-10-15 01:28:04,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:04,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:04,570 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-15 01:28:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,848 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2019-10-15 01:28:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:04,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-15 01:28:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,853 INFO L225 Difference]: With dead ends: 557 [2019-10-15 01:28:04,853 INFO L226 Difference]: Without dead ends: 308 [2019-10-15 01:28:04,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-15 01:28:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-10-15 01:28:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-15 01:28:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-15 01:28:04,868 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-15 01:28:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,869 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-15 01:28:04,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-15 01:28:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:28:04,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,871 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:04,872 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1782320931, now seen corresponding path program 1 times [2019-10-15 01:28:04,872 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114118489] [2019-10-15 01:28:04,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:04,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114118489] [2019-10-15 01:28:04,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:04,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:04,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704304981] [2019-10-15 01:28:04,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:04,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:04,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:04,944 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-15 01:28:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,150 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-15 01:28:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-15 01:28:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,153 INFO L225 Difference]: With dead ends: 597 [2019-10-15 01:28:05,153 INFO L226 Difference]: Without dead ends: 306 [2019-10-15 01:28:05,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-15 01:28:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-15 01:28:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-15 01:28:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-15 01:28:05,168 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-15 01:28:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,169 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-15 01:28:05,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-15 01:28:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:28:05,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,171 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:05,171 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1133000297, now seen corresponding path program 1 times [2019-10-15 01:28:05,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230241362] [2019-10-15 01:28:05,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:05,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230241362] [2019-10-15 01:28:05,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:05,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160470607] [2019-10-15 01:28:05,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:05,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:05,231 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-15 01:28:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,475 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2019-10-15 01:28:05,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-15 01:28:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,478 INFO L225 Difference]: With dead ends: 599 [2019-10-15 01:28:05,478 INFO L226 Difference]: Without dead ends: 306 [2019-10-15 01:28:05,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-15 01:28:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-10-15 01:28:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-15 01:28:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-15 01:28:05,493 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-15 01:28:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,493 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-15 01:28:05,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-15 01:28:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:28:05,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,495 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:05,495 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1158896476, now seen corresponding path program 1 times [2019-10-15 01:28:05,496 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149342674] [2019-10-15 01:28:05,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-15 01:28:05,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149342674] [2019-10-15 01:28:05,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:05,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828085558] [2019-10-15 01:28:05,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:05,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:05,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:05,543 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-15 01:28:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,702 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-15 01:28:05,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 01:28:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,705 INFO L225 Difference]: With dead ends: 600 [2019-10-15 01:28:05,706 INFO L226 Difference]: Without dead ends: 311 [2019-10-15 01:28:05,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-15 01:28:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-15 01:28:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-15 01:28:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-15 01:28:05,721 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-15 01:28:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,722 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-15 01:28:05,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-15 01:28:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:28:05,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,724 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:05,724 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,724 INFO L82 PathProgramCache]: Analyzing trace with hash 344707902, now seen corresponding path program 1 times [2019-10-15 01:28:05,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868481248] [2019-10-15 01:28:05,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:05,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868481248] [2019-10-15 01:28:05,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:05,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461778475] [2019-10-15 01:28:05,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:05,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:05,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:05,802 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-15 01:28:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,031 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-15 01:28:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:06,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-15 01:28:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,035 INFO L225 Difference]: With dead ends: 640 [2019-10-15 01:28:06,035 INFO L226 Difference]: Without dead ends: 342 [2019-10-15 01:28: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-15 01:28:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-15 01:28:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-15 01:28:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-15 01:28:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-15 01:28:06,052 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-15 01:28:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,054 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-15 01:28:06,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-15 01:28:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:28:06,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,056 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:06,056 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1538356794, now seen corresponding path program 1 times [2019-10-15 01:28:06,057 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419687819] [2019-10-15 01:28:06,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:06,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419687819] [2019-10-15 01:28:06,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:06,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:06,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426307566] [2019-10-15 01:28:06,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:06,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:06,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:06,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:06,124 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-15 01:28:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,330 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-15 01:28:06,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:06,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-15 01:28:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,333 INFO L225 Difference]: With dead ends: 669 [2019-10-15 01:28:06,333 INFO L226 Difference]: Without dead ends: 342 [2019-10-15 01:28:06,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-15 01:28:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-15 01:28:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-15 01:28:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-15 01:28:06,353 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-15 01:28:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,353 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-15 01:28:06,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-15 01:28:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:06,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,355 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:06,356 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1488538894, now seen corresponding path program 1 times [2019-10-15 01:28:06,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981428068] [2019-10-15 01:28:06,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:06,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981428068] [2019-10-15 01:28:06,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:06,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:06,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507064557] [2019-10-15 01:28:06,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:06,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:06,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:06,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:06,419 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-15 01:28:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,805 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-15 01:28:06,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:06,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,808 INFO L225 Difference]: With dead ends: 702 [2019-10-15 01:28:06,808 INFO L226 Difference]: Without dead ends: 375 [2019-10-15 01:28:06,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-15 01:28:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-15 01:28:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-15 01:28:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-15 01:28:06,827 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-15 01:28:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,827 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-15 01:28:06,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-15 01:28:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:06,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,829 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:06,830 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1690820362, now seen corresponding path program 1 times [2019-10-15 01:28:06,830 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578319346] [2019-10-15 01:28:06,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:06,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578319346] [2019-10-15 01:28:06,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:06,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:06,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617053346] [2019-10-15 01:28:06,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:06,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:06,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:06,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:06,955 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-15 01:28:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,189 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-15 01:28:07,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:07,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,191 INFO L225 Difference]: With dead ends: 729 [2019-10-15 01:28:07,191 INFO L226 Difference]: Without dead ends: 375 [2019-10-15 01:28:07,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-15 01:28:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-15 01:28:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-15 01:28:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-15 01:28:07,211 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-15 01:28:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,212 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-15 01:28:07,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-15 01:28:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:28:07,214 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,214 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:07,214 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,215 INFO L82 PathProgramCache]: Analyzing trace with hash 478955993, now seen corresponding path program 1 times [2019-10-15 01:28:07,215 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856165132] [2019-10-15 01:28:07,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:28:07,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856165132] [2019-10-15 01:28:07,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:07,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391921349] [2019-10-15 01:28:07,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:07,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:07,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:07,277 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-15 01:28:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,458 INFO L93 Difference]: Finished difference Result 747 states and 1200 transitions. [2019-10-15 01:28:07,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:07,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-15 01:28:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,461 INFO L225 Difference]: With dead ends: 747 [2019-10-15 01:28:07,461 INFO L226 Difference]: Without dead ends: 393 [2019-10-15 01:28:07,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-15 01:28:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-10-15 01:28:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-15 01:28:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-15 01:28:07,479 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-15 01:28:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,479 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-15 01:28:07,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-15 01:28:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:28:07,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,481 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:07,482 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1822469329, now seen corresponding path program 1 times [2019-10-15 01:28:07,482 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234168498] [2019-10-15 01:28:07,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:28:07,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234168498] [2019-10-15 01:28:07,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:07,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433553749] [2019-10-15 01:28:07,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:07,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:07,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:07,553 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-15 01:28:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,772 INFO L93 Difference]: Finished difference Result 768 states and 1223 transitions. [2019-10-15 01:28:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:07,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-15 01:28:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,775 INFO L225 Difference]: With dead ends: 768 [2019-10-15 01:28:07,775 INFO L226 Difference]: Without dead ends: 393 [2019-10-15 01:28:07,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-15 01:28:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-10-15 01:28:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-15 01:28:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-15 01:28:07,796 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-15 01:28:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,797 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-15 01:28:07,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:07,797 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-15 01:28:07,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-15 01:28:07,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,799 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:07,799 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1681254182, now seen corresponding path program 1 times [2019-10-15 01:28:07,800 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996102697] [2019-10-15 01:28:07,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:28:07,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996102697] [2019-10-15 01:28:07,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:07,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083320835] [2019-10-15 01:28:07,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:07,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:07,863 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-15 01:28:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,921 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-15 01:28:07,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:07,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-15 01:28:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,926 INFO L225 Difference]: With dead ends: 763 [2019-10-15 01:28:07,926 INFO L226 Difference]: Without dead ends: 761 [2019-10-15 01:28:07,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-15 01:28:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-15 01:28:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-15 01:28:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-15 01:28:07,967 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-15 01:28:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,967 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-15 01:28:07,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-15 01:28:07,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:28:07,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,970 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:07,970 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash -837527912, now seen corresponding path program 1 times [2019-10-15 01:28:07,971 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556626890] [2019-10-15 01:28:07,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:28:08,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556626890] [2019-10-15 01:28:08,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:08,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617622793] [2019-10-15 01:28:08,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:08,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:08,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:08,017 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-10-15 01:28:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:08,088 INFO L93 Difference]: Finished difference Result 1877 states and 2969 transitions. [2019-10-15 01:28:08,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:08,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-15 01:28:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:08,094 INFO L225 Difference]: With dead ends: 1877 [2019-10-15 01:28:08,095 INFO L226 Difference]: Without dead ends: 1129 [2019-10-15 01:28:08,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-10-15 01:28:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2019-10-15 01:28:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-10-15 01:28:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1782 transitions. [2019-10-15 01:28:08,149 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1782 transitions. Word has length 127 [2019-10-15 01:28:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:08,149 INFO L462 AbstractCegarLoop]: Abstraction has 1129 states and 1782 transitions. [2019-10-15 01:28:08,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1782 transitions. [2019-10-15 01:28:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:28:08,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:08,153 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:08,153 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash 551766102, now seen corresponding path program 1 times [2019-10-15 01:28:08,154 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174499118] [2019-10-15 01:28:08,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-15 01:28:08,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174499118] [2019-10-15 01:28:08,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:08,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256543925] [2019-10-15 01:28:08,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:08,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:08,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:08,195 INFO L87 Difference]: Start difference. First operand 1129 states and 1782 transitions. Second operand 3 states. [2019-10-15 01:28:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:08,299 INFO L93 Difference]: Finished difference Result 2596 states and 4102 transitions. [2019-10-15 01:28:08,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:08,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-15 01:28:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:08,308 INFO L225 Difference]: With dead ends: 2596 [2019-10-15 01:28:08,309 INFO L226 Difference]: Without dead ends: 1480 [2019-10-15 01:28:08,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-10-15 01:28:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2019-10-15 01:28:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-10-15 01:28:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2333 transitions. [2019-10-15 01:28:08,380 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2333 transitions. Word has length 127 [2019-10-15 01:28:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:08,380 INFO L462 AbstractCegarLoop]: Abstraction has 1480 states and 2333 transitions. [2019-10-15 01:28:08,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2333 transitions. [2019-10-15 01:28:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:28:08,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:08,385 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:08,386 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,386 INFO L82 PathProgramCache]: Analyzing trace with hash -923211894, now seen corresponding path program 1 times [2019-10-15 01:28:08,386 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219533127] [2019-10-15 01:28:08,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-15 01:28:08,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219533127] [2019-10-15 01:28:08,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:08,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816493813] [2019-10-15 01:28:08,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:08,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:08,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:08,439 INFO L87 Difference]: Start difference. First operand 1480 states and 2333 transitions. Second operand 3 states. [2019-10-15 01:28:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:08,720 INFO L93 Difference]: Finished difference Result 2987 states and 4697 transitions. [2019-10-15 01:28:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:08,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-15 01:28:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:08,732 INFO L225 Difference]: With dead ends: 2987 [2019-10-15 01:28:08,732 INFO L226 Difference]: Without dead ends: 1520 [2019-10-15 01:28:08,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-10-15 01:28:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1480. [2019-10-15 01:28:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-10-15 01:28:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2189 transitions. [2019-10-15 01:28:08,833 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2189 transitions. Word has length 164 [2019-10-15 01:28:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:08,833 INFO L462 AbstractCegarLoop]: Abstraction has 1480 states and 2189 transitions. [2019-10-15 01:28:08,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2189 transitions. [2019-10-15 01:28:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:28:08,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:08,841 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:08,841 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,841 INFO L82 PathProgramCache]: Analyzing trace with hash -2015847096, now seen corresponding path program 1 times [2019-10-15 01:28:08,842 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24251319] [2019-10-15 01:28:08,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-15 01:28:08,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24251319] [2019-10-15 01:28:08,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:08,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213728096] [2019-10-15 01:28:08,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:08,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:08,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:08,921 INFO L87 Difference]: Start difference. First operand 1480 states and 2189 transitions. Second operand 3 states. [2019-10-15 01:28:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,294 INFO L93 Difference]: Finished difference Result 3143 states and 4661 transitions. [2019-10-15 01:28:09,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:09,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-15 01:28:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,305 INFO L225 Difference]: With dead ends: 3143 [2019-10-15 01:28:09,305 INFO L226 Difference]: Without dead ends: 1676 [2019-10-15 01:28:09,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-10-15 01:28:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1560. [2019-10-15 01:28:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-10-15 01:28:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2249 transitions. [2019-10-15 01:28:09,404 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2249 transitions. Word has length 164 [2019-10-15 01:28:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,405 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 2249 transitions. [2019-10-15 01:28:09,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2249 transitions. [2019-10-15 01:28:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-15 01:28:09,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,410 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:09,410 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,411 INFO L82 PathProgramCache]: Analyzing trace with hash 154922403, now seen corresponding path program 1 times [2019-10-15 01:28:09,411 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842607222] [2019-10-15 01:28:09,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-15 01:28:09,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842607222] [2019-10-15 01:28:09,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:09,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:09,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743144716] [2019-10-15 01:28:09,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:09,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:09,469 INFO L87 Difference]: Start difference. First operand 1560 states and 2249 transitions. Second operand 3 states. [2019-10-15 01:28:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,691 INFO L93 Difference]: Finished difference Result 3195 states and 4598 transitions. [2019-10-15 01:28:09,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:09,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-15 01:28:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,700 INFO L225 Difference]: With dead ends: 3195 [2019-10-15 01:28:09,701 INFO L226 Difference]: Without dead ends: 1648 [2019-10-15 01:28:09,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-10-15 01:28:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1566. [2019-10-15 01:28:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-10-15 01:28:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2196 transitions. [2019-10-15 01:28:09,780 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2196 transitions. Word has length 178 [2019-10-15 01:28:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,780 INFO L462 AbstractCegarLoop]: Abstraction has 1566 states and 2196 transitions. [2019-10-15 01:28:09,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2196 transitions. [2019-10-15 01:28:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-15 01:28:09,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,787 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:09,787 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1961792037, now seen corresponding path program 1 times [2019-10-15 01:28:09,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921042837] [2019-10-15 01:28:09,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-15 01:28:09,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921042837] [2019-10-15 01:28:09,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:09,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:09,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682647251] [2019-10-15 01:28:09,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:09,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:09,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:09,880 INFO L87 Difference]: Start difference. First operand 1566 states and 2196 transitions. Second operand 3 states. [2019-10-15 01:28:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,049 INFO L93 Difference]: Finished difference Result 3198 states and 4473 transitions. [2019-10-15 01:28:10,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:10,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-15 01:28:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,058 INFO L225 Difference]: With dead ends: 3198 [2019-10-15 01:28:10,058 INFO L226 Difference]: Without dead ends: 1651 [2019-10-15 01:28:10,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-10-15 01:28:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-10-15 01:28:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-10-15 01:28:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2280 transitions. [2019-10-15 01:28:10,136 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2280 transitions. Word has length 194 [2019-10-15 01:28:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,137 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 2280 transitions. [2019-10-15 01:28:10,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2280 transitions. [2019-10-15 01:28:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-15 01:28:10,142 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,142 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:10,143 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1023005408, now seen corresponding path program 1 times [2019-10-15 01:28:10,143 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165354131] [2019-10-15 01:28:10,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-15 01:28:10,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165354131] [2019-10-15 01:28:10,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:10,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145365540] [2019-10-15 01:28:10,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:10,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:10,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,222 INFO L87 Difference]: Start difference. First operand 1635 states and 2280 transitions. Second operand 3 states. [2019-10-15 01:28:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,489 INFO L93 Difference]: Finished difference Result 3403 states and 4750 transitions. [2019-10-15 01:28:10,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:10,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-10-15 01:28:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,503 INFO L225 Difference]: With dead ends: 3403 [2019-10-15 01:28:10,503 INFO L226 Difference]: Without dead ends: 1787 [2019-10-15 01:28:10,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-10-15 01:28:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1735. [2019-10-15 01:28:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-15 01:28:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2400 transitions. [2019-10-15 01:28:10,644 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2400 transitions. Word has length 215 [2019-10-15 01:28:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,645 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 2400 transitions. [2019-10-15 01:28:10,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2400 transitions. [2019-10-15 01:28:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-15 01:28:10,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,654 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:10,654 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1880660095, now seen corresponding path program 1 times [2019-10-15 01:28:10,655 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766256555] [2019-10-15 01:28:10,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-15 01:28:10,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766256555] [2019-10-15 01:28:10,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:10,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609248384] [2019-10-15 01:28:10,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:10,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:10,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,843 INFO L87 Difference]: Start difference. First operand 1735 states and 2400 transitions. Second operand 3 states. [2019-10-15 01:28:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,118 INFO L93 Difference]: Finished difference Result 3531 states and 4878 transitions. [2019-10-15 01:28:11,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:11,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-15 01:28:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,127 INFO L225 Difference]: With dead ends: 3531 [2019-10-15 01:28:11,127 INFO L226 Difference]: Without dead ends: 1815 [2019-10-15 01:28:11,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-10-15 01:28:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1735. [2019-10-15 01:28:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-15 01:28:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2392 transitions. [2019-10-15 01:28:11,205 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2392 transitions. Word has length 218 [2019-10-15 01:28:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,206 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 2392 transitions. [2019-10-15 01:28:11,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2392 transitions. [2019-10-15 01:28:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-15 01:28:11,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,212 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:11,212 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1809038977, now seen corresponding path program 1 times [2019-10-15 01:28:11,213 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575395029] [2019-10-15 01:28:11,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-15 01:28:11,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575395029] [2019-10-15 01:28:11,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:11,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8286927] [2019-10-15 01:28:11,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:11,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:11,312 INFO L87 Difference]: Start difference. First operand 1735 states and 2392 transitions. Second operand 3 states. [2019-10-15 01:28:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,554 INFO L93 Difference]: Finished difference Result 3647 states and 5050 transitions. [2019-10-15 01:28:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:11,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-15 01:28:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,565 INFO L225 Difference]: With dead ends: 3647 [2019-10-15 01:28:11,565 INFO L226 Difference]: Without dead ends: 1831 [2019-10-15 01:28:11,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-10-15 01:28:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1791. [2019-10-15 01:28:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-15 01:28:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2436 transitions. [2019-10-15 01:28:11,674 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2436 transitions. Word has length 239 [2019-10-15 01:28:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,674 INFO L462 AbstractCegarLoop]: Abstraction has 1791 states and 2436 transitions. [2019-10-15 01:28:11,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2436 transitions. [2019-10-15 01:28:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-15 01:28:11,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,681 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:11,681 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,683 INFO L82 PathProgramCache]: Analyzing trace with hash -940069451, now seen corresponding path program 1 times [2019-10-15 01:28:11,683 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661855207] [2019-10-15 01:28:11,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-10-15 01:28:11,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661855207] [2019-10-15 01:28:11,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:11,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003727789] [2019-10-15 01:28:11,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:11,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:11,815 INFO L87 Difference]: Start difference. First operand 1791 states and 2436 transitions. Second operand 3 states. [2019-10-15 01:28:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,031 INFO L93 Difference]: Finished difference Result 3595 states and 4898 transitions. [2019-10-15 01:28:12,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:12,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-10-15 01:28:12,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,040 INFO L225 Difference]: With dead ends: 3595 [2019-10-15 01:28:12,041 INFO L226 Difference]: Without dead ends: 1823 [2019-10-15 01:28:12,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:12,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-10-15 01:28:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1791. [2019-10-15 01:28:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-15 01:28:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2416 transitions. [2019-10-15 01:28:12,125 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2416 transitions. Word has length 241 [2019-10-15 01:28:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,126 INFO L462 AbstractCegarLoop]: Abstraction has 1791 states and 2416 transitions. [2019-10-15 01:28:12,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2416 transitions. [2019-10-15 01:28:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-15 01:28:12,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,132 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:12,133 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,133 INFO L82 PathProgramCache]: Analyzing trace with hash -275540929, now seen corresponding path program 1 times [2019-10-15 01:28:12,133 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984099986] [2019-10-15 01:28:12,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-15 01:28:12,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984099986] [2019-10-15 01:28:12,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254688765] [2019-10-15 01:28:12,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:12,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-15 01:28:12,554 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-15 01:28:12,636 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:12,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:12,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552590457] [2019-10-15 01:28:12,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:12,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:12,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:12,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,638 INFO L87 Difference]: Start difference. First operand 1791 states and 2416 transitions. Second operand 3 states. [2019-10-15 01:28:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,743 INFO L93 Difference]: Finished difference Result 3585 states and 4844 transitions. [2019-10-15 01:28:12,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:12,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-15 01:28:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,754 INFO L225 Difference]: With dead ends: 3585 [2019-10-15 01:28:12,755 INFO L226 Difference]: Without dead ends: 2246 [2019-10-15 01:28:12,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 501 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2019-10-15 01:28:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2019-10-15 01:28:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-10-15 01:28:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3031 transitions. [2019-10-15 01:28:12,859 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3031 transitions. Word has length 251 [2019-10-15 01:28:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,860 INFO L462 AbstractCegarLoop]: Abstraction has 2246 states and 3031 transitions. [2019-10-15 01:28:12,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3031 transitions. [2019-10-15 01:28:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-15 01:28:12,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,869 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:13,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:13,075 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1797967949, now seen corresponding path program 1 times [2019-10-15 01:28:13,075 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929902749] [2019-10-15 01:28:13,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-15 01:28:13,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929902749] [2019-10-15 01:28:13,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861980019] [2019-10-15 01:28:13,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:13,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-15 01:28:13,662 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-15 01:28:13,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1259604711] [2019-10-15 01:28:13,751 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 259 [2019-10-15 01:28:13,812 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:13,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:15,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:15,417 INFO L272 AbstractInterpreter]: Visited 77 different actions 1315 times. Merged at 66 different actions 1107 times. Widened at 11 different actions 101 times. Performed 3058 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3058 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 126 fixpoints after 17 different actions. Largest state had 94 variables. [2019-10-15 01:28:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,425 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:15,425 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:15,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:15,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585099749] [2019-10-15 01:28:15,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:15,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:15,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:15,428 INFO L87 Difference]: Start difference. First operand 2246 states and 3031 transitions. Second operand 6 states. [2019-10-15 01:28:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:16,724 INFO L93 Difference]: Finished difference Result 9951 states and 13516 transitions. [2019-10-15 01:28:16,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:28:16,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-10-15 01:28:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:16,792 INFO L225 Difference]: With dead ends: 9951 [2019-10-15 01:28:16,792 INFO L226 Difference]: Without dead ends: 7724 [2019-10-15 01:28:16,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2019-10-15 01:28:17,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 3116. [2019-10-15 01:28:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2019-10-15 01:28:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4131 transitions. [2019-10-15 01:28:17,061 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4131 transitions. Word has length 258 [2019-10-15 01:28:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,061 INFO L462 AbstractCegarLoop]: Abstraction has 3116 states and 4131 transitions. [2019-10-15 01:28:17,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4131 transitions. [2019-10-15 01:28:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-15 01:28:17,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,073 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:17,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:17,287 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1509148559, now seen corresponding path program 1 times [2019-10-15 01:28:17,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352603720] [2019-10-15 01:28:17,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-15 01:28:17,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352603720] [2019-10-15 01:28:17,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:17,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733339932] [2019-10-15 01:28:17,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:17,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:17,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:17,494 INFO L87 Difference]: Start difference. First operand 3116 states and 4131 transitions. Second operand 3 states. [2019-10-15 01:28:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,727 INFO L93 Difference]: Finished difference Result 8795 states and 11721 transitions. [2019-10-15 01:28:17,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:17,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-10-15 01:28:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,740 INFO L225 Difference]: With dead ends: 8795 [2019-10-15 01:28:17,740 INFO L226 Difference]: Without dead ends: 5698 [2019-10-15 01:28:17,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2019-10-15 01:28:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5696. [2019-10-15 01:28:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5696 states. [2019-10-15 01:28:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5696 states to 5696 states and 7601 transitions. [2019-10-15 01:28:18,001 INFO L78 Accepts]: Start accepts. Automaton has 5696 states and 7601 transitions. Word has length 258 [2019-10-15 01:28:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,002 INFO L462 AbstractCegarLoop]: Abstraction has 5696 states and 7601 transitions. [2019-10-15 01:28:18,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5696 states and 7601 transitions. [2019-10-15 01:28:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-15 01:28:18,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,015 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:18,015 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,016 INFO L82 PathProgramCache]: Analyzing trace with hash -718445864, now seen corresponding path program 1 times [2019-10-15 01:28:18,016 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337680242] [2019-10-15 01:28:18,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-15 01:28:18,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337680242] [2019-10-15 01:28:18,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:18,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:18,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283136547] [2019-10-15 01:28:18,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:18,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:18,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:18,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,115 INFO L87 Difference]: Start difference. First operand 5696 states and 7601 transitions. Second operand 3 states. [2019-10-15 01:28:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,560 INFO L93 Difference]: Finished difference Result 11499 states and 15338 transitions. [2019-10-15 01:28:18,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:18,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-15 01:28:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,573 INFO L225 Difference]: With dead ends: 11499 [2019-10-15 01:28:18,573 INFO L226 Difference]: Without dead ends: 5822 [2019-10-15 01:28:18,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5822 states. [2019-10-15 01:28:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5822 to 5697. [2019-10-15 01:28:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-10-15 01:28:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7497 transitions. [2019-10-15 01:28:18,825 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7497 transitions. Word has length 261 [2019-10-15 01:28:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,826 INFO L462 AbstractCegarLoop]: Abstraction has 5697 states and 7497 transitions. [2019-10-15 01:28:18,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7497 transitions. [2019-10-15 01:28:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-15 01:28:18,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,843 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:18,844 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash -571590843, now seen corresponding path program 1 times [2019-10-15 01:28:18,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662109105] [2019-10-15 01:28:18,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-15 01:28:18,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662109105] [2019-10-15 01:28:18,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365361168] [2019-10-15 01:28:18,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:19,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-10-15 01:28:19,152 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-10-15 01:28:19,207 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:19,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:19,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870475584] [2019-10-15 01:28:19,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:19,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:19,211 INFO L87 Difference]: Start difference. First operand 5697 states and 7497 transitions. Second operand 3 states. [2019-10-15 01:28:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,531 INFO L93 Difference]: Finished difference Result 11394 states and 14986 transitions. [2019-10-15 01:28:19,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:19,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-10-15 01:28:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,544 INFO L225 Difference]: With dead ends: 11394 [2019-10-15 01:28:19,544 INFO L226 Difference]: Without dead ends: 5717 [2019-10-15 01:28:19,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5717 states. [2019-10-15 01:28:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5717 to 5697. [2019-10-15 01:28:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-10-15 01:28:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7487 transitions. [2019-10-15 01:28:19,771 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7487 transitions. Word has length 287 [2019-10-15 01:28:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:19,772 INFO L462 AbstractCegarLoop]: Abstraction has 5697 states and 7487 transitions. [2019-10-15 01:28:19,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7487 transitions. [2019-10-15 01:28:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-15 01:28:19,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:19,787 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:28:19,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:19,992 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:19,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,993 INFO L82 PathProgramCache]: Analyzing trace with hash 232140181, now seen corresponding path program 1 times [2019-10-15 01:28:19,993 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:19,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095252785] [2019-10-15 01:28:19,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-15 01:28:20,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095252785] [2019-10-15 01:28:20,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886384135] [2019-10-15 01:28:20,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:20,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-10-15 01:28:20,343 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-10-15 01:28:20,422 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:20,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:20,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030048137] [2019-10-15 01:28:20,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:20,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:20,425 INFO L87 Difference]: Start difference. First operand 5697 states and 7487 transitions. Second operand 3 states. [2019-10-15 01:28:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,950 INFO L93 Difference]: Finished difference Result 11374 states and 14946 transitions. [2019-10-15 01:28:20,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:20,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-10-15 01:28:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,970 INFO L225 Difference]: With dead ends: 11374 [2019-10-15 01:28:20,970 INFO L226 Difference]: Without dead ends: 5697 [2019-10-15 01:28:20,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 576 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2019-10-15 01:28:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 5697. [2019-10-15 01:28:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-10-15 01:28:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7477 transitions. [2019-10-15 01:28:21,259 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7477 transitions. Word has length 288 [2019-10-15 01:28:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,259 INFO L462 AbstractCegarLoop]: Abstraction has 5697 states and 7477 transitions. [2019-10-15 01:28:21,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7477 transitions. [2019-10-15 01:28:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-15 01:28:21,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,273 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:21,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:21,479 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2074361303, now seen corresponding path program 1 times [2019-10-15 01:28:21,480 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091654540] [2019-10-15 01:28:21,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-15 01:28:21,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091654540] [2019-10-15 01:28:21,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451553945] [2019-10-15 01:28:21,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:21,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-15 01:28:21,814 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-15 01:28:21,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [579961246] [2019-10-15 01:28:21,919 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 289 [2019-10-15 01:28:21,935 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:21,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:23,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:23,057 INFO L272 AbstractInterpreter]: Visited 87 different actions 1505 times. Merged at 76 different actions 1242 times. Widened at 12 different actions 116 times. Performed 3720 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3720 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 160 fixpoints after 16 different actions. Largest state had 95 variables. [2019-10-15 01:28:23,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:23,057 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:23,058 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:23,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:23,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208764602] [2019-10-15 01:28:23,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:23,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:23,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:23,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:23,060 INFO L87 Difference]: Start difference. First operand 5697 states and 7477 transitions. Second operand 6 states. [2019-10-15 01:28:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:23,767 INFO L93 Difference]: Finished difference Result 12821 states and 16698 transitions. [2019-10-15 01:28:23,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:23,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 288 [2019-10-15 01:28:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:23,783 INFO L225 Difference]: With dead ends: 12821 [2019-10-15 01:28:23,783 INFO L226 Difference]: Without dead ends: 7078 [2019-10-15 01:28:23,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7078 states. [2019-10-15 01:28:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7078 to 4761. [2019-10-15 01:28:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4761 states. [2019-10-15 01:28:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6111 transitions. [2019-10-15 01:28:23,978 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6111 transitions. Word has length 288 [2019-10-15 01:28:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:23,978 INFO L462 AbstractCegarLoop]: Abstraction has 4761 states and 6111 transitions. [2019-10-15 01:28:23,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:23,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6111 transitions. [2019-10-15 01:28:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-15 01:28:23,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:23,991 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:24,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:24,198 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:24,199 INFO L82 PathProgramCache]: Analyzing trace with hash 924837848, now seen corresponding path program 1 times [2019-10-15 01:28:24,199 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:24,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646750256] [2019-10-15 01:28:24,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-10-15 01:28:24,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646750256] [2019-10-15 01:28:24,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:24,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:24,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135077575] [2019-10-15 01:28:24,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:24,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:24,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:24,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:24,376 INFO L87 Difference]: Start difference. First operand 4761 states and 6111 transitions. Second operand 3 states. [2019-10-15 01:28:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,684 INFO L93 Difference]: Finished difference Result 8117 states and 10341 transitions. [2019-10-15 01:28:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:24,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-15 01:28:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,692 INFO L225 Difference]: With dead ends: 8117 [2019-10-15 01:28:24,692 INFO L226 Difference]: Without dead ends: 2593 [2019-10-15 01:28:24,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-10-15 01:28:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2593. [2019-10-15 01:28:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-10-15 01:28:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3313 transitions. [2019-10-15 01:28:24,798 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3313 transitions. Word has length 326 [2019-10-15 01:28:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,798 INFO L462 AbstractCegarLoop]: Abstraction has 2593 states and 3313 transitions. [2019-10-15 01:28:24,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3313 transitions. [2019-10-15 01:28:24,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-15 01:28:24,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:24,804 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:24,805 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:24,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:24,805 INFO L82 PathProgramCache]: Analyzing trace with hash 4925057, now seen corresponding path program 1 times [2019-10-15 01:28:24,805 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:24,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965866309] [2019-10-15 01:28:24,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-15 01:28:24,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965866309] [2019-10-15 01:28:24,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:24,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:24,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456468640] [2019-10-15 01:28:24,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:24,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:24,948 INFO L87 Difference]: Start difference. First operand 2593 states and 3313 transitions. Second operand 3 states. [2019-10-15 01:28:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:25,129 INFO L93 Difference]: Finished difference Result 5151 states and 6569 transitions. [2019-10-15 01:28:25,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:25,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-15 01:28:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:25,134 INFO L225 Difference]: With dead ends: 5151 [2019-10-15 01:28:25,134 INFO L226 Difference]: Without dead ends: 2603 [2019-10-15 01:28:25,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-10-15 01:28:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2593. [2019-10-15 01:28:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-10-15 01:28:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3288 transitions. [2019-10-15 01:28:25,225 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3288 transitions. Word has length 365 [2019-10-15 01:28:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:25,226 INFO L462 AbstractCegarLoop]: Abstraction has 2593 states and 3288 transitions. [2019-10-15 01:28:25,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3288 transitions. [2019-10-15 01:28:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-15 01:28:25,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:25,233 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:25,234 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:25,234 INFO L82 PathProgramCache]: Analyzing trace with hash 85240782, now seen corresponding path program 1 times [2019-10-15 01:28:25,234 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:25,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886888388] [2019-10-15 01:28:25,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-15 01:28:25,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886888388] [2019-10-15 01:28:25,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119698583] [2019-10-15 01:28:25,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:25,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-15 01:28:25,665 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-15 01:28:25,780 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:25,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:25,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630655489] [2019-10-15 01:28:25,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:25,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:25,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:25,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:25,782 INFO L87 Difference]: Start difference. First operand 2593 states and 3288 transitions. Second operand 3 states. [2019-10-15 01:28:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:25,877 INFO L93 Difference]: Finished difference Result 3196 states and 4057 transitions. [2019-10-15 01:28:25,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:25,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-10-15 01:28:25,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:25,884 INFO L225 Difference]: With dead ends: 3196 [2019-10-15 01:28:25,885 INFO L226 Difference]: Without dead ends: 3104 [2019-10-15 01:28:25,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2019-10-15 01:28:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 2503. [2019-10-15 01:28:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2503 states. [2019-10-15 01:28:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 3187 transitions. [2019-10-15 01:28:26,001 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 3187 transitions. Word has length 398 [2019-10-15 01:28:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:26,002 INFO L462 AbstractCegarLoop]: Abstraction has 2503 states and 3187 transitions. [2019-10-15 01:28:26,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 3187 transitions. [2019-10-15 01:28:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-10-15 01:28:26,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:26,011 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:28:26,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:26,217 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:26,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1661102763, now seen corresponding path program 1 times [2019-10-15 01:28:26,218 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:26,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755190587] [2019-10-15 01:28:26,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:26,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:26,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-10-15 01:28:26,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755190587] [2019-10-15 01:28:26,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487439793] [2019-10-15 01:28:26,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:26,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:26,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-10-15 01:28:26,736 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-10-15 01:28:26,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1863440701] [2019-10-15 01:28:26,889 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 539 [2019-10-15 01:28:26,892 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:26,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:26,991 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:28,262 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:28,262 INFO L272 AbstractInterpreter]: Visited 100 different actions 2117 times. Merged at 86 different actions 1752 times. Widened at 18 different actions 251 times. Performed 4900 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4900 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 232 fixpoints after 27 different actions. Largest state had 97 variables. [2019-10-15 01:28:28,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:28,263 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:28,263 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:28,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:28,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803965540] [2019-10-15 01:28:28,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:28,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:28,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:28,265 INFO L87 Difference]: Start difference. First operand 2503 states and 3187 transitions. Second operand 6 states. [2019-10-15 01:28:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:28,736 INFO L93 Difference]: Finished difference Result 5916 states and 7522 transitions. [2019-10-15 01:28:28,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:28:28,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 538 [2019-10-15 01:28:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:28,744 INFO L225 Difference]: With dead ends: 5916 [2019-10-15 01:28:28,744 INFO L226 Difference]: Without dead ends: 3409 [2019-10-15 01:28:28,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1077 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2019-10-15 01:28:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 2563. [2019-10-15 01:28:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2019-10-15 01:28:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3262 transitions. [2019-10-15 01:28:28,850 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3262 transitions. Word has length 538 [2019-10-15 01:28:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:28,850 INFO L462 AbstractCegarLoop]: Abstraction has 2563 states and 3262 transitions. [2019-10-15 01:28:28,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3262 transitions. [2019-10-15 01:28:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-10-15 01:28:28,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:28,859 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:28:29,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:29,073 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:29,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:29,073 INFO L82 PathProgramCache]: Analyzing trace with hash -19692895, now seen corresponding path program 1 times [2019-10-15 01:28:29,074 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:29,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284252087] [2019-10-15 01:28:29,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:29,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:29,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 2404 proven. 0 refuted. 0 times theorem prover too weak. 2567 trivial. 0 not checked. [2019-10-15 01:28:29,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284252087] [2019-10-15 01:28:29,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:29,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:29,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049925424] [2019-10-15 01:28:29,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:29,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:29,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:29,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:29,628 INFO L87 Difference]: Start difference. First operand 2563 states and 3262 transitions. Second operand 3 states. [2019-10-15 01:28:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:29,856 INFO L93 Difference]: Finished difference Result 5261 states and 6697 transitions. [2019-10-15 01:28:29,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:29,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 666 [2019-10-15 01:28:29,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:29,865 INFO L225 Difference]: With dead ends: 5261 [2019-10-15 01:28:29,866 INFO L226 Difference]: Without dead ends: 2743 [2019-10-15 01:28:29,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2019-10-15 01:28:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2733. [2019-10-15 01:28:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2733 states. [2019-10-15 01:28:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 3457 transitions. [2019-10-15 01:28:29,963 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 3457 transitions. Word has length 666 [2019-10-15 01:28:29,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:29,964 INFO L462 AbstractCegarLoop]: Abstraction has 2733 states and 3457 transitions. [2019-10-15 01:28:29,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 3457 transitions. [2019-10-15 01:28:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2019-10-15 01:28:29,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:29,973 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:28:29,973 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:29,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1078284281, now seen corresponding path program 1 times [2019-10-15 01:28:29,974 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:29,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162069968] [2019-10-15 01:28:29,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:29,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:29,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat