/usr/bin/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_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:14:03,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:14:03,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:14:03,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:14:03,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:14:03,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:14:03,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:14:03,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:14:03,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:14:03,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:14:03,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:14:03,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:14:03,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:14:03,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:14:03,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:14:03,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:14:03,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:14:03,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:14:03,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:14:04,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:14:04,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:14:04,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:14:04,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:14:04,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:14:04,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:14:04,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:14:04,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:14:04,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:14:04,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:14:04,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:14:04,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:14:04,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:14:04,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:14:04,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:14:04,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:14:04,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:14:04,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:14:04,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:14:04,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:14:04,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:14:04,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:14:04,031 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-11-07 01:14:04,067 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:14:04,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:14:04,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:14:04,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:14:04,074 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:14:04,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:14:04,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:14:04,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:14:04,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:14:04,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:14:04,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:14:04,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:14:04,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:14:04,076 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:14:04,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:14:04,076 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:14:04,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:14:04,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:14:04,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:14:04,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:14:04,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:14:04,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:14:04,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:14:04,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:14:04,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:14:04,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:14:04,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:14:04,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:14:04,078 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-11-07 01:14:04,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:14:04,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:14:04,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:14:04,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:14:04,546 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:14:04,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-11-07 01:14:04,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b31d0d9/f2b30ad9da464e93bf92f388cf5c5aaa/FLAG331a0c4d3 [2019-11-07 01:14:05,172 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:14:05,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-11-07 01:14:05,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b31d0d9/f2b30ad9da464e93bf92f388cf5c5aaa/FLAG331a0c4d3 [2019-11-07 01:14:05,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b31d0d9/f2b30ad9da464e93bf92f388cf5c5aaa [2019-11-07 01:14:05,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:14:05,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:14:05,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:14:05,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:14:05,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:14:05,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:14:05" (1/1) ... [2019-11-07 01:14:05,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158aa3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:05, skipping insertion in model container [2019-11-07 01:14:05,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:14:05" (1/1) ... [2019-11-07 01:14:05,493 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:14:05,559 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:14:05,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:14:05,937 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:14:06,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:14:06,149 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:14:06,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06 WrapperNode [2019-11-07 01:14:06,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:14:06,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:14:06,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:14:06,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:14:06,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:14:06,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:14:06,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:14:06,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:14:06,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (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-11-07 01:14:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:14:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:14:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-11-07 01:14:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:14:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:14:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:14:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:14:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 01:14:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 01:14:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-11-07 01:14:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:14:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:14:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:14:06,536 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 01:14:07,072 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-07 01:14:07,072 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-07 01:14:07,075 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:14:07,076 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:14:07,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:14:07 BoogieIcfgContainer [2019-11-07 01:14:07,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:14:07,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:14:07,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:14:07,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:14:07,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:14:05" (1/3) ... [2019-11-07 01:14:07,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acd64ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:14:07, skipping insertion in model container [2019-11-07 01:14:07,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (2/3) ... [2019-11-07 01:14:07,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acd64ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:14:07, skipping insertion in model container [2019-11-07 01:14:07,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:14:07" (3/3) ... [2019-11-07 01:14:07,087 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-11-07 01:14:07,098 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:14:07,107 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:14:07,120 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:14:07,150 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:14:07,150 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:14:07,151 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:14:07,151 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:14:07,151 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:14:07,151 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:14:07,151 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:14:07,152 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:14:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-11-07 01:14:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 01:14:07,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:07,188 INFO L410 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] [2019-11-07 01:14:07,189 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1198514108, now seen corresponding path program 1 times [2019-11-07 01:14:07,206 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:07,206 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880422005] [2019-11-07 01:14:07,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:07,506 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880422005] [2019-11-07 01:14:07,507 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:07,508 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:07,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704122603] [2019-11-07 01:14:07,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:07,516 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:07,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:07,535 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-11-07 01:14:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:08,017 INFO L93 Difference]: Finished difference Result 338 states and 575 transitions. [2019-11-07 01:14:08,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:08,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-07 01:14:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:08,034 INFO L225 Difference]: With dead ends: 338 [2019-11-07 01:14:08,034 INFO L226 Difference]: Without dead ends: 176 [2019-11-07 01:14:08,039 INFO L630 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-11-07 01:14:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-07 01:14:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2019-11-07 01:14:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-07 01:14:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2019-11-07 01:14:08,104 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 38 [2019-11-07 01:14:08,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:08,106 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2019-11-07 01:14:08,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2019-11-07 01:14:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 01:14:08,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:08,110 INFO L410 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] [2019-11-07 01:14:08,110 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:08,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:08,111 INFO L82 PathProgramCache]: Analyzing trace with hash -733377836, now seen corresponding path program 1 times [2019-11-07 01:14:08,111 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:08,112 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361156028] [2019-11-07 01:14:08,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:08,301 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361156028] [2019-11-07 01:14:08,302 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:08,303 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:08,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590126927] [2019-11-07 01:14:08,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:08,306 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:08,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:08,308 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand 5 states. [2019-11-07 01:14:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:08,629 INFO L93 Difference]: Finished difference Result 356 states and 571 transitions. [2019-11-07 01:14:08,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:08,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-07 01:14:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:08,634 INFO L225 Difference]: With dead ends: 356 [2019-11-07 01:14:08,634 INFO L226 Difference]: Without dead ends: 204 [2019-11-07 01:14:08,636 INFO L630 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-11-07 01:14:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-07 01:14:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-11-07 01:14:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-07 01:14:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 311 transitions. [2019-11-07 01:14:08,668 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 311 transitions. Word has length 39 [2019-11-07 01:14:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:08,669 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 311 transitions. [2019-11-07 01:14:08,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 311 transitions. [2019-11-07 01:14:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 01:14:08,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:08,673 INFO L410 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] [2019-11-07 01:14:08,673 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:08,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2008699792, now seen corresponding path program 1 times [2019-11-07 01:14:08,674 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:08,674 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462423218] [2019-11-07 01:14:08,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:08,810 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462423218] [2019-11-07 01:14:08,811 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:08,811 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:08,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945372988] [2019-11-07 01:14:08,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:08,812 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:08,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:08,813 INFO L87 Difference]: Start difference. First operand 193 states and 311 transitions. Second operand 5 states. [2019-11-07 01:14:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:09,116 INFO L93 Difference]: Finished difference Result 417 states and 682 transitions. [2019-11-07 01:14:09,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:09,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-07 01:14:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:09,123 INFO L225 Difference]: With dead ends: 417 [2019-11-07 01:14:09,123 INFO L226 Difference]: Without dead ends: 237 [2019-11-07 01:14:09,128 INFO L630 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-11-07 01:14:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-07 01:14:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-11-07 01:14:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-07 01:14:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 380 transitions. [2019-11-07 01:14:09,153 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 380 transitions. Word has length 45 [2019-11-07 01:14:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:09,153 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 380 transitions. [2019-11-07 01:14:09,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 380 transitions. [2019-11-07 01:14:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 01:14:09,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:09,156 INFO L410 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] [2019-11-07 01:14:09,156 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:09,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2133173875, now seen corresponding path program 1 times [2019-11-07 01:14:09,157 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:09,157 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911571268] [2019-11-07 01:14:09,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:09,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911571268] [2019-11-07 01:14:09,257 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:09,257 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:09,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788045215] [2019-11-07 01:14:09,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:09,258 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:09,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:09,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:09,259 INFO L87 Difference]: Start difference. First operand 231 states and 380 transitions. Second operand 5 states. [2019-11-07 01:14:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:09,525 INFO L93 Difference]: Finished difference Result 466 states and 772 transitions. [2019-11-07 01:14:09,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:09,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-07 01:14:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:09,529 INFO L225 Difference]: With dead ends: 466 [2019-11-07 01:14:09,529 INFO L226 Difference]: Without dead ends: 248 [2019-11-07 01:14:09,531 INFO L630 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-11-07 01:14:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-07 01:14:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2019-11-07 01:14:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-07 01:14:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 401 transitions. [2019-11-07 01:14:09,547 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 401 transitions. Word has length 46 [2019-11-07 01:14:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:09,548 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 401 transitions. [2019-11-07 01:14:09,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 401 transitions. [2019-11-07 01:14:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-07 01:14:09,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:09,551 INFO L410 BasicCegarLoop]: trace histogram [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-11-07 01:14:09,551 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:09,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:09,552 INFO L82 PathProgramCache]: Analyzing trace with hash 648824040, now seen corresponding path program 1 times [2019-11-07 01:14:09,552 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:09,552 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336445880] [2019-11-07 01:14:09,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:09,643 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336445880] [2019-11-07 01:14:09,644 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:09,644 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:09,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628515348] [2019-11-07 01:14:09,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:09,645 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:09,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:09,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:09,646 INFO L87 Difference]: Start difference. First operand 242 states and 401 transitions. Second operand 5 states. [2019-11-07 01:14:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:09,857 INFO L93 Difference]: Finished difference Result 510 states and 854 transitions. [2019-11-07 01:14:09,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:09,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-07 01:14:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:09,862 INFO L225 Difference]: With dead ends: 510 [2019-11-07 01:14:09,863 INFO L226 Difference]: Without dead ends: 281 [2019-11-07 01:14:09,864 INFO L630 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-11-07 01:14:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-07 01:14:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-11-07 01:14:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-07 01:14:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 444 transitions. [2019-11-07 01:14:09,879 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 444 transitions. Word has length 64 [2019-11-07 01:14:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:09,879 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 444 transitions. [2019-11-07 01:14:09,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2019-11-07 01:14:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 01:14:09,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:09,882 INFO L410 BasicCegarLoop]: trace histogram [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-11-07 01:14:09,883 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:09,883 INFO L82 PathProgramCache]: Analyzing trace with hash 943009440, now seen corresponding path program 1 times [2019-11-07 01:14:09,883 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:09,883 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860362203] [2019-11-07 01:14:09,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:09,962 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860362203] [2019-11-07 01:14:09,962 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:09,962 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:09,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398581703] [2019-11-07 01:14:09,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:09,965 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:09,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:09,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:09,966 INFO L87 Difference]: Start difference. First operand 267 states and 444 transitions. Second operand 5 states. [2019-11-07 01:14:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:10,171 INFO L93 Difference]: Finished difference Result 535 states and 894 transitions. [2019-11-07 01:14:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:10,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-07 01:14:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:10,174 INFO L225 Difference]: With dead ends: 535 [2019-11-07 01:14:10,174 INFO L226 Difference]: Without dead ends: 281 [2019-11-07 01:14:10,175 INFO L630 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-11-07 01:14:10,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-07 01:14:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-11-07 01:14:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-07 01:14:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2019-11-07 01:14:10,187 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 65 [2019-11-07 01:14:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:10,188 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2019-11-07 01:14:10,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:10,188 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2019-11-07 01:14:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-07 01:14:10,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:10,189 INFO L410 BasicCegarLoop]: trace histogram [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-11-07 01:14:10,190 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1195194559, now seen corresponding path program 1 times [2019-11-07 01:14:10,190 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:10,191 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941952551] [2019-11-07 01:14:10,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:10,242 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941952551] [2019-11-07 01:14:10,242 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:10,242 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:10,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698507341] [2019-11-07 01:14:10,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:10,243 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:10,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:10,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:10,244 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand 5 states. [2019-11-07 01:14:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:10,466 INFO L93 Difference]: Finished difference Result 552 states and 919 transitions. [2019-11-07 01:14:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:10,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-07 01:14:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:10,469 INFO L225 Difference]: With dead ends: 552 [2019-11-07 01:14:10,469 INFO L226 Difference]: Without dead ends: 298 [2019-11-07 01:14:10,470 INFO L630 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-11-07 01:14:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-07 01:14:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-11-07 01:14:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-07 01:14:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 493 transitions. [2019-11-07 01:14:10,484 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 493 transitions. Word has length 66 [2019-11-07 01:14:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:10,484 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 493 transitions. [2019-11-07 01:14:10,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 493 transitions. [2019-11-07 01:14:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-07 01:14:10,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:10,486 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-11-07 01:14:10,487 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:10,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:10,487 INFO L82 PathProgramCache]: Analyzing trace with hash -379332949, now seen corresponding path program 1 times [2019-11-07 01:14:10,487 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:10,487 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938148480] [2019-11-07 01:14:10,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 01:14:10,541 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938148480] [2019-11-07 01:14:10,541 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:10,541 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:10,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118728365] [2019-11-07 01:14:10,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:10,542 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:10,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:10,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:10,543 INFO L87 Difference]: Start difference. First operand 298 states and 493 transitions. Second operand 5 states. [2019-11-07 01:14:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:10,754 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-11-07 01:14:10,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:10,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-11-07 01:14:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:10,758 INFO L225 Difference]: With dead ends: 600 [2019-11-07 01:14:10,758 INFO L226 Difference]: Without dead ends: 315 [2019-11-07 01:14:10,759 INFO L630 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-11-07 01:14:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-07 01:14:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2019-11-07 01:14:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-07 01:14:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 514 transitions. [2019-11-07 01:14:10,775 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 514 transitions. Word has length 78 [2019-11-07 01:14:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:10,775 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 514 transitions. [2019-11-07 01:14:10,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 514 transitions. [2019-11-07 01:14:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-07 01:14:10,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:10,777 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:10,777 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:10,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:10,778 INFO L82 PathProgramCache]: Analyzing trace with hash 314969472, now seen corresponding path program 1 times [2019-11-07 01:14:10,778 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:10,778 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527631318] [2019-11-07 01:14:10,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:10,833 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527631318] [2019-11-07 01:14:10,833 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:10,834 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:10,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113749936] [2019-11-07 01:14:10,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:10,835 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:10,835 INFO L87 Difference]: Start difference. First operand 313 states and 514 transitions. Second operand 5 states. [2019-11-07 01:14:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:11,077 INFO L93 Difference]: Finished difference Result 651 states and 1075 transitions. [2019-11-07 01:14:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:11,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-11-07 01:14:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:11,080 INFO L225 Difference]: With dead ends: 651 [2019-11-07 01:14:11,080 INFO L226 Difference]: Without dead ends: 351 [2019-11-07 01:14:11,082 INFO L630 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-11-07 01:14:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-07 01:14:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-11-07 01:14:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-07 01:14:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 574 transitions. [2019-11-07 01:14:11,107 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 574 transitions. Word has length 78 [2019-11-07 01:14:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:11,108 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 574 transitions. [2019-11-07 01:14:11,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 574 transitions. [2019-11-07 01:14:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-07 01:14:11,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:11,111 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-07 01:14:11,111 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:11,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash 496741763, now seen corresponding path program 1 times [2019-11-07 01:14:11,112 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:11,112 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385153471] [2019-11-07 01:14:11,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 01:14:11,178 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385153471] [2019-11-07 01:14:11,178 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:11,178 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:11,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719856634] [2019-11-07 01:14:11,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:11,180 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:11,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:11,181 INFO L87 Difference]: Start difference. First operand 349 states and 574 transitions. Second operand 5 states. [2019-11-07 01:14:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:11,427 INFO L93 Difference]: Finished difference Result 687 states and 1133 transitions. [2019-11-07 01:14:11,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:11,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-07 01:14:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:11,430 INFO L225 Difference]: With dead ends: 687 [2019-11-07 01:14:11,430 INFO L226 Difference]: Without dead ends: 351 [2019-11-07 01:14:11,431 INFO L630 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-11-07 01:14:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-07 01:14:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-11-07 01:14:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-07 01:14:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 568 transitions. [2019-11-07 01:14:11,453 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 568 transitions. Word has length 79 [2019-11-07 01:14:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:11,453 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 568 transitions. [2019-11-07 01:14:11,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 568 transitions. [2019-11-07 01:14:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-07 01:14:11,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:11,455 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:11,456 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:11,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash -70012323, now seen corresponding path program 1 times [2019-11-07 01:14:11,457 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:11,457 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446667262] [2019-11-07 01:14:11,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:11,561 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446667262] [2019-11-07 01:14:11,561 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:11,562 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:11,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817437203] [2019-11-07 01:14:11,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:11,563 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:11,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:11,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:11,563 INFO L87 Difference]: Start difference. First operand 349 states and 568 transitions. Second operand 5 states. [2019-11-07 01:14:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:11,802 INFO L93 Difference]: Finished difference Result 687 states and 1121 transitions. [2019-11-07 01:14:11,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:11,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-07 01:14:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:11,805 INFO L225 Difference]: With dead ends: 687 [2019-11-07 01:14:11,805 INFO L226 Difference]: Without dead ends: 351 [2019-11-07 01:14:11,806 INFO L630 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-11-07 01:14:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-07 01:14:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-11-07 01:14:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-07 01:14:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 566 transitions. [2019-11-07 01:14:11,823 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 566 transitions. Word has length 79 [2019-11-07 01:14:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:11,823 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 566 transitions. [2019-11-07 01:14:11,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 566 transitions. [2019-11-07 01:14:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-07 01:14:11,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:11,825 INFO L410 BasicCegarLoop]: trace histogram [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-11-07 01:14:11,825 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:11,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2051852968, now seen corresponding path program 1 times [2019-11-07 01:14:11,826 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:11,826 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942124231] [2019-11-07 01:14:11,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 01:14:11,894 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942124231] [2019-11-07 01:14:11,894 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:11,894 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:11,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462838722] [2019-11-07 01:14:11,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:11,895 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:11,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:11,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:11,896 INFO L87 Difference]: Start difference. First operand 349 states and 566 transitions. Second operand 5 states. [2019-11-07 01:14:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:12,098 INFO L93 Difference]: Finished difference Result 714 states and 1163 transitions. [2019-11-07 01:14:12,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:12,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-07 01:14:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:12,102 INFO L225 Difference]: With dead ends: 714 [2019-11-07 01:14:12,102 INFO L226 Difference]: Without dead ends: 378 [2019-11-07 01:14:12,103 INFO L630 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-11-07 01:14:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-07 01:14:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-11-07 01:14:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-07 01:14:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 601 transitions. [2019-11-07 01:14:12,121 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 601 transitions. Word has length 85 [2019-11-07 01:14:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:12,122 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 601 transitions. [2019-11-07 01:14:12,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 601 transitions. [2019-11-07 01:14:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-07 01:14:12,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:12,124 INFO L410 BasicCegarLoop]: trace histogram [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-11-07 01:14:12,124 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:12,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash 406324048, now seen corresponding path program 1 times [2019-11-07 01:14:12,125 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:12,125 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327278487] [2019-11-07 01:14:12,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 01:14:12,184 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327278487] [2019-11-07 01:14:12,185 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:12,185 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:12,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511421307] [2019-11-07 01:14:12,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:12,186 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:12,187 INFO L87 Difference]: Start difference. First operand 373 states and 601 transitions. Second operand 5 states. [2019-11-07 01:14:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:12,404 INFO L93 Difference]: Finished difference Result 738 states and 1192 transitions. [2019-11-07 01:14:12,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:12,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-07 01:14:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:12,407 INFO L225 Difference]: With dead ends: 738 [2019-11-07 01:14:12,407 INFO L226 Difference]: Without dead ends: 378 [2019-11-07 01:14:12,409 INFO L630 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-11-07 01:14:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-07 01:14:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-11-07 01:14:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-07 01:14:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 595 transitions. [2019-11-07 01:14:12,426 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 595 transitions. Word has length 86 [2019-11-07 01:14:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:12,426 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 595 transitions. [2019-11-07 01:14:12,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 595 transitions. [2019-11-07 01:14:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-07 01:14:12,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:12,428 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:12,429 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:12,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2087471906, now seen corresponding path program 1 times [2019-11-07 01:14:12,432 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:12,432 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446282217] [2019-11-07 01:14:12,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-07 01:14:12,476 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446282217] [2019-11-07 01:14:12,476 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:12,476 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:12,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8881385] [2019-11-07 01:14:12,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:12,477 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:12,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:12,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:12,478 INFO L87 Difference]: Start difference. First operand 373 states and 595 transitions. Second operand 5 states. [2019-11-07 01:14:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:12,662 INFO L93 Difference]: Finished difference Result 742 states and 1185 transitions. [2019-11-07 01:14:12,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:12,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-11-07 01:14:12,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:12,665 INFO L225 Difference]: With dead ends: 742 [2019-11-07 01:14:12,665 INFO L226 Difference]: Without dead ends: 382 [2019-11-07 01:14:12,667 INFO L630 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-11-07 01:14:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-07 01:14:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-11-07 01:14:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-07 01:14:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 598 transitions. [2019-11-07 01:14:12,687 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 598 transitions. Word has length 91 [2019-11-07 01:14:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:12,687 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 598 transitions. [2019-11-07 01:14:12,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 598 transitions. [2019-11-07 01:14:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 01:14:12,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:12,690 INFO L410 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, 1, 1, 1, 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-11-07 01:14:12,690 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:12,690 INFO L82 PathProgramCache]: Analyzing trace with hash 754738376, now seen corresponding path program 1 times [2019-11-07 01:14:12,691 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:12,691 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773439479] [2019-11-07 01:14:12,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 01:14:12,738 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773439479] [2019-11-07 01:14:12,738 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:12,738 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:12,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146037064] [2019-11-07 01:14:12,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:12,739 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:12,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:12,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:12,740 INFO L87 Difference]: Start difference. First operand 382 states and 598 transitions. Second operand 5 states. [2019-11-07 01:14:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:12,956 INFO L93 Difference]: Finished difference Result 782 states and 1226 transitions. [2019-11-07 01:14:12,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:12,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-11-07 01:14:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:12,959 INFO L225 Difference]: With dead ends: 782 [2019-11-07 01:14:12,960 INFO L226 Difference]: Without dead ends: 413 [2019-11-07 01:14:12,963 INFO L630 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-11-07 01:14:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-07 01:14:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-11-07 01:14:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-07 01:14:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 639 transitions. [2019-11-07 01:14:12,982 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 639 transitions. Word has length 92 [2019-11-07 01:14:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:12,982 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 639 transitions. [2019-11-07 01:14:12,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 639 transitions. [2019-11-07 01:14:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-07 01:14:12,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:12,985 INFO L410 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, 1, 1, 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-11-07 01:14:12,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash -196155072, now seen corresponding path program 1 times [2019-11-07 01:14:12,985 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:12,986 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284659674] [2019-11-07 01:14:12,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 01:14:13,061 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284659674] [2019-11-07 01:14:13,063 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:13,063 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:13,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318517943] [2019-11-07 01:14:13,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:13,064 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:13,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:13,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:13,065 INFO L87 Difference]: Start difference. First operand 411 states and 639 transitions. Second operand 5 states. [2019-11-07 01:14:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:13,340 INFO L93 Difference]: Finished difference Result 811 states and 1263 transitions. [2019-11-07 01:14:13,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:13,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-07 01:14:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:13,344 INFO L225 Difference]: With dead ends: 811 [2019-11-07 01:14:13,344 INFO L226 Difference]: Without dead ends: 413 [2019-11-07 01:14:13,345 INFO L630 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-11-07 01:14:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-07 01:14:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-11-07 01:14:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-07 01:14:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 635 transitions. [2019-11-07 01:14:13,364 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 635 transitions. Word has length 93 [2019-11-07 01:14:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:13,364 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 635 transitions. [2019-11-07 01:14:13,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 635 transitions. [2019-11-07 01:14:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:14:13,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:13,366 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:13,366 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:13,367 INFO L82 PathProgramCache]: Analyzing trace with hash 222103604, now seen corresponding path program 1 times [2019-11-07 01:14:13,367 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:13,367 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716207508] [2019-11-07 01:14:13,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-07 01:14:13,419 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716207508] [2019-11-07 01:14:13,420 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:13,420 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:13,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857768472] [2019-11-07 01:14:13,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:13,421 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:13,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:13,422 INFO L87 Difference]: Start difference. First operand 411 states and 635 transitions. Second operand 5 states. [2019-11-07 01:14:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:13,622 INFO L93 Difference]: Finished difference Result 834 states and 1294 transitions. [2019-11-07 01:14:13,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:13,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-07 01:14:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:13,626 INFO L225 Difference]: With dead ends: 834 [2019-11-07 01:14:13,626 INFO L226 Difference]: Without dead ends: 436 [2019-11-07 01:14:13,628 INFO L630 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-11-07 01:14:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-07 01:14:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-11-07 01:14:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-07 01:14:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 662 transitions. [2019-11-07 01:14:13,649 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 662 transitions. Word has length 106 [2019-11-07 01:14:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:13,649 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 662 transitions. [2019-11-07 01:14:13,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 662 transitions. [2019-11-07 01:14:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-07 01:14:13,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:13,651 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:13,651 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:13,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1331192532, now seen corresponding path program 1 times [2019-11-07 01:14:13,652 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:13,652 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122047918] [2019-11-07 01:14:13,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-07 01:14:13,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122047918] [2019-11-07 01:14:13,707 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:13,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:13,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583926919] [2019-11-07 01:14:13,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:13,709 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:13,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:13,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:13,710 INFO L87 Difference]: Start difference. First operand 432 states and 662 transitions. Second operand 5 states. [2019-11-07 01:14:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:13,929 INFO L93 Difference]: Finished difference Result 855 states and 1313 transitions. [2019-11-07 01:14:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:13,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-11-07 01:14:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:13,934 INFO L225 Difference]: With dead ends: 855 [2019-11-07 01:14:13,934 INFO L226 Difference]: Without dead ends: 436 [2019-11-07 01:14:13,936 INFO L630 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-11-07 01:14:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-07 01:14:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-11-07 01:14:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-07 01:14:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 654 transitions. [2019-11-07 01:14:13,966 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 654 transitions. Word has length 107 [2019-11-07 01:14:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:13,966 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 654 transitions. [2019-11-07 01:14:13,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 654 transitions. [2019-11-07 01:14:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-07 01:14:13,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:13,969 INFO L410 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, 1, 1, 1] [2019-11-07 01:14:13,969 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:13,970 INFO L82 PathProgramCache]: Analyzing trace with hash -276692460, now seen corresponding path program 1 times [2019-11-07 01:14:13,970 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:13,970 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637630394] [2019-11-07 01:14:13,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 01:14:14,043 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637630394] [2019-11-07 01:14:14,043 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:14,043 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:14,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416824546] [2019-11-07 01:14:14,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:14,076 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:14,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:14,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:14,077 INFO L87 Difference]: Start difference. First operand 432 states and 654 transitions. Second operand 5 states. [2019-11-07 01:14:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:14,393 INFO L93 Difference]: Finished difference Result 896 states and 1357 transitions. [2019-11-07 01:14:14,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:14,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-11-07 01:14:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:14,398 INFO L225 Difference]: With dead ends: 896 [2019-11-07 01:14:14,398 INFO L226 Difference]: Without dead ends: 477 [2019-11-07 01:14:14,400 INFO L630 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-11-07 01:14:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-11-07 01:14:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2019-11-07 01:14:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-11-07 01:14:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 715 transitions. [2019-11-07 01:14:14,436 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 715 transitions. Word has length 108 [2019-11-07 01:14:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:14,437 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 715 transitions. [2019-11-07 01:14:14,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 715 transitions. [2019-11-07 01:14:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-07 01:14:14,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:14,439 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-07 01:14:14,439 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:14,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:14,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1027622475, now seen corresponding path program 1 times [2019-11-07 01:14:14,440 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:14,440 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234482794] [2019-11-07 01:14:14,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-07 01:14:14,497 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234482794] [2019-11-07 01:14:14,497 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:14,497 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:14,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520628335] [2019-11-07 01:14:14,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:14,498 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:14,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:14,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:14,499 INFO L87 Difference]: Start difference. First operand 474 states and 715 transitions. Second operand 5 states. [2019-11-07 01:14:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:14,722 INFO L93 Difference]: Finished difference Result 971 states and 1465 transitions. [2019-11-07 01:14:14,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:14,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-07 01:14:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:14,725 INFO L225 Difference]: With dead ends: 971 [2019-11-07 01:14:14,726 INFO L226 Difference]: Without dead ends: 510 [2019-11-07 01:14:14,727 INFO L630 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-11-07 01:14:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-07 01:14:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-11-07 01:14:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-11-07 01:14:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 761 transitions. [2019-11-07 01:14:14,753 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 761 transitions. Word has length 109 [2019-11-07 01:14:14,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:14,753 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 761 transitions. [2019-11-07 01:14:14,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 761 transitions. [2019-11-07 01:14:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-07 01:14:14,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:14,756 INFO L410 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, 1, 1, 1, 1] [2019-11-07 01:14:14,756 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1688696815, now seen corresponding path program 1 times [2019-11-07 01:14:14,757 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:14,757 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280029788] [2019-11-07 01:14:14,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 01:14:14,808 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280029788] [2019-11-07 01:14:14,809 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:14,809 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:14,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635691190] [2019-11-07 01:14:14,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:14,814 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:14,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:14,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:14,815 INFO L87 Difference]: Start difference. First operand 508 states and 761 transitions. Second operand 5 states. [2019-11-07 01:14:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:15,056 INFO L93 Difference]: Finished difference Result 1010 states and 1516 transitions. [2019-11-07 01:14:15,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:15,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-07 01:14:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:15,060 INFO L225 Difference]: With dead ends: 1010 [2019-11-07 01:14:15,060 INFO L226 Difference]: Without dead ends: 513 [2019-11-07 01:14:15,062 INFO L630 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-11-07 01:14:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-11-07 01:14:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2019-11-07 01:14:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-07 01:14:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 764 transitions. [2019-11-07 01:14:15,098 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 764 transitions. Word has length 109 [2019-11-07 01:14:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:15,099 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 764 transitions. [2019-11-07 01:14:15,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 764 transitions. [2019-11-07 01:14:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-07 01:14:15,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:15,101 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-07 01:14:15,102 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:15,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:15,102 INFO L82 PathProgramCache]: Analyzing trace with hash -429369896, now seen corresponding path program 1 times [2019-11-07 01:14:15,103 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:15,103 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486676054] [2019-11-07 01:14:15,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-07 01:14:15,189 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486676054] [2019-11-07 01:14:15,190 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:15,190 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:15,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562908021] [2019-11-07 01:14:15,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:15,191 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:15,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:15,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:15,191 INFO L87 Difference]: Start difference. First operand 510 states and 764 transitions. Second operand 5 states. [2019-11-07 01:14:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:15,403 INFO L93 Difference]: Finished difference Result 1009 states and 1513 transitions. [2019-11-07 01:14:15,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:15,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-11-07 01:14:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:15,410 INFO L225 Difference]: With dead ends: 1009 [2019-11-07 01:14:15,410 INFO L226 Difference]: Without dead ends: 512 [2019-11-07 01:14:15,411 INFO L630 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-11-07 01:14:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-07 01:14:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2019-11-07 01:14:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-07 01:14:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 760 transitions. [2019-11-07 01:14:15,435 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 760 transitions. Word has length 110 [2019-11-07 01:14:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:15,435 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 760 transitions. [2019-11-07 01:14:15,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 760 transitions. [2019-11-07 01:14:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-07 01:14:15,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:15,437 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:15,438 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:15,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1290144821, now seen corresponding path program 1 times [2019-11-07 01:14:15,439 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:15,439 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965215447] [2019-11-07 01:14:15,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-07 01:14:15,481 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965215447] [2019-11-07 01:14:15,481 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:15,482 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:15,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37107352] [2019-11-07 01:14:15,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:15,483 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:15,483 INFO L87 Difference]: Start difference. First operand 510 states and 760 transitions. Second operand 3 states. [2019-11-07 01:14:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:15,533 INFO L93 Difference]: Finished difference Result 1497 states and 2233 transitions. [2019-11-07 01:14:15,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:15,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-07 01:14:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:15,539 INFO L225 Difference]: With dead ends: 1497 [2019-11-07 01:14:15,539 INFO L226 Difference]: Without dead ends: 1000 [2019-11-07 01:14:15,541 INFO L630 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-11-07 01:14:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-11-07 01:14:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 511. [2019-11-07 01:14:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-11-07 01:14:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 761 transitions. [2019-11-07 01:14:15,570 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 761 transitions. Word has length 122 [2019-11-07 01:14:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:15,570 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 761 transitions. [2019-11-07 01:14:15,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 761 transitions. [2019-11-07 01:14:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-07 01:14:15,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:15,573 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:15,573 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:15,574 INFO L82 PathProgramCache]: Analyzing trace with hash -953838477, now seen corresponding path program 1 times [2019-11-07 01:14:15,574 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:15,574 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704164264] [2019-11-07 01:14:15,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-07 01:14:15,627 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704164264] [2019-11-07 01:14:15,627 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:15,627 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:15,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247117575] [2019-11-07 01:14:15,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:15,628 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:15,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:15,629 INFO L87 Difference]: Start difference. First operand 511 states and 761 transitions. Second operand 3 states. [2019-11-07 01:14:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:15,709 INFO L93 Difference]: Finished difference Result 1505 states and 2248 transitions. [2019-11-07 01:14:15,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:15,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-07 01:14:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:15,715 INFO L225 Difference]: With dead ends: 1505 [2019-11-07 01:14:15,716 INFO L226 Difference]: Without dead ends: 1007 [2019-11-07 01:14:15,717 INFO L630 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-11-07 01:14:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-11-07 01:14:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2019-11-07 01:14:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-11-07 01:14:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1498 transitions. [2019-11-07 01:14:15,771 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1498 transitions. Word has length 122 [2019-11-07 01:14:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:15,771 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 1498 transitions. [2019-11-07 01:14:15,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1498 transitions. [2019-11-07 01:14:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-07 01:14:15,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:15,776 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:15,776 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:15,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:15,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1636886403, now seen corresponding path program 1 times [2019-11-07 01:14:15,777 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:15,778 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011355126] [2019-11-07 01:14:15,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-07 01:14:15,858 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011355126] [2019-11-07 01:14:15,858 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:15,858 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:15,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723114736] [2019-11-07 01:14:15,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:15,859 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:15,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:15,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:15,860 INFO L87 Difference]: Start difference. First operand 1007 states and 1498 transitions. Second operand 3 states. [2019-11-07 01:14:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:15,980 INFO L93 Difference]: Finished difference Result 2499 states and 3723 transitions. [2019-11-07 01:14:15,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:15,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-07 01:14:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:15,987 INFO L225 Difference]: With dead ends: 2499 [2019-11-07 01:14:15,988 INFO L226 Difference]: Without dead ends: 1505 [2019-11-07 01:14:15,991 INFO L630 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-11-07 01:14:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-11-07 01:14:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2019-11-07 01:14:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-07 01:14:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2239 transitions. [2019-11-07 01:14:16,062 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2239 transitions. Word has length 124 [2019-11-07 01:14:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:16,063 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 2239 transitions. [2019-11-07 01:14:16,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2239 transitions. [2019-11-07 01:14:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-07 01:14:16,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:16,067 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:16,067 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash -89246318, now seen corresponding path program 1 times [2019-11-07 01:14:16,068 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:16,068 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273084859] [2019-11-07 01:14:16,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-07 01:14:16,113 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273084859] [2019-11-07 01:14:16,114 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:16,114 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:16,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007921107] [2019-11-07 01:14:16,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:16,115 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:16,115 INFO L87 Difference]: Start difference. First operand 1503 states and 2239 transitions. Second operand 3 states. [2019-11-07 01:14:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:16,277 INFO L93 Difference]: Finished difference Result 2003 states and 2984 transitions. [2019-11-07 01:14:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:16,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-07 01:14:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:16,288 INFO L225 Difference]: With dead ends: 2003 [2019-11-07 01:14:16,288 INFO L226 Difference]: Without dead ends: 2001 [2019-11-07 01:14:16,289 INFO L630 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-11-07 01:14:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-11-07 01:14:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1999. [2019-11-07 01:14:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-11-07 01:14:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2981 transitions. [2019-11-07 01:14:16,443 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2981 transitions. Word has length 125 [2019-11-07 01:14:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:16,444 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 2981 transitions. [2019-11-07 01:14:16,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2981 transitions. [2019-11-07 01:14:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 01:14:16,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:16,452 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:16,453 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1672983707, now seen corresponding path program 1 times [2019-11-07 01:14:16,454 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:16,454 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561555091] [2019-11-07 01:14:16,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-07 01:14:16,579 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561555091] [2019-11-07 01:14:16,579 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:16,579 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:16,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778582565] [2019-11-07 01:14:16,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:16,581 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:16,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:16,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:16,582 INFO L87 Difference]: Start difference. First operand 1999 states and 2981 transitions. Second operand 5 states. [2019-11-07 01:14:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:16,986 INFO L93 Difference]: Finished difference Result 4173 states and 6206 transitions. [2019-11-07 01:14:16,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:16,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-11-07 01:14:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:16,997 INFO L225 Difference]: With dead ends: 4173 [2019-11-07 01:14:16,997 INFO L226 Difference]: Without dead ends: 2187 [2019-11-07 01:14:17,001 INFO L630 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-11-07 01:14:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-11-07 01:14:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2163. [2019-11-07 01:14:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-11-07 01:14:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3201 transitions. [2019-11-07 01:14:17,115 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3201 transitions. Word has length 155 [2019-11-07 01:14:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:17,116 INFO L462 AbstractCegarLoop]: Abstraction has 2163 states and 3201 transitions. [2019-11-07 01:14:17,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3201 transitions. [2019-11-07 01:14:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:14:17,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:17,121 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-07 01:14:17,121 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:17,121 INFO L82 PathProgramCache]: Analyzing trace with hash -132146072, now seen corresponding path program 1 times [2019-11-07 01:14:17,121 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:17,122 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983480487] [2019-11-07 01:14:17,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-07 01:14:17,188 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983480487] [2019-11-07 01:14:17,188 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:17,188 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:17,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144947024] [2019-11-07 01:14:17,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:17,189 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:17,190 INFO L87 Difference]: Start difference. First operand 2163 states and 3201 transitions. Second operand 5 states. [2019-11-07 01:14:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:17,496 INFO L93 Difference]: Finished difference Result 4337 states and 6418 transitions. [2019-11-07 01:14:17,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:17,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-11-07 01:14:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:17,508 INFO L225 Difference]: With dead ends: 4337 [2019-11-07 01:14:17,508 INFO L226 Difference]: Without dead ends: 2155 [2019-11-07 01:14:17,514 INFO L630 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-11-07 01:14:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-11-07 01:14:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2131. [2019-11-07 01:14:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-07 01:14:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3145 transitions. [2019-11-07 01:14:17,670 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3145 transitions. Word has length 156 [2019-11-07 01:14:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:17,670 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 3145 transitions. [2019-11-07 01:14:17,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3145 transitions. [2019-11-07 01:14:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-07 01:14:17,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:17,677 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 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-11-07 01:14:17,677 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1669045776, now seen corresponding path program 1 times [2019-11-07 01:14:17,677 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:17,678 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946262712] [2019-11-07 01:14:17,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-07 01:14:17,761 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946262712] [2019-11-07 01:14:17,761 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839412126] [2019-11-07 01:14:17,761 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-11-07 01:14:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:17,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:14:17,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-07 01:14:17,976 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-07 01:14:18,049 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:14:18,049 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:14:18,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430079588] [2019-11-07 01:14:18,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:18,051 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:18,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:18,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:18,052 INFO L87 Difference]: Start difference. First operand 2131 states and 3145 transitions. Second operand 3 states. [2019-11-07 01:14:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:18,284 INFO L93 Difference]: Finished difference Result 4780 states and 7056 transitions. [2019-11-07 01:14:18,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:18,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-07 01:14:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:18,298 INFO L225 Difference]: With dead ends: 4780 [2019-11-07 01:14:18,299 INFO L226 Difference]: Without dead ends: 2662 [2019-11-07 01:14:18,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 375 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-11-07 01:14:18,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-11-07 01:14:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-11-07 01:14:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-11-07 01:14:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3906 transitions. [2019-11-07 01:14:18,523 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3906 transitions. Word has length 188 [2019-11-07 01:14:18,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:18,524 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 3906 transitions. [2019-11-07 01:14:18,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3906 transitions. [2019-11-07 01:14:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-07 01:14:18,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:18,531 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:18,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:18,735 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:18,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1467791988, now seen corresponding path program 1 times [2019-11-07 01:14:18,738 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:18,738 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75282275] [2019-11-07 01:14:18,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-07 01:14:18,830 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75282275] [2019-11-07 01:14:18,830 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:18,831 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:18,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322744405] [2019-11-07 01:14:18,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:18,831 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:18,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:18,832 INFO L87 Difference]: Start difference. First operand 2660 states and 3906 transitions. Second operand 3 states. [2019-11-07 01:14:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:19,008 INFO L93 Difference]: Finished difference Result 4249 states and 6242 transitions. [2019-11-07 01:14:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:19,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-07 01:14:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:19,024 INFO L225 Difference]: With dead ends: 4249 [2019-11-07 01:14:19,024 INFO L226 Difference]: Without dead ends: 3189 [2019-11-07 01:14:19,028 INFO L630 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-11-07 01:14:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-11-07 01:14:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3189. [2019-11-07 01:14:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-11-07 01:14:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4686 transitions. [2019-11-07 01:14:19,212 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4686 transitions. Word has length 192 [2019-11-07 01:14:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:19,212 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4686 transitions. [2019-11-07 01:14:19,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4686 transitions. [2019-11-07 01:14:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-07 01:14:19,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:19,223 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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-11-07 01:14:19,223 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:19,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1040739973, now seen corresponding path program 1 times [2019-11-07 01:14:19,224 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:19,224 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346276248] [2019-11-07 01:14:19,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-11-07 01:14:19,341 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346276248] [2019-11-07 01:14:19,341 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:19,341 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:19,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430882154] [2019-11-07 01:14:19,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:19,342 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:19,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:19,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:19,343 INFO L87 Difference]: Start difference. First operand 3189 states and 4686 transitions. Second operand 3 states. [2019-11-07 01:14:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:19,662 INFO L93 Difference]: Finished difference Result 6425 states and 9427 transitions. [2019-11-07 01:14:19,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:19,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-07 01:14:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:19,680 INFO L225 Difference]: With dead ends: 6425 [2019-11-07 01:14:19,680 INFO L226 Difference]: Without dead ends: 3249 [2019-11-07 01:14:19,690 INFO L630 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-11-07 01:14:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-11-07 01:14:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3189. [2019-11-07 01:14:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-11-07 01:14:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4638 transitions. [2019-11-07 01:14:19,953 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4638 transitions. Word has length 270 [2019-11-07 01:14:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:19,953 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4638 transitions. [2019-11-07 01:14:19,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4638 transitions. [2019-11-07 01:14:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-07 01:14:19,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:19,971 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:19,971 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:19,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1618154303, now seen corresponding path program 1 times [2019-11-07 01:14:19,972 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:19,972 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484895547] [2019-11-07 01:14:19,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-07 01:14:20,119 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484895547] [2019-11-07 01:14:20,120 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:20,120 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:20,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654303783] [2019-11-07 01:14:20,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:20,121 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:20,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:20,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:20,122 INFO L87 Difference]: Start difference. First operand 3189 states and 4638 transitions. Second operand 3 states. [2019-11-07 01:14:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:20,612 INFO L93 Difference]: Finished difference Result 6461 states and 9373 transitions. [2019-11-07 01:14:20,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:20,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-11-07 01:14:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:20,623 INFO L225 Difference]: With dead ends: 6461 [2019-11-07 01:14:20,710 INFO L226 Difference]: Without dead ends: 3285 [2019-11-07 01:14:20,718 INFO L630 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-11-07 01:14:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-11-07 01:14:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 3189. [2019-11-07 01:14:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-11-07 01:14:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4422 transitions. [2019-11-07 01:14:20,993 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4422 transitions. Word has length 274 [2019-11-07 01:14:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:20,994 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4422 transitions. [2019-11-07 01:14:20,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4422 transitions. [2019-11-07 01:14:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-07 01:14:21,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:21,004 INFO L410 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, 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] [2019-11-07 01:14:21,004 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1393049634, now seen corresponding path program 1 times [2019-11-07 01:14:21,005 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:21,005 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127050086] [2019-11-07 01:14:21,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-11-07 01:14:21,111 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127050086] [2019-11-07 01:14:21,111 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:21,111 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:21,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348558127] [2019-11-07 01:14:21,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:21,113 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:21,113 INFO L87 Difference]: Start difference. First operand 3189 states and 4422 transitions. Second operand 3 states. [2019-11-07 01:14:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:21,419 INFO L93 Difference]: Finished difference Result 6469 states and 8954 transitions. [2019-11-07 01:14:21,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:21,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-11-07 01:14:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:21,433 INFO L225 Difference]: With dead ends: 6469 [2019-11-07 01:14:21,433 INFO L226 Difference]: Without dead ends: 3293 [2019-11-07 01:14:21,440 INFO L630 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-11-07 01:14:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-11-07 01:14:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3195. [2019-11-07 01:14:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-11-07 01:14:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 4275 transitions. [2019-11-07 01:14:21,616 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 4275 transitions. Word has length 284 [2019-11-07 01:14:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:21,617 INFO L462 AbstractCegarLoop]: Abstraction has 3195 states and 4275 transitions. [2019-11-07 01:14:21,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 4275 transitions. [2019-11-07 01:14:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-07 01:14:21,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:21,633 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:21,634 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash -27112689, now seen corresponding path program 1 times [2019-11-07 01:14:21,634 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:21,635 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496925415] [2019-11-07 01:14:21,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-07 01:14:21,846 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496925415] [2019-11-07 01:14:21,847 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951983758] [2019-11-07 01:14:21,847 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-11-07 01:14:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:21,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:14:22,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-11-07 01:14:22,098 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-11-07 01:14:22,179 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:14:22,180 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:14:22,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182105304] [2019-11-07 01:14:22,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:22,181 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:22,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:22,181 INFO L87 Difference]: Start difference. First operand 3195 states and 4275 transitions. Second operand 3 states. [2019-11-07 01:14:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:22,613 INFO L93 Difference]: Finished difference Result 9385 states and 12539 transitions. [2019-11-07 01:14:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:22,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-07 01:14:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:22,629 INFO L225 Difference]: With dead ends: 9385 [2019-11-07 01:14:22,629 INFO L226 Difference]: Without dead ends: 6209 [2019-11-07 01:14:22,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 588 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-11-07 01:14:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2019-11-07 01:14:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 6207. [2019-11-07 01:14:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2019-11-07 01:14:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 8271 transitions. [2019-11-07 01:14:23,075 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 8271 transitions. Word has length 294 [2019-11-07 01:14:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:23,075 INFO L462 AbstractCegarLoop]: Abstraction has 6207 states and 8271 transitions. [2019-11-07 01:14:23,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 8271 transitions. [2019-11-07 01:14:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-07 01:14:23,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:23,090 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:23,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:23,304 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash 533587089, now seen corresponding path program 1 times [2019-11-07 01:14:23,304 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:23,305 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325665324] [2019-11-07 01:14:23,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-07 01:14:23,422 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325665324] [2019-11-07 01:14:23,423 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627252342] [2019-11-07 01:14:23,423 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-11-07 01:14:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:23,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:14:23,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-07 01:14:23,662 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-07 01:14:23,738 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [416789855] [2019-11-07 01:14:23,745 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 295 [2019-11-07 01:14:23,835 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:14:23,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:14:24,228 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:14:25,676 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:14:25,679 INFO L272 AbstractInterpreter]: Visited 98 different actions 1582 times. Merged at 85 different actions 1331 times. Widened at 16 different actions 180 times. Performed 3684 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3684 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 136 fixpoints after 18 different actions. Largest state had 97 variables. [2019-11-07 01:14:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:25,687 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:14:25,687 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:14:25,687 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:14:25,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972872416] [2019-11-07 01:14:25,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:14:25,689 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:25,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:14:25,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:25,690 INFO L87 Difference]: Start difference. First operand 6207 states and 8271 transitions. Second operand 6 states. [2019-11-07 01:14:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:27,250 INFO L93 Difference]: Finished difference Result 19340 states and 25403 transitions. [2019-11-07 01:14:27,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 01:14:27,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 294 [2019-11-07 01:14:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:27,292 INFO L225 Difference]: With dead ends: 19340 [2019-11-07 01:14:27,292 INFO L226 Difference]: Without dead ends: 12968 [2019-11-07 01:14:27,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:14:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12968 states. [2019-11-07 01:14:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12968 to 6197. [2019-11-07 01:14:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2019-11-07 01:14:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 8207 transitions. [2019-11-07 01:14:27,879 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 8207 transitions. Word has length 294 [2019-11-07 01:14:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:27,880 INFO L462 AbstractCegarLoop]: Abstraction has 6197 states and 8207 transitions. [2019-11-07 01:14:27,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:14:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 8207 transitions. [2019-11-07 01:14:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-07 01:14:27,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:27,906 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-07 01:14:28,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:28,123 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:28,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1588759982, now seen corresponding path program 1 times [2019-11-07 01:14:28,124 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:28,124 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080177892] [2019-11-07 01:14:28,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-11-07 01:14:28,229 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080177892] [2019-11-07 01:14:28,229 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:28,230 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:28,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172397441] [2019-11-07 01:14:28,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:28,231 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:28,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:28,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:28,231 INFO L87 Difference]: Start difference. First operand 6197 states and 8207 transitions. Second operand 3 states. [2019-11-07 01:14:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:28,673 INFO L93 Difference]: Finished difference Result 12761 states and 16914 transitions. [2019-11-07 01:14:28,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:28,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-11-07 01:14:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:28,686 INFO L225 Difference]: With dead ends: 12761 [2019-11-07 01:14:28,686 INFO L226 Difference]: Without dead ends: 6387 [2019-11-07 01:14:28,699 INFO L630 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-11-07 01:14:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2019-11-07 01:14:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 6377. [2019-11-07 01:14:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6377 states. [2019-11-07 01:14:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6377 states to 6377 states and 8381 transitions. [2019-11-07 01:14:29,006 INFO L78 Accepts]: Start accepts. Automaton has 6377 states and 8381 transitions. Word has length 312 [2019-11-07 01:14:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:29,007 INFO L462 AbstractCegarLoop]: Abstraction has 6377 states and 8381 transitions. [2019-11-07 01:14:29,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6377 states and 8381 transitions. [2019-11-07 01:14:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-07 01:14:29,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:29,023 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 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, 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-11-07 01:14:29,023 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:29,024 INFO L82 PathProgramCache]: Analyzing trace with hash -630627056, now seen corresponding path program 1 times [2019-11-07 01:14:29,024 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:29,024 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918606485] [2019-11-07 01:14:29,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-07 01:14:29,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918606485] [2019-11-07 01:14:29,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444661896] [2019-11-07 01:14:29,144 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-11-07 01:14:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:29,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:14:29,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-07 01:14:29,350 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-07 01:14:29,523 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [268319208] [2019-11-07 01:14:29,523 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 325 [2019-11-07 01:14:29,533 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:14:29,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:14:30,779 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:14:30,780 INFO L272 AbstractInterpreter]: Visited 80 different actions 1238 times. Merged at 69 different actions 1026 times. Widened at 12 different actions 104 times. Performed 2935 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2935 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 128 fixpoints after 14 different actions. Largest state had 95 variables. [2019-11-07 01:14:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:30,781 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:14:30,781 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:14:30,782 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:14:30,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538673111] [2019-11-07 01:14:30,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:14:30,785 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:30,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:14:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:30,786 INFO L87 Difference]: Start difference. First operand 6377 states and 8381 transitions. Second operand 6 states. [2019-11-07 01:14:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:32,312 INFO L93 Difference]: Finished difference Result 16309 states and 21142 transitions. [2019-11-07 01:14:32,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 01:14:32,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2019-11-07 01:14:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:32,333 INFO L225 Difference]: With dead ends: 16309 [2019-11-07 01:14:32,333 INFO L226 Difference]: Without dead ends: 9971 [2019-11-07 01:14:32,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:14:32,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9971 states. [2019-11-07 01:14:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9971 to 4565. [2019-11-07 01:14:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-11-07 01:14:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 5767 transitions. [2019-11-07 01:14:32,577 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 5767 transitions. Word has length 324 [2019-11-07 01:14:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:32,577 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 5767 transitions. [2019-11-07 01:14:32,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:14:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5767 transitions. [2019-11-07 01:14:32,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-11-07 01:14:32,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:32,590 INFO L410 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, 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-11-07 01:14:32,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:32,795 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:32,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:32,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1793866143, now seen corresponding path program 1 times [2019-11-07 01:14:32,796 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:32,796 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39612146] [2019-11-07 01:14:32,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-11-07 01:14:32,952 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39612146] [2019-11-07 01:14:32,952 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:32,952 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:32,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019880327] [2019-11-07 01:14:32,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:32,953 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:32,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:32,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:32,954 INFO L87 Difference]: Start difference. First operand 4565 states and 5767 transitions. Second operand 3 states. [2019-11-07 01:14:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:33,300 INFO L93 Difference]: Finished difference Result 9113 states and 11506 transitions. [2019-11-07 01:14:33,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:33,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-11-07 01:14:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:33,311 INFO L225 Difference]: With dead ends: 9113 [2019-11-07 01:14:33,311 INFO L226 Difference]: Without dead ends: 4587 [2019-11-07 01:14:33,320 INFO L630 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-11-07 01:14:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2019-11-07 01:14:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4565. [2019-11-07 01:14:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-11-07 01:14:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 5701 transitions. [2019-11-07 01:14:33,552 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 5701 transitions. Word has length 327 [2019-11-07 01:14:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:33,552 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 5701 transitions. [2019-11-07 01:14:33,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5701 transitions. [2019-11-07 01:14:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-07 01:14:33,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:33,566 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:14:33,566 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:33,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:33,567 INFO L82 PathProgramCache]: Analyzing trace with hash 141772578, now seen corresponding path program 1 times [2019-11-07 01:14:33,567 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:33,567 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112937776] [2019-11-07 01:14:33,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-11-07 01:14:33,699 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112937776] [2019-11-07 01:14:33,699 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:33,700 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:33,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234867266] [2019-11-07 01:14:33,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:33,702 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:33,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:33,703 INFO L87 Difference]: Start difference. First operand 4565 states and 5701 transitions. Second operand 3 states. [2019-11-07 01:14:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:34,072 INFO L93 Difference]: Finished difference Result 8025 states and 10084 transitions. [2019-11-07 01:14:34,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:34,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-11-07 01:14:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:34,082 INFO L225 Difference]: With dead ends: 8025 [2019-11-07 01:14:34,082 INFO L226 Difference]: Without dead ends: 4621 [2019-11-07 01:14:34,088 INFO L630 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-11-07 01:14:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2019-11-07 01:14:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 4565. [2019-11-07 01:14:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-11-07 01:14:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 5695 transitions. [2019-11-07 01:14:34,323 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 5695 transitions. Word has length 370 [2019-11-07 01:14:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:34,324 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 5695 transitions. [2019-11-07 01:14:34,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5695 transitions. [2019-11-07 01:14:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-11-07 01:14:34,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:34,336 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-07 01:14:34,336 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:34,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:34,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1004200358, now seen corresponding path program 1 times [2019-11-07 01:14:34,337 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:34,337 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469875459] [2019-11-07 01:14:34,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-11-07 01:14:34,460 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469875459] [2019-11-07 01:14:34,461 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:34,461 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:34,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545119543] [2019-11-07 01:14:34,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:34,462 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:34,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:34,462 INFO L87 Difference]: Start difference. First operand 4565 states and 5695 transitions. Second operand 3 states.