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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:31:19,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:31:19,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:31:19,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:31:19,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:31:19,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:31:19,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:31:19,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:31:19,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:31:19,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:31:19,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:31:19,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:31:19,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:31:19,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:31:19,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:31:19,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:31:19,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:31:19,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:31:19,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:31:19,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:31:19,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:31:19,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:31:19,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:31:19,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:31:19,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:31:19,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:31:19,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:31:19,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:31:19,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:31:19,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:31:19,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:31:19,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:31:19,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:31:19,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:31:19,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:31:19,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:31:19,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:31:19,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:31:19,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:31:19,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:31:19,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:31:19,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:31:19,136 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:31:19,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:31:19,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:31:19,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:31:19,137 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:31:19,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:31:19,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:31:19,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:31:19,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:31:19,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:31:19,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:31:19,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:31:19,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:31:19,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:31:19,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:31:19,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:31:19,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:31:19,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:31:19,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:31:19,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:31:19,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:31:19,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:31:19,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:31:19,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:31:19,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:31:19,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:31:19,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:31:19,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:31:19,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:31:19,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:31:19,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:31:19,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:31:19,418 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:31:19,418 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:31:19,419 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-10-15 03:31:19,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccad4102f/8f83220b4af24261a3402c9abd925622/FLAGeca1d8507 [2019-10-15 03:31:20,059 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:31:20,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-15 03:31:20,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccad4102f/8f83220b4af24261a3402c9abd925622/FLAGeca1d8507 [2019-10-15 03:31:20,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccad4102f/8f83220b4af24261a3402c9abd925622 [2019-10-15 03:31:20,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:31:20,360 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:31:20,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:20,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:31:20,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:31:20,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:20" (1/1) ... [2019-10-15 03:31:20,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734aed89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20, skipping insertion in model container [2019-10-15 03:31:20,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:20" (1/1) ... [2019-10-15 03:31:20,375 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:31:20,433 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:31:20,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:20,675 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:31:20,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:20,863 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:31:20,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20 WrapperNode [2019-10-15 03:31:20,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:20,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:31:20,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:31:20,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:31:20,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20" (1/1) ... [2019-10-15 03:31:20,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20" (1/1) ... [2019-10-15 03:31:20,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20" (1/1) ... [2019-10-15 03:31:20,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20" (1/1) ... [2019-10-15 03:31:20,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20" (1/1) ... [2019-10-15 03:31:20,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20" (1/1) ... [2019-10-15 03:31:20,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20" (1/1) ... [2019-10-15 03:31:20,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:31:20,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:31:20,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:31:20,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:31:20,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:31:21,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:31:21,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:31:21,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 03:31:21,012 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:31:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:31:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:31:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:31:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:31:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:31:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 03:31:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:31:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:31:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:31:21,201 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:31:21,793 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 03:31:21,794 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 03:31:22,152 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:31:22,152 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:31:22,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:22 BoogieIcfgContainer [2019-10-15 03:31:22,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:31:22,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:31:22,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:31:22,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:31:22,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:31:20" (1/3) ... [2019-10-15 03:31:22,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d30b44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:22, skipping insertion in model container [2019-10-15 03:31:22,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:20" (2/3) ... [2019-10-15 03:31:22,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d30b44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:22, skipping insertion in model container [2019-10-15 03:31:22,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:22" (3/3) ... [2019-10-15 03:31:22,170 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-10-15 03:31:22,180 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:31:22,191 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:31:22,206 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:31:22,250 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:31:22,251 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:31:22,251 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:31:22,252 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:31:22,252 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:31:22,252 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:31:22,252 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:31:22,253 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:31:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-10-15 03:31:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 03:31:22,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:22,301 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:22,304 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash -999315011, now seen corresponding path program 1 times [2019-10-15 03:31:22,324 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:22,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352854648] [2019-10-15 03:31:22,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:22,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:22,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:22,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352854648] [2019-10-15 03:31:22,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:22,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:22,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501096593] [2019-10-15 03:31:22,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:22,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:22,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:22,690 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 5 states. [2019-10-15 03:31:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:23,032 INFO L93 Difference]: Finished difference Result 265 states and 452 transitions. [2019-10-15 03:31:23,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:23,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-15 03:31:23,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:23,049 INFO L225 Difference]: With dead ends: 265 [2019-10-15 03:31:23,049 INFO L226 Difference]: Without dead ends: 146 [2019-10-15 03:31:23,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-15 03:31:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 135. [2019-10-15 03:31:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-15 03:31:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 208 transitions. [2019-10-15 03:31:23,149 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 208 transitions. Word has length 34 [2019-10-15 03:31:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:23,150 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 208 transitions. [2019-10-15 03:31:23,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 208 transitions. [2019-10-15 03:31:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 03:31:23,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:23,155 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:23,156 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:23,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:23,157 INFO L82 PathProgramCache]: Analyzing trace with hash -146603789, now seen corresponding path program 1 times [2019-10-15 03:31:23,157 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:23,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092300497] [2019-10-15 03:31:23,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:23,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:23,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:23,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092300497] [2019-10-15 03:31:23,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:23,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:23,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841866473] [2019-10-15 03:31:23,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:23,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:23,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:23,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:23,314 INFO L87 Difference]: Start difference. First operand 135 states and 208 transitions. Second operand 5 states. [2019-10-15 03:31:23,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:23,631 INFO L93 Difference]: Finished difference Result 299 states and 472 transitions. [2019-10-15 03:31:23,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:23,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-15 03:31:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:23,634 INFO L225 Difference]: With dead ends: 299 [2019-10-15 03:31:23,634 INFO L226 Difference]: Without dead ends: 172 [2019-10-15 03:31:23,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-15 03:31:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 161. [2019-10-15 03:31:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-15 03:31:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 255 transitions. [2019-10-15 03:31:23,651 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 255 transitions. Word has length 35 [2019-10-15 03:31:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:23,652 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 255 transitions. [2019-10-15 03:31:23,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 255 transitions. [2019-10-15 03:31:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:31:23,654 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:23,655 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:23,655 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1126463087, now seen corresponding path program 1 times [2019-10-15 03:31:23,656 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:23,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174129262] [2019-10-15 03:31:23,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:23,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:23,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:23,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174129262] [2019-10-15 03:31:23,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:23,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:23,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007581632] [2019-10-15 03:31:23,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:23,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:23,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:23,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:23,759 INFO L87 Difference]: Start difference. First operand 161 states and 255 transitions. Second operand 5 states. [2019-10-15 03:31:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:24,020 INFO L93 Difference]: Finished difference Result 355 states and 573 transitions. [2019-10-15 03:31:24,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:24,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-15 03:31:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:24,023 INFO L225 Difference]: With dead ends: 355 [2019-10-15 03:31:24,023 INFO L226 Difference]: Without dead ends: 202 [2019-10-15 03:31:24,024 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-15 03:31:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2019-10-15 03:31:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-15 03:31:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 320 transitions. [2019-10-15 03:31:24,039 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 320 transitions. Word has length 41 [2019-10-15 03:31:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:24,040 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 320 transitions. [2019-10-15 03:31:24,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 320 transitions. [2019-10-15 03:31:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:31:24,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:24,042 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:24,042 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash 553639796, now seen corresponding path program 1 times [2019-10-15 03:31:24,043 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:24,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915108003] [2019-10-15 03:31:24,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:24,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:24,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:24,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915108003] [2019-10-15 03:31:24,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:24,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:24,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833456931] [2019-10-15 03:31:24,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:24,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:24,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:24,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:24,115 INFO L87 Difference]: Start difference. First operand 197 states and 320 transitions. Second operand 5 states. [2019-10-15 03:31:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:24,353 INFO L93 Difference]: Finished difference Result 402 states and 659 transitions. [2019-10-15 03:31:24,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:24,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-15 03:31:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:24,356 INFO L225 Difference]: With dead ends: 402 [2019-10-15 03:31:24,356 INFO L226 Difference]: Without dead ends: 213 [2019-10-15 03:31:24,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-15 03:31:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2019-10-15 03:31:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-15 03:31:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 341 transitions. [2019-10-15 03:31:24,381 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 341 transitions. Word has length 42 [2019-10-15 03:31:24,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:24,384 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 341 transitions. [2019-10-15 03:31:24,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 341 transitions. [2019-10-15 03:31:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:31:24,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:24,391 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:24,394 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:24,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:24,395 INFO L82 PathProgramCache]: Analyzing trace with hash -424386929, now seen corresponding path program 1 times [2019-10-15 03:31:24,395 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:24,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570150561] [2019-10-15 03:31:24,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:24,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:24,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:24,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570150561] [2019-10-15 03:31:24,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:24,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:24,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917546781] [2019-10-15 03:31:24,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:24,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:24,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:24,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:24,481 INFO L87 Difference]: Start difference. First operand 208 states and 341 transitions. Second operand 5 states. [2019-10-15 03:31:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:24,688 INFO L93 Difference]: Finished difference Result 441 states and 732 transitions. [2019-10-15 03:31:24,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:24,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-15 03:31:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:24,691 INFO L225 Difference]: With dead ends: 441 [2019-10-15 03:31:24,691 INFO L226 Difference]: Without dead ends: 241 [2019-10-15 03:31:24,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-15 03:31:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 231. [2019-10-15 03:31:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-15 03:31:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 380 transitions. [2019-10-15 03:31:24,703 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 380 transitions. Word has length 58 [2019-10-15 03:31:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:24,704 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 380 transitions. [2019-10-15 03:31:24,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 380 transitions. [2019-10-15 03:31:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:31:24,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:24,706 INFO L380 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] [2019-10-15 03:31:24,706 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1095038875, now seen corresponding path program 1 times [2019-10-15 03:31:24,707 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:24,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451490538] [2019-10-15 03:31:24,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:24,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:24,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:24,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451490538] [2019-10-15 03:31:24,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:24,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:24,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714838515] [2019-10-15 03:31:24,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:24,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:24,797 INFO L87 Difference]: Start difference. First operand 231 states and 380 transitions. Second operand 5 states. [2019-10-15 03:31:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:24,993 INFO L93 Difference]: Finished difference Result 464 states and 768 transitions. [2019-10-15 03:31:24,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:24,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 03:31:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:24,995 INFO L225 Difference]: With dead ends: 464 [2019-10-15 03:31:24,995 INFO L226 Difference]: Without dead ends: 241 [2019-10-15 03:31:24,996 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-15 03:31:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 231. [2019-10-15 03:31:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-15 03:31:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 377 transitions. [2019-10-15 03:31:25,009 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 377 transitions. Word has length 59 [2019-10-15 03:31:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:25,009 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 377 transitions. [2019-10-15 03:31:25,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 377 transitions. [2019-10-15 03:31:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 03:31:25,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:25,011 INFO L380 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] [2019-10-15 03:31:25,011 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:25,012 INFO L82 PathProgramCache]: Analyzing trace with hash -958230049, now seen corresponding path program 1 times [2019-10-15 03:31:25,012 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:25,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256249112] [2019-10-15 03:31:25,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:25,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:25,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:25,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256249112] [2019-10-15 03:31:25,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:25,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:25,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322902763] [2019-10-15 03:31:25,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:25,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:25,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:25,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:25,062 INFO L87 Difference]: Start difference. First operand 231 states and 377 transitions. Second operand 5 states. [2019-10-15 03:31:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:25,256 INFO L93 Difference]: Finished difference Result 483 states and 796 transitions. [2019-10-15 03:31:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:25,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-15 03:31:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:25,258 INFO L225 Difference]: With dead ends: 483 [2019-10-15 03:31:25,270 INFO L226 Difference]: Without dead ends: 260 [2019-10-15 03:31:25,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-15 03:31:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-10-15 03:31:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-15 03:31:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 425 transitions. [2019-10-15 03:31:25,285 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 425 transitions. Word has length 61 [2019-10-15 03:31:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:25,285 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 425 transitions. [2019-10-15 03:31:25,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 425 transitions. [2019-10-15 03:31:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:31:25,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:25,287 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:25,287 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1051086114, now seen corresponding path program 1 times [2019-10-15 03:31:25,288 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:25,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430885077] [2019-10-15 03:31:25,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:25,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:25,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:31:25,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430885077] [2019-10-15 03:31:25,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:25,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:25,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979957254] [2019-10-15 03:31:25,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:25,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:25,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:25,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:25,342 INFO L87 Difference]: Start difference. First operand 260 states and 425 transitions. Second operand 5 states. [2019-10-15 03:31:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:25,516 INFO L93 Difference]: Finished difference Result 527 states and 866 transitions. [2019-10-15 03:31:25,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:25,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-15 03:31:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:25,519 INFO L225 Difference]: With dead ends: 527 [2019-10-15 03:31:25,519 INFO L226 Difference]: Without dead ends: 275 [2019-10-15 03:31:25,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:25,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-15 03:31:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2019-10-15 03:31:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-10-15 03:31:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 442 transitions. [2019-10-15 03:31:25,533 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 442 transitions. Word has length 72 [2019-10-15 03:31:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:25,534 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 442 transitions. [2019-10-15 03:31:25,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 442 transitions. [2019-10-15 03:31:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:31:25,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:25,535 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:25,536 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1484021864, now seen corresponding path program 1 times [2019-10-15 03:31:25,536 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:25,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979927801] [2019-10-15 03:31:25,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:25,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:25,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:31:25,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979927801] [2019-10-15 03:31:25,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:25,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:25,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086809644] [2019-10-15 03:31:25,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:25,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:25,586 INFO L87 Difference]: Start difference. First operand 273 states and 442 transitions. Second operand 5 states. [2019-10-15 03:31:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:25,772 INFO L93 Difference]: Finished difference Result 540 states and 878 transitions. [2019-10-15 03:31:25,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:25,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-10-15 03:31:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:25,775 INFO L225 Difference]: With dead ends: 540 [2019-10-15 03:31:25,775 INFO L226 Difference]: Without dead ends: 275 [2019-10-15 03:31:25,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:25,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-15 03:31:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2019-10-15 03:31:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-10-15 03:31:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 437 transitions. [2019-10-15 03:31:25,790 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 437 transitions. Word has length 73 [2019-10-15 03:31:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:25,790 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 437 transitions. [2019-10-15 03:31:25,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 437 transitions. [2019-10-15 03:31:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:31:25,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:25,792 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:25,792 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1755593078, now seen corresponding path program 1 times [2019-10-15 03:31:25,793 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:25,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180660557] [2019-10-15 03:31:25,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:25,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:25,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:25,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180660557] [2019-10-15 03:31:25,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:25,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:25,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557580595] [2019-10-15 03:31:25,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:25,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:25,866 INFO L87 Difference]: Start difference. First operand 273 states and 437 transitions. Second operand 5 states. [2019-10-15 03:31:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:26,117 INFO L93 Difference]: Finished difference Result 574 states and 925 transitions. [2019-10-15 03:31:26,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:26,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-10-15 03:31:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:26,119 INFO L225 Difference]: With dead ends: 574 [2019-10-15 03:31:26,119 INFO L226 Difference]: Without dead ends: 309 [2019-10-15 03:31:26,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-15 03:31:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2019-10-15 03:31:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-15 03:31:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 492 transitions. [2019-10-15 03:31:26,138 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 492 transitions. Word has length 73 [2019-10-15 03:31:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:26,138 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 492 transitions. [2019-10-15 03:31:26,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 492 transitions. [2019-10-15 03:31:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-15 03:31:26,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:26,140 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:26,140 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:26,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:26,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1682903835, now seen corresponding path program 1 times [2019-10-15 03:31:26,141 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:26,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030393427] [2019-10-15 03:31:26,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:26,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:26,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:26,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030393427] [2019-10-15 03:31:26,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:26,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:26,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908617989] [2019-10-15 03:31:26,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:26,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:26,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:26,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:26,208 INFO L87 Difference]: Start difference. First operand 307 states and 492 transitions. Second operand 5 states. [2019-10-15 03:31:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:26,434 INFO L93 Difference]: Finished difference Result 608 states and 978 transitions. [2019-10-15 03:31:26,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:26,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-10-15 03:31:26,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:26,438 INFO L225 Difference]: With dead ends: 608 [2019-10-15 03:31:26,438 INFO L226 Difference]: Without dead ends: 309 [2019-10-15 03:31:26,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-15 03:31:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2019-10-15 03:31:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-15 03:31:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 490 transitions. [2019-10-15 03:31:26,454 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 490 transitions. Word has length 74 [2019-10-15 03:31:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:26,455 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 490 transitions. [2019-10-15 03:31:26,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 490 transitions. [2019-10-15 03:31:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 03:31:26,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:26,456 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:26,457 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:26,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:26,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1855628232, now seen corresponding path program 1 times [2019-10-15 03:31:26,457 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:26,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350620161] [2019-10-15 03:31:26,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:26,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:26,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 03:31:26,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350620161] [2019-10-15 03:31:26,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:26,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:26,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692284873] [2019-10-15 03:31:26,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:26,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:26,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:26,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:26,502 INFO L87 Difference]: Start difference. First operand 307 states and 490 transitions. Second operand 5 states. [2019-10-15 03:31:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:26,796 INFO L93 Difference]: Finished difference Result 631 states and 1013 transitions. [2019-10-15 03:31:26,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:26,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-15 03:31:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:26,798 INFO L225 Difference]: With dead ends: 631 [2019-10-15 03:31:26,798 INFO L226 Difference]: Without dead ends: 332 [2019-10-15 03:31:26,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-15 03:31:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-10-15 03:31:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-15 03:31:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 520 transitions. [2019-10-15 03:31:26,815 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 520 transitions. Word has length 78 [2019-10-15 03:31:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:26,816 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 520 transitions. [2019-10-15 03:31:26,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 520 transitions. [2019-10-15 03:31:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-15 03:31:26,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:26,818 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:26,818 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:26,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1529584558, now seen corresponding path program 1 times [2019-10-15 03:31:26,818 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:26,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351071963] [2019-10-15 03:31:26,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:26,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:26,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 03:31:26,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351071963] [2019-10-15 03:31:26,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:26,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:26,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657588199] [2019-10-15 03:31:26,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:26,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:26,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:26,869 INFO L87 Difference]: Start difference. First operand 328 states and 520 transitions. Second operand 5 states. [2019-10-15 03:31:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:27,071 INFO L93 Difference]: Finished difference Result 652 states and 1037 transitions. [2019-10-15 03:31:27,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:27,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-15 03:31:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:27,073 INFO L225 Difference]: With dead ends: 652 [2019-10-15 03:31:27,073 INFO L226 Difference]: Without dead ends: 332 [2019-10-15 03:31:27,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-15 03:31:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-10-15 03:31:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-15 03:31:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 514 transitions. [2019-10-15 03:31:27,090 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 514 transitions. Word has length 79 [2019-10-15 03:31:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:27,091 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 514 transitions. [2019-10-15 03:31:27,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 514 transitions. [2019-10-15 03:31:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-15 03:31:27,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:27,092 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:27,092 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:27,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1247579181, now seen corresponding path program 1 times [2019-10-15 03:31:27,093 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:27,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619876753] [2019-10-15 03:31:27,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:27,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:27,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 03:31:27,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619876753] [2019-10-15 03:31:27,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:27,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:27,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244447120] [2019-10-15 03:31:27,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:27,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:27,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:27,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:27,150 INFO L87 Difference]: Start difference. First operand 328 states and 514 transitions. Second operand 5 states. [2019-10-15 03:31:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:27,370 INFO L93 Difference]: Finished difference Result 655 states and 1029 transitions. [2019-10-15 03:31:27,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:27,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-15 03:31:27,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:27,373 INFO L225 Difference]: With dead ends: 655 [2019-10-15 03:31:27,373 INFO L226 Difference]: Without dead ends: 335 [2019-10-15 03:31:27,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-15 03:31:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2019-10-15 03:31:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-10-15 03:31:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 514 transitions. [2019-10-15 03:31:27,397 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 514 transitions. Word has length 81 [2019-10-15 03:31:27,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:27,398 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 514 transitions. [2019-10-15 03:31:27,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 514 transitions. [2019-10-15 03:31:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-15 03:31:27,399 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:27,400 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:27,400 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:27,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:27,400 INFO L82 PathProgramCache]: Analyzing trace with hash 122026175, now seen corresponding path program 1 times [2019-10-15 03:31:27,400 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:27,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469955522] [2019-10-15 03:31:27,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:27,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:27,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:31:27,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469955522] [2019-10-15 03:31:27,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:27,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:27,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714114329] [2019-10-15 03:31:27,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:27,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:27,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:27,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:27,466 INFO L87 Difference]: Start difference. First operand 335 states and 514 transitions. Second operand 5 states. [2019-10-15 03:31:27,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:27,738 INFO L93 Difference]: Finished difference Result 691 states and 1063 transitions. [2019-10-15 03:31:27,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:27,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-15 03:31:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:27,742 INFO L225 Difference]: With dead ends: 691 [2019-10-15 03:31:27,742 INFO L226 Difference]: Without dead ends: 364 [2019-10-15 03:31:27,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-10-15 03:31:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2019-10-15 03:31:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-10-15 03:31:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 551 transitions. [2019-10-15 03:31:27,766 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 551 transitions. Word has length 86 [2019-10-15 03:31:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:27,766 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 551 transitions. [2019-10-15 03:31:27,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 551 transitions. [2019-10-15 03:31:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-15 03:31:27,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:27,769 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:27,770 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1467724885, now seen corresponding path program 1 times [2019-10-15 03:31:27,771 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:27,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203655688] [2019-10-15 03:31:27,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:27,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:27,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:31:27,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203655688] [2019-10-15 03:31:27,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:27,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:27,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790148429] [2019-10-15 03:31:27,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:27,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:27,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:27,841 INFO L87 Difference]: Start difference. First operand 362 states and 551 transitions. Second operand 5 states. [2019-10-15 03:31:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:28,058 INFO L93 Difference]: Finished difference Result 718 states and 1096 transitions. [2019-10-15 03:31:28,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:28,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-10-15 03:31:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:28,061 INFO L225 Difference]: With dead ends: 718 [2019-10-15 03:31:28,061 INFO L226 Difference]: Without dead ends: 364 [2019-10-15 03:31:28,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-10-15 03:31:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2019-10-15 03:31:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-10-15 03:31:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 547 transitions. [2019-10-15 03:31:28,081 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 547 transitions. Word has length 87 [2019-10-15 03:31:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:28,081 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 547 transitions. [2019-10-15 03:31:28,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 547 transitions. [2019-10-15 03:31:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 03:31:28,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:28,083 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:28,083 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1170368886, now seen corresponding path program 1 times [2019-10-15 03:31:28,084 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:28,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555427198] [2019-10-15 03:31:28,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-15 03:31:28,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555427198] [2019-10-15 03:31:28,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:28,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:28,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309616582] [2019-10-15 03:31:28,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:28,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:28,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:28,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:28,129 INFO L87 Difference]: Start difference. First operand 362 states and 547 transitions. Second operand 5 states. [2019-10-15 03:31:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:28,319 INFO L93 Difference]: Finished difference Result 737 states and 1119 transitions. [2019-10-15 03:31:28,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:28,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-10-15 03:31:28,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:28,322 INFO L225 Difference]: With dead ends: 737 [2019-10-15 03:31:28,322 INFO L226 Difference]: Without dead ends: 383 [2019-10-15 03:31:28,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-15 03:31:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2019-10-15 03:31:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-15 03:31:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 570 transitions. [2019-10-15 03:31:28,355 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 570 transitions. Word has length 95 [2019-10-15 03:31:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:28,355 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 570 transitions. [2019-10-15 03:31:28,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 570 transitions. [2019-10-15 03:31:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 03:31:28,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:28,359 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:28,359 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash 262869300, now seen corresponding path program 1 times [2019-10-15 03:31:28,360 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:28,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255338162] [2019-10-15 03:31:28,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-15 03:31:28,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255338162] [2019-10-15 03:31:28,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:28,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:28,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737528177] [2019-10-15 03:31:28,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:28,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:28,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:28,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:28,420 INFO L87 Difference]: Start difference. First operand 381 states and 570 transitions. Second operand 5 states. [2019-10-15 03:31:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:28,677 INFO L93 Difference]: Finished difference Result 756 states and 1134 transitions. [2019-10-15 03:31:28,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:28,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-10-15 03:31:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:28,681 INFO L225 Difference]: With dead ends: 756 [2019-10-15 03:31:28,681 INFO L226 Difference]: Without dead ends: 383 [2019-10-15 03:31:28,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-15 03:31:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2019-10-15 03:31:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-15 03:31:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 562 transitions. [2019-10-15 03:31:28,743 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 562 transitions. Word has length 96 [2019-10-15 03:31:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:28,743 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 562 transitions. [2019-10-15 03:31:28,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 562 transitions. [2019-10-15 03:31:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 03:31:28,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:28,744 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:28,744 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2053463242, now seen corresponding path program 1 times [2019-10-15 03:31:28,745 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:28,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114736368] [2019-10-15 03:31:28,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:31:28,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114736368] [2019-10-15 03:31:28,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:28,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:28,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138980661] [2019-10-15 03:31:28,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:28,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:28,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:28,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:28,834 INFO L87 Difference]: Start difference. First operand 381 states and 562 transitions. Second operand 5 states. [2019-10-15 03:31:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:29,083 INFO L93 Difference]: Finished difference Result 796 states and 1176 transitions. [2019-10-15 03:31:29,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:29,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-15 03:31:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:29,086 INFO L225 Difference]: With dead ends: 796 [2019-10-15 03:31:29,086 INFO L226 Difference]: Without dead ends: 423 [2019-10-15 03:31:29,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-10-15 03:31:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2019-10-15 03:31:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-10-15 03:31:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 619 transitions. [2019-10-15 03:31:29,114 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 619 transitions. Word has length 99 [2019-10-15 03:31:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:29,115 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 619 transitions. [2019-10-15 03:31:29,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 619 transitions. [2019-10-15 03:31:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 03:31:29,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:29,117 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:29,117 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:29,117 INFO L82 PathProgramCache]: Analyzing trace with hash 113990331, now seen corresponding path program 1 times [2019-10-15 03:31:29,117 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:29,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158278576] [2019-10-15 03:31:29,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:29,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:29,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:31:29,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158278576] [2019-10-15 03:31:29,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:29,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:29,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806208973] [2019-10-15 03:31:29,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:29,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:29,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:29,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:29,169 INFO L87 Difference]: Start difference. First operand 421 states and 619 transitions. Second operand 5 states. [2019-10-15 03:31:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:29,381 INFO L93 Difference]: Finished difference Result 840 states and 1239 transitions. [2019-10-15 03:31:29,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:29,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-15 03:31:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:29,384 INFO L225 Difference]: With dead ends: 840 [2019-10-15 03:31:29,384 INFO L226 Difference]: Without dead ends: 425 [2019-10-15 03:31:29,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-10-15 03:31:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2019-10-15 03:31:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-15 03:31:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2019-10-15 03:31:29,409 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 100 [2019-10-15 03:31:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:29,409 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2019-10-15 03:31:29,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2019-10-15 03:31:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 03:31:29,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:29,411 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:29,411 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash -200181342, now seen corresponding path program 1 times [2019-10-15 03:31:29,412 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:29,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953165485] [2019-10-15 03:31:29,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:29,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:29,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 03:31:29,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953165485] [2019-10-15 03:31:29,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:29,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:29,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555400360] [2019-10-15 03:31:29,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:29,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:29,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:29,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:29,469 INFO L87 Difference]: Start difference. First operand 423 states and 622 transitions. Second operand 5 states. [2019-10-15 03:31:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:29,729 INFO L93 Difference]: Finished difference Result 872 states and 1284 transitions. [2019-10-15 03:31:29,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:29,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-15 03:31:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:29,732 INFO L225 Difference]: With dead ends: 872 [2019-10-15 03:31:29,733 INFO L226 Difference]: Without dead ends: 457 [2019-10-15 03:31:29,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-10-15 03:31:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 455. [2019-10-15 03:31:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-10-15 03:31:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 664 transitions. [2019-10-15 03:31:29,759 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 664 transitions. Word has length 103 [2019-10-15 03:31:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:29,759 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 664 transitions. [2019-10-15 03:31:29,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 664 transitions. [2019-10-15 03:31:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 03:31:29,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:29,761 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:29,761 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:29,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1320818393, now seen corresponding path program 1 times [2019-10-15 03:31:29,762 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:29,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756453168] [2019-10-15 03:31:29,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:29,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:29,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 03:31:29,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756453168] [2019-10-15 03:31:29,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:29,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:29,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896361705] [2019-10-15 03:31:29,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:29,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:29,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:29,813 INFO L87 Difference]: Start difference. First operand 455 states and 664 transitions. Second operand 5 states. [2019-10-15 03:31:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:30,042 INFO L93 Difference]: Finished difference Result 904 states and 1322 transitions. [2019-10-15 03:31:30,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:30,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-15 03:31:30,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:30,045 INFO L225 Difference]: With dead ends: 904 [2019-10-15 03:31:30,045 INFO L226 Difference]: Without dead ends: 457 [2019-10-15 03:31:30,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-10-15 03:31:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 455. [2019-10-15 03:31:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-10-15 03:31:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 660 transitions. [2019-10-15 03:31:30,071 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 660 transitions. Word has length 104 [2019-10-15 03:31:30,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:30,071 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 660 transitions. [2019-10-15 03:31:30,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 660 transitions. [2019-10-15 03:31:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 03:31:30,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:30,073 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:30,073 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:30,074 INFO L82 PathProgramCache]: Analyzing trace with hash 116705188, now seen corresponding path program 1 times [2019-10-15 03:31:30,074 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:30,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5183486] [2019-10-15 03:31:30,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:30,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:30,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 03:31:30,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5183486] [2019-10-15 03:31:30,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465261969] [2019-10-15 03:31:30,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:30,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:31:30,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-15 03:31:30,313 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:30,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:30,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:30,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-10-15 03:31:30,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:30,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 5] total 7 [2019-10-15 03:31:30,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805308259] [2019-10-15 03:31:30,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:30,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:30,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:30,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:30,413 INFO L87 Difference]: Start difference. First operand 455 states and 660 transitions. Second operand 3 states. [2019-10-15 03:31:30,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:30,529 INFO L93 Difference]: Finished difference Result 862 states and 1256 transitions. [2019-10-15 03:31:30,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:30,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-15 03:31:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:30,535 INFO L225 Difference]: With dead ends: 862 [2019-10-15 03:31:30,535 INFO L226 Difference]: Without dead ends: 860 [2019-10-15 03:31:30,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 214 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-15 03:31:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 848. [2019-10-15 03:31:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-10-15 03:31:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1242 transitions. [2019-10-15 03:31:30,615 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1242 transitions. Word has length 109 [2019-10-15 03:31:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:30,616 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1242 transitions. [2019-10-15 03:31:30,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1242 transitions. [2019-10-15 03:31:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 03:31:30,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:30,620 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 03:31:30,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:30,827 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:30,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash 256886990, now seen corresponding path program 1 times [2019-10-15 03:31:30,827 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:30,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403779727] [2019-10-15 03:31:30,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:30,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:30,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-15 03:31:30,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403779727] [2019-10-15 03:31:30,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:30,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:30,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107784428] [2019-10-15 03:31:30,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:30,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:30,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:30,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:30,891 INFO L87 Difference]: Start difference. First operand 848 states and 1242 transitions. Second operand 5 states. [2019-10-15 03:31:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:31,173 INFO L93 Difference]: Finished difference Result 1696 states and 2486 transitions. [2019-10-15 03:31:31,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:31,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 03:31:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:31,180 INFO L225 Difference]: With dead ends: 1696 [2019-10-15 03:31:31,180 INFO L226 Difference]: Without dead ends: 856 [2019-10-15 03:31:31,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-10-15 03:31:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 848. [2019-10-15 03:31:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-10-15 03:31:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1233 transitions. [2019-10-15 03:31:31,281 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1233 transitions. Word has length 133 [2019-10-15 03:31:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:31,282 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1233 transitions. [2019-10-15 03:31:31,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1233 transitions. [2019-10-15 03:31:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 03:31:31,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:31,286 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 03:31:31,287 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:31,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash 760202803, now seen corresponding path program 1 times [2019-10-15 03:31:31,288 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:31,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063594715] [2019-10-15 03:31:31,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:31,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:31,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-15 03:31:31,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063594715] [2019-10-15 03:31:31,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:31,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:31,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522532605] [2019-10-15 03:31:31,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:31,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:31,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:31,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:31,392 INFO L87 Difference]: Start difference. First operand 848 states and 1233 transitions. Second operand 5 states. [2019-10-15 03:31:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:31,812 INFO L93 Difference]: Finished difference Result 1696 states and 2468 transitions. [2019-10-15 03:31:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:31,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-10-15 03:31:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:31,820 INFO L225 Difference]: With dead ends: 1696 [2019-10-15 03:31:31,820 INFO L226 Difference]: Without dead ends: 856 [2019-10-15 03:31:31,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-10-15 03:31:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 835. [2019-10-15 03:31:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-10-15 03:31:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1211 transitions. [2019-10-15 03:31:31,923 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1211 transitions. Word has length 134 [2019-10-15 03:31:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:31,924 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1211 transitions. [2019-10-15 03:31:31,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1211 transitions. [2019-10-15 03:31:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 03:31:31,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:31,926 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:31,926 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:31,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1956804673, now seen corresponding path program 1 times [2019-10-15 03:31:31,927 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:31,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923298770] [2019-10-15 03:31:31,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:31,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:31,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-15 03:31:32,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923298770] [2019-10-15 03:31:32,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:32,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:32,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844863771] [2019-10-15 03:31:32,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:32,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:32,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:32,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:32,028 INFO L87 Difference]: Start difference. First operand 835 states and 1211 transitions. Second operand 5 states. [2019-10-15 03:31:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:32,295 INFO L93 Difference]: Finished difference Result 1341 states and 1935 transitions. [2019-10-15 03:31:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:32,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-10-15 03:31:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:32,300 INFO L225 Difference]: With dead ends: 1341 [2019-10-15 03:31:32,300 INFO L226 Difference]: Without dead ends: 894 [2019-10-15 03:31:32,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-10-15 03:31:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 891. [2019-10-15 03:31:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-10-15 03:31:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1288 transitions. [2019-10-15 03:31:32,384 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1288 transitions. Word has length 137 [2019-10-15 03:31:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:32,385 INFO L462 AbstractCegarLoop]: Abstraction has 891 states and 1288 transitions. [2019-10-15 03:31:32,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1288 transitions. [2019-10-15 03:31:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 03:31:32,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:32,390 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:32,390 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1593145510, now seen corresponding path program 1 times [2019-10-15 03:31:32,391 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:32,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947084685] [2019-10-15 03:31:32,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:32,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:32,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-15 03:31:32,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947084685] [2019-10-15 03:31:32,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:32,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:32,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602529838] [2019-10-15 03:31:32,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:32,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:32,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:32,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:32,490 INFO L87 Difference]: Start difference. First operand 891 states and 1288 transitions. Second operand 5 states. [2019-10-15 03:31:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:32,892 INFO L93 Difference]: Finished difference Result 1379 states and 1981 transitions. [2019-10-15 03:31:32,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:32,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-15 03:31:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:32,897 INFO L225 Difference]: With dead ends: 1379 [2019-10-15 03:31:32,897 INFO L226 Difference]: Without dead ends: 873 [2019-10-15 03:31:32,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-10-15 03:31:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 870. [2019-10-15 03:31:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-10-15 03:31:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1247 transitions. [2019-10-15 03:31:33,015 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1247 transitions. Word has length 138 [2019-10-15 03:31:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:33,016 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1247 transitions. [2019-10-15 03:31:33,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1247 transitions. [2019-10-15 03:31:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-15 03:31:33,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:33,021 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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-10-15 03:31:33,022 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:33,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1722943147, now seen corresponding path program 1 times [2019-10-15 03:31:33,022 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:33,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194712208] [2019-10-15 03:31:33,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:33,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:33,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 117 proven. 113 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 03:31:33,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194712208] [2019-10-15 03:31:33,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899437027] [2019-10-15 03:31:33,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:33,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 03:31:33,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:31:33,371 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:33,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:33,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:33,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:33,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:33,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:33,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:33,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-15 03:31:33,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [86589779] [2019-10-15 03:31:33,654 INFO L162 IcfgInterpreter]: Started Sifa with 64 locations of interest [2019-10-15 03:31:33,654 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:31:33,664 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:31:33,676 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:31:33,677 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:31:33,750 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-15 03:31:33,765 INFO L199 IcfgInterpreter]: Interpreting procedure ssl3_accept with input of size 3 for LOIs [2019-10-15 03:31:36,783 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 215 [2019-10-15 03:31:37,259 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 210