/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:14:04,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:14:04,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:14:04,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:14:04,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:14:04,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:14:04,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:14:04,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:14:04,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:14:04,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:14:04,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:14:04,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:14:04,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:14:04,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:14:04,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:14:04,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:14:04,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:14:04,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:14:04,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:14:04,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:14:04,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:14:04,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:14:04,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:14:04,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:14:04,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:14:04,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:14:04,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:14:04,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:14:04,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:14:04,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:14:04,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:14:04,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:14:04,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:14:04,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:14:04,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:14:04,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:14:04,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:14:04,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:14:04,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:14:04,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:14:04,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:14:04,295 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 01:14:04,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:14:04,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:14:04,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:14:04,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:14:04,325 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:14:04,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:14:04,325 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:14:04,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:14:04,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:14:04,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:14:04,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:14:04,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:14:04,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:14:04,328 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:14:04,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:14:04,328 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:14:04,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:14:04,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:14:04,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:14:04,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:14:04,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:14:04,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:14:04,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:14:04,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:14:04,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:14:04,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:14:04,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:14:04,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:14:04,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:14:04,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:14:04,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:14:04,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:14:04,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:14:04,692 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:14:04,693 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-11-07 01:14:04,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c16efca/d33072cc4dee4fb2ae63884a0561a2af/FLAGcc5b17bda [2019-11-07 01:14:05,283 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:14:05,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-11-07 01:14:05,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c16efca/d33072cc4dee4fb2ae63884a0561a2af/FLAGcc5b17bda [2019-11-07 01:14:05,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c16efca/d33072cc4dee4fb2ae63884a0561a2af [2019-11-07 01:14:05,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:14:05,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:14:05,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:14:05,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:14:05,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:14:05,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:14:05" (1/1) ... [2019-11-07 01:14:05,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a50435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:05, skipping insertion in model container [2019-11-07 01:14:05,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:14:05" (1/1) ... [2019-11-07 01:14:05,672 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:14:05,720 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:14:06,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:14:06,307 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:14:06,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:14:06,386 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:14:06,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06 WrapperNode [2019-11-07 01:14:06,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:14:06,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:14:06,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:14:06,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:14:06,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... [2019-11-07 01:14:06,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:14:06,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:14:06,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:14:06,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:14:06,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:14:06,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:14:06,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:14:06,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-11-07 01:14:06,547 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:14:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:14:06,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:14:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:14:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 01:14:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 01:14:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-11-07 01:14:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:14:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:14:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:14:06,774 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 01:14:07,405 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-07 01:14:07,406 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-07 01:14:07,408 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:14:07,409 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:14:07,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:14:07 BoogieIcfgContainer [2019-11-07 01:14:07,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:14:07,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:14:07,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:14:07,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:14:07,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:14:05" (1/3) ... [2019-11-07 01:14:07,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ea1ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:14:07, skipping insertion in model container [2019-11-07 01:14:07,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:06" (2/3) ... [2019-11-07 01:14:07,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ea1ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:14:07, skipping insertion in model container [2019-11-07 01:14:07,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:14:07" (3/3) ... [2019-11-07 01:14:07,420 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-11-07 01:14:07,430 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:14:07,439 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:14:07,451 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:14:07,479 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:14:07,480 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:14:07,480 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:14:07,480 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:14:07,480 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:14:07,480 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:14:07,481 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:14:07,481 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:14:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-11-07 01:14:07,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 01:14:07,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:07,515 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:07,516 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:07,523 INFO L82 PathProgramCache]: Analyzing trace with hash -617772913, now seen corresponding path program 1 times [2019-11-07 01:14:07,533 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:07,533 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534978886] [2019-11-07 01:14:07,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:07,845 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534978886] [2019-11-07 01:14:07,846 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:07,846 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:07,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504304704] [2019-11-07 01:14:07,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:07,855 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:07,875 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-11-07 01:14:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:08,368 INFO L93 Difference]: Finished difference Result 348 states and 596 transitions. [2019-11-07 01:14:08,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:08,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-07 01:14:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:08,393 INFO L225 Difference]: With dead ends: 348 [2019-11-07 01:14:08,393 INFO L226 Difference]: Without dead ends: 185 [2019-11-07 01:14:08,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-07 01:14:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2019-11-07 01:14:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-07 01:14:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 284 transitions. [2019-11-07 01:14:08,463 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 284 transitions. Word has length 47 [2019-11-07 01:14:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:08,464 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 284 transitions. [2019-11-07 01:14:08,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 284 transitions. [2019-11-07 01:14:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 01:14:08,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:08,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:08,467 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:08,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:08,468 INFO L82 PathProgramCache]: Analyzing trace with hash 401544370, now seen corresponding path program 1 times [2019-11-07 01:14:08,468 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:08,468 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154348310] [2019-11-07 01:14:08,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:08,616 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154348310] [2019-11-07 01:14:08,617 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:08,618 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:08,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245770588] [2019-11-07 01:14:08,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:08,620 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:08,621 INFO L87 Difference]: Start difference. First operand 177 states and 284 transitions. Second operand 5 states. [2019-11-07 01:14:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:08,995 INFO L93 Difference]: Finished difference Result 388 states and 636 transitions. [2019-11-07 01:14:08,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:08,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-07 01:14:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:08,999 INFO L225 Difference]: With dead ends: 388 [2019-11-07 01:14:09,001 INFO L226 Difference]: Without dead ends: 224 [2019-11-07 01:14:09,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-07 01:14:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2019-11-07 01:14:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-07 01:14:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-11-07 01:14:09,054 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 48 [2019-11-07 01:14:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:09,054 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-11-07 01:14:09,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-11-07 01:14:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-07 01:14:09,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:09,059 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:09,059 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:09,059 INFO L82 PathProgramCache]: Analyzing trace with hash 353705226, now seen corresponding path program 1 times [2019-11-07 01:14:09,060 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:09,060 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451040053] [2019-11-07 01:14:09,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:09,204 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451040053] [2019-11-07 01:14:09,204 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:09,204 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:09,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594894428] [2019-11-07 01:14:09,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:09,207 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:09,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:09,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:09,208 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-11-07 01:14:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:09,483 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-11-07 01:14:09,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:09,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-07 01:14:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:09,490 INFO L225 Difference]: With dead ends: 450 [2019-11-07 01:14:09,490 INFO L226 Difference]: Without dead ends: 247 [2019-11-07 01:14:09,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-07 01:14:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-11-07 01:14:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-07 01:14:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-11-07 01:14:09,525 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 75 [2019-11-07 01:14:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:09,529 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-11-07 01:14:09,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-11-07 01:14:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-07 01:14:09,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:09,537 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:09,539 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:09,540 INFO L82 PathProgramCache]: Analyzing trace with hash -668843297, now seen corresponding path program 1 times [2019-11-07 01:14:09,540 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:09,540 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328972275] [2019-11-07 01:14:09,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:09,670 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328972275] [2019-11-07 01:14:09,671 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:09,671 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:09,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318587678] [2019-11-07 01:14:09,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:09,672 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:09,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:09,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:09,673 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-11-07 01:14:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:09,917 INFO L93 Difference]: Finished difference Result 519 states and 878 transitions. [2019-11-07 01:14:09,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:09,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-11-07 01:14:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:09,921 INFO L225 Difference]: With dead ends: 519 [2019-11-07 01:14:09,921 INFO L226 Difference]: Without dead ends: 285 [2019-11-07 01:14:09,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-07 01:14:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-11-07 01:14:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-07 01:14:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 478 transitions. [2019-11-07 01:14:09,942 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 478 transitions. Word has length 80 [2019-11-07 01:14:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:09,943 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 478 transitions. [2019-11-07 01:14:09,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 478 transitions. [2019-11-07 01:14:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-07 01:14:09,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:09,950 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:09,950 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:09,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:09,951 INFO L82 PathProgramCache]: Analyzing trace with hash 293568124, now seen corresponding path program 1 times [2019-11-07 01:14:09,951 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:09,952 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148125227] [2019-11-07 01:14:09,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:10,092 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148125227] [2019-11-07 01:14:10,092 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:10,092 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:10,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628514754] [2019-11-07 01:14:10,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:10,094 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:10,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:10,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:10,094 INFO L87 Difference]: Start difference. First operand 283 states and 478 transitions. Second operand 5 states. [2019-11-07 01:14:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:10,343 INFO L93 Difference]: Finished difference Result 555 states and 941 transitions. [2019-11-07 01:14:10,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:10,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-07 01:14:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:10,346 INFO L225 Difference]: With dead ends: 555 [2019-11-07 01:14:10,346 INFO L226 Difference]: Without dead ends: 285 [2019-11-07 01:14:10,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-07 01:14:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-11-07 01:14:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-07 01:14:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 476 transitions. [2019-11-07 01:14:10,361 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 476 transitions. Word has length 81 [2019-11-07 01:14:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:10,361 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 476 transitions. [2019-11-07 01:14:10,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 476 transitions. [2019-11-07 01:14:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-07 01:14:10,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:10,363 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:10,364 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:10,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:10,364 INFO L82 PathProgramCache]: Analyzing trace with hash -95009440, now seen corresponding path program 1 times [2019-11-07 01:14:10,364 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:10,365 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380773968] [2019-11-07 01:14:10,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:14:10,422 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380773968] [2019-11-07 01:14:10,422 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:10,423 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:10,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663780979] [2019-11-07 01:14:10,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:10,424 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:10,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:10,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:10,424 INFO L87 Difference]: Start difference. First operand 283 states and 476 transitions. Second operand 5 states. [2019-11-07 01:14:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:10,599 INFO L93 Difference]: Finished difference Result 570 states and 963 transitions. [2019-11-07 01:14:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:10,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-07 01:14:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:10,604 INFO L225 Difference]: With dead ends: 570 [2019-11-07 01:14:10,605 INFO L226 Difference]: Without dead ends: 300 [2019-11-07 01:14:10,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-07 01:14:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-07 01:14:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-07 01:14:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-11-07 01:14:10,620 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 87 [2019-11-07 01:14:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:10,620 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-11-07 01:14:10,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-11-07 01:14:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-07 01:14:10,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:10,622 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:10,622 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:10,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1081604216, now seen corresponding path program 1 times [2019-11-07 01:14:10,623 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:10,623 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33776062] [2019-11-07 01:14:10,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:14:10,715 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33776062] [2019-11-07 01:14:10,715 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:10,715 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:10,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788830627] [2019-11-07 01:14:10,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:10,716 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:10,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:10,716 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 5 states. [2019-11-07 01:14:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:10,958 INFO L93 Difference]: Finished difference Result 585 states and 981 transitions. [2019-11-07 01:14:10,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:10,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-07 01:14:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:10,961 INFO L225 Difference]: With dead ends: 585 [2019-11-07 01:14:10,962 INFO L226 Difference]: Without dead ends: 300 [2019-11-07 01:14:10,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-07 01:14:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-07 01:14:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-07 01:14:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 494 transitions. [2019-11-07 01:14:10,978 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 494 transitions. Word has length 88 [2019-11-07 01:14:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:10,978 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 494 transitions. [2019-11-07 01:14:10,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 494 transitions. [2019-11-07 01:14:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-07 01:14:10,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:10,980 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:10,981 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2001210697, now seen corresponding path program 1 times [2019-11-07 01:14:10,981 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:10,982 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010111178] [2019-11-07 01:14:10,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-07 01:14:11,082 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010111178] [2019-11-07 01:14:11,082 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:11,082 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:11,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823140100] [2019-11-07 01:14:11,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:11,083 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:11,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:11,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:11,084 INFO L87 Difference]: Start difference. First operand 298 states and 494 transitions. Second operand 5 states. [2019-11-07 01:14:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:11,444 INFO L93 Difference]: Finished difference Result 592 states and 983 transitions. [2019-11-07 01:14:11,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:11,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-11-07 01:14:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:11,447 INFO L225 Difference]: With dead ends: 592 [2019-11-07 01:14:11,447 INFO L226 Difference]: Without dead ends: 307 [2019-11-07 01:14:11,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-07 01:14:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-11-07 01:14:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-07 01:14:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 500 transitions. [2019-11-07 01:14:11,464 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 500 transitions. Word has length 100 [2019-11-07 01:14:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:11,464 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 500 transitions. [2019-11-07 01:14:11,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 500 transitions. [2019-11-07 01:14:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-07 01:14:11,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:11,466 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:11,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:11,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1192129085, now seen corresponding path program 1 times [2019-11-07 01:14:11,467 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:11,468 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152046593] [2019-11-07 01:14:11,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:14:11,546 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152046593] [2019-11-07 01:14:11,546 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:11,546 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:11,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145666470] [2019-11-07 01:14:11,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:11,547 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:11,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:11,548 INFO L87 Difference]: Start difference. First operand 307 states and 500 transitions. Second operand 5 states. [2019-11-07 01:14:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:11,750 INFO L93 Difference]: Finished difference Result 632 states and 1036 transitions. [2019-11-07 01:14:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:11,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-11-07 01:14:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:11,753 INFO L225 Difference]: With dead ends: 632 [2019-11-07 01:14:11,753 INFO L226 Difference]: Without dead ends: 338 [2019-11-07 01:14:11,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-07 01:14:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-07 01:14:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-07 01:14:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-11-07 01:14:11,770 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 101 [2019-11-07 01:14:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:11,770 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-11-07 01:14:11,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-11-07 01:14:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-07 01:14:11,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:11,772 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:11,772 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:11,773 INFO L82 PathProgramCache]: Analyzing trace with hash 775386699, now seen corresponding path program 1 times [2019-11-07 01:14:11,773 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:11,773 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603402555] [2019-11-07 01:14:11,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:14:11,867 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603402555] [2019-11-07 01:14:11,868 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:11,868 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:11,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460643788] [2019-11-07 01:14:11,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:11,869 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:11,870 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 5 states. [2019-11-07 01:14:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:12,162 INFO L93 Difference]: Finished difference Result 661 states and 1079 transitions. [2019-11-07 01:14:12,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:12,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-11-07 01:14:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:12,165 INFO L225 Difference]: With dead ends: 661 [2019-11-07 01:14:12,167 INFO L226 Difference]: Without dead ends: 338 [2019-11-07 01:14:12,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-07 01:14:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-07 01:14:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-07 01:14:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 543 transitions. [2019-11-07 01:14:12,187 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 543 transitions. Word has length 102 [2019-11-07 01:14:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:12,187 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 543 transitions. [2019-11-07 01:14:12,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 543 transitions. [2019-11-07 01:14:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-07 01:14:12,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:12,190 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:12,190 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:12,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:12,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1217428909, now seen corresponding path program 1 times [2019-11-07 01:14:12,191 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:12,191 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072722652] [2019-11-07 01:14:12,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:14:12,255 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072722652] [2019-11-07 01:14:12,255 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:12,256 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:12,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513144052] [2019-11-07 01:14:12,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:12,257 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:12,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:12,257 INFO L87 Difference]: Start difference. First operand 336 states and 543 transitions. Second operand 5 states. [2019-11-07 01:14:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:12,458 INFO L93 Difference]: Finished difference Result 694 states and 1129 transitions. [2019-11-07 01:14:12,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:12,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-11-07 01:14:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:12,461 INFO L225 Difference]: With dead ends: 694 [2019-11-07 01:14:12,461 INFO L226 Difference]: Without dead ends: 371 [2019-11-07 01:14:12,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-07 01:14:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-07 01:14:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-07 01:14:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 585 transitions. [2019-11-07 01:14:12,478 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 585 transitions. Word has length 103 [2019-11-07 01:14:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:12,478 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 585 transitions. [2019-11-07 01:14:12,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 585 transitions. [2019-11-07 01:14:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 01:14:12,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:12,481 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-07 01:14:12,481 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:12,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:12,481 INFO L82 PathProgramCache]: Analyzing trace with hash -141729733, now seen corresponding path program 1 times [2019-11-07 01:14:12,482 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:12,482 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422451300] [2019-11-07 01:14:12,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:14:12,539 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422451300] [2019-11-07 01:14:12,539 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:12,540 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:12,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199404829] [2019-11-07 01:14:12,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:12,541 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:12,541 INFO L87 Difference]: Start difference. First operand 363 states and 585 transitions. Second operand 5 states. [2019-11-07 01:14:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:12,835 INFO L93 Difference]: Finished difference Result 721 states and 1166 transitions. [2019-11-07 01:14:12,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:12,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-11-07 01:14:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:12,838 INFO L225 Difference]: With dead ends: 721 [2019-11-07 01:14:12,838 INFO L226 Difference]: Without dead ends: 371 [2019-11-07 01:14:12,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-07 01:14:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-07 01:14:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-07 01:14:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 580 transitions. [2019-11-07 01:14:12,856 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 580 transitions. Word has length 104 [2019-11-07 01:14:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:12,856 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 580 transitions. [2019-11-07 01:14:12,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 580 transitions. [2019-11-07 01:14:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-07 01:14:12,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:12,859 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:12,859 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:12,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:12,859 INFO L82 PathProgramCache]: Analyzing trace with hash -564771468, now seen corresponding path program 1 times [2019-11-07 01:14:12,860 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:12,860 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596558257] [2019-11-07 01:14:12,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-07 01:14:12,967 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596558257] [2019-11-07 01:14:12,967 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:12,967 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:12,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016819883] [2019-11-07 01:14:12,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:12,968 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:12,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:12,969 INFO L87 Difference]: Start difference. First operand 363 states and 580 transitions. Second operand 5 states. [2019-11-07 01:14:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:13,268 INFO L93 Difference]: Finished difference Result 749 states and 1201 transitions. [2019-11-07 01:14:13,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:13,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-11-07 01:14:13,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:13,271 INFO L225 Difference]: With dead ends: 749 [2019-11-07 01:14:13,272 INFO L226 Difference]: Without dead ends: 399 [2019-11-07 01:14:13,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-11-07 01:14:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-11-07 01:14:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-07 01:14:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 633 transitions. [2019-11-07 01:14:13,294 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 633 transitions. Word has length 111 [2019-11-07 01:14:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:13,294 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 633 transitions. [2019-11-07 01:14:13,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 633 transitions. [2019-11-07 01:14:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-07 01:14:13,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:13,297 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:13,297 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:13,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:13,298 INFO L82 PathProgramCache]: Analyzing trace with hash -285750569, now seen corresponding path program 1 times [2019-11-07 01:14:13,298 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:13,298 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409849673] [2019-11-07 01:14:13,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-07 01:14:13,362 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409849673] [2019-11-07 01:14:13,362 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:13,362 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:13,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867933873] [2019-11-07 01:14:13,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:13,363 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:13,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:13,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:13,364 INFO L87 Difference]: Start difference. First operand 397 states and 633 transitions. Second operand 5 states. [2019-11-07 01:14:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:13,579 INFO L93 Difference]: Finished difference Result 783 states and 1251 transitions. [2019-11-07 01:14:13,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:13,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-11-07 01:14:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:13,583 INFO L225 Difference]: With dead ends: 783 [2019-11-07 01:14:13,583 INFO L226 Difference]: Without dead ends: 399 [2019-11-07 01:14:13,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-11-07 01:14:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-11-07 01:14:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-07 01:14:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 630 transitions. [2019-11-07 01:14:13,602 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 630 transitions. Word has length 112 [2019-11-07 01:14:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:13,603 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 630 transitions. [2019-11-07 01:14:13,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 630 transitions. [2019-11-07 01:14:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-07 01:14:13,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:13,605 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:13,605 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:13,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1187170139, now seen corresponding path program 1 times [2019-11-07 01:14:13,606 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:13,606 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054871167] [2019-11-07 01:14:13,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:14:13,663 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054871167] [2019-11-07 01:14:13,664 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:13,664 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:13,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513733311] [2019-11-07 01:14:13,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:13,665 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:13,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:13,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:13,665 INFO L87 Difference]: Start difference. First operand 397 states and 630 transitions. Second operand 5 states. [2019-11-07 01:14:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:13,905 INFO L93 Difference]: Finished difference Result 828 states and 1317 transitions. [2019-11-07 01:14:13,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:13,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-11-07 01:14:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:13,908 INFO L225 Difference]: With dead ends: 828 [2019-11-07 01:14:13,908 INFO L226 Difference]: Without dead ends: 444 [2019-11-07 01:14:13,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-11-07 01:14:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 439. [2019-11-07 01:14:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-11-07 01:14:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 695 transitions. [2019-11-07 01:14:13,928 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 695 transitions. Word has length 117 [2019-11-07 01:14:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:13,928 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 695 transitions. [2019-11-07 01:14:13,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 695 transitions. [2019-11-07 01:14:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-07 01:14:13,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:13,930 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:13,930 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:13,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:13,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1861118978, now seen corresponding path program 1 times [2019-11-07 01:14:13,931 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:13,931 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670748461] [2019-11-07 01:14:13,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:14:13,984 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670748461] [2019-11-07 01:14:13,985 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:13,985 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:13,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261653418] [2019-11-07 01:14:13,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:13,986 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:13,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:13,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:13,986 INFO L87 Difference]: Start difference. First operand 439 states and 695 transitions. Second operand 5 states. [2019-11-07 01:14:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:14,199 INFO L93 Difference]: Finished difference Result 874 states and 1388 transitions. [2019-11-07 01:14:14,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:14,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-11-07 01:14:14,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:14,203 INFO L225 Difference]: With dead ends: 874 [2019-11-07 01:14:14,203 INFO L226 Difference]: Without dead ends: 446 [2019-11-07 01:14:14,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-07 01:14:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2019-11-07 01:14:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-07 01:14:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 698 transitions. [2019-11-07 01:14:14,226 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 698 transitions. Word has length 118 [2019-11-07 01:14:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:14,226 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 698 transitions. [2019-11-07 01:14:14,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 698 transitions. [2019-11-07 01:14:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-07 01:14:14,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:14,229 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:14,229 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:14,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash 385795336, now seen corresponding path program 1 times [2019-11-07 01:14:14,229 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:14,230 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350373702] [2019-11-07 01:14:14,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-07 01:14:14,316 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350373702] [2019-11-07 01:14:14,316 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:14,316 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:14,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158208876] [2019-11-07 01:14:14,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:14,317 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:14,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:14,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:14,317 INFO L87 Difference]: Start difference. First operand 441 states and 698 transitions. Second operand 5 states. [2019-11-07 01:14:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:14,555 INFO L93 Difference]: Finished difference Result 907 states and 1443 transitions. [2019-11-07 01:14:14,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:14,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-11-07 01:14:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:14,559 INFO L225 Difference]: With dead ends: 907 [2019-11-07 01:14:14,559 INFO L226 Difference]: Without dead ends: 479 [2019-11-07 01:14:14,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-07 01:14:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-11-07 01:14:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-07 01:14:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 733 transitions. [2019-11-07 01:14:14,580 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 733 transitions. Word has length 129 [2019-11-07 01:14:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:14,581 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 733 transitions. [2019-11-07 01:14:14,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 733 transitions. [2019-11-07 01:14:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-07 01:14:14,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:14,596 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:14,596 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash -177817520, now seen corresponding path program 1 times [2019-11-07 01:14:14,597 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:14,597 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416097934] [2019-11-07 01:14:14,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-07 01:14:14,655 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416097934] [2019-11-07 01:14:14,655 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:14,655 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:14,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069827994] [2019-11-07 01:14:14,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:14,656 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:14,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:14,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:14,657 INFO L87 Difference]: Start difference. First operand 466 states and 733 transitions. Second operand 5 states. [2019-11-07 01:14:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:14,897 INFO L93 Difference]: Finished difference Result 932 states and 1470 transitions. [2019-11-07 01:14:14,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:14,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-11-07 01:14:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:14,902 INFO L225 Difference]: With dead ends: 932 [2019-11-07 01:14:14,903 INFO L226 Difference]: Without dead ends: 479 [2019-11-07 01:14:14,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-07 01:14:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-11-07 01:14:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-07 01:14:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 725 transitions. [2019-11-07 01:14:14,937 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 725 transitions. Word has length 130 [2019-11-07 01:14:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:14,937 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 725 transitions. [2019-11-07 01:14:14,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 725 transitions. [2019-11-07 01:14:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-07 01:14:14,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:14,941 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-07 01:14:14,941 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash 755280415, now seen corresponding path program 1 times [2019-11-07 01:14:14,942 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:14,942 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909873095] [2019-11-07 01:14:14,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-07 01:14:15,028 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909873095] [2019-11-07 01:14:15,029 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:15,029 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:15,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335046729] [2019-11-07 01:14:15,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:15,030 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:15,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:15,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:15,031 INFO L87 Difference]: Start difference. First operand 466 states and 725 transitions. Second operand 5 states. [2019-11-07 01:14:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:15,291 INFO L93 Difference]: Finished difference Result 923 states and 1438 transitions. [2019-11-07 01:14:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:15,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-11-07 01:14:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:15,295 INFO L225 Difference]: With dead ends: 923 [2019-11-07 01:14:15,295 INFO L226 Difference]: Without dead ends: 470 [2019-11-07 01:14:15,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-07 01:14:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-11-07 01:14:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-07 01:14:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 720 transitions. [2019-11-07 01:14:15,326 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 720 transitions. Word has length 142 [2019-11-07 01:14:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:15,327 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 720 transitions. [2019-11-07 01:14:15,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 720 transitions. [2019-11-07 01:14:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 01:14:15,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:15,331 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-07 01:14:15,332 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash -816490564, now seen corresponding path program 1 times [2019-11-07 01:14:15,333 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:15,333 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400902553] [2019-11-07 01:14:15,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-07 01:14:15,418 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400902553] [2019-11-07 01:14:15,418 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:15,418 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:15,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895719063] [2019-11-07 01:14:15,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:15,420 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:15,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:15,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:15,421 INFO L87 Difference]: Start difference. First operand 466 states and 720 transitions. Second operand 5 states. [2019-11-07 01:14:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:15,646 INFO L93 Difference]: Finished difference Result 923 states and 1428 transitions. [2019-11-07 01:14:15,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:15,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-11-07 01:14:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:15,649 INFO L225 Difference]: With dead ends: 923 [2019-11-07 01:14:15,650 INFO L226 Difference]: Without dead ends: 470 [2019-11-07 01:14:15,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-07 01:14:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-11-07 01:14:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-07 01:14:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 715 transitions. [2019-11-07 01:14:15,673 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 715 transitions. Word has length 143 [2019-11-07 01:14:15,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:15,673 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 715 transitions. [2019-11-07 01:14:15,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 715 transitions. [2019-11-07 01:14:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-07 01:14:15,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:15,676 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:15,676 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1136592958, now seen corresponding path program 1 times [2019-11-07 01:14:15,677 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:15,677 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9831717] [2019-11-07 01:14:15,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-07 01:14:15,746 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9831717] [2019-11-07 01:14:15,746 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:15,746 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:15,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670588519] [2019-11-07 01:14:15,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:15,748 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:15,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:15,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:15,754 INFO L87 Difference]: Start difference. First operand 466 states and 715 transitions. Second operand 5 states. [2019-11-07 01:14:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:15,952 INFO L93 Difference]: Finished difference Result 947 states and 1458 transitions. [2019-11-07 01:14:15,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:15,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-11-07 01:14:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:15,955 INFO L225 Difference]: With dead ends: 947 [2019-11-07 01:14:15,956 INFO L226 Difference]: Without dead ends: 494 [2019-11-07 01:14:15,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-11-07 01:14:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-11-07 01:14:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-11-07 01:14:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 746 transitions. [2019-11-07 01:14:15,986 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 746 transitions. Word has length 150 [2019-11-07 01:14:15,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:15,986 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 746 transitions. [2019-11-07 01:14:15,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 746 transitions. [2019-11-07 01:14:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:14:15,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:15,989 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:15,989 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:15,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1424495078, now seen corresponding path program 1 times [2019-11-07 01:14:15,990 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:15,990 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911276241] [2019-11-07 01:14:15,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-07 01:14:16,049 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911276241] [2019-11-07 01:14:16,050 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:16,050 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:16,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122389459] [2019-11-07 01:14:16,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:16,051 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:16,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:16,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:16,051 INFO L87 Difference]: Start difference. First operand 490 states and 746 transitions. Second operand 5 states. [2019-11-07 01:14:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:16,318 INFO L93 Difference]: Finished difference Result 971 states and 1480 transitions. [2019-11-07 01:14:16,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:16,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-11-07 01:14:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:16,325 INFO L225 Difference]: With dead ends: 971 [2019-11-07 01:14:16,326 INFO L226 Difference]: Without dead ends: 494 [2019-11-07 01:14:16,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-11-07 01:14:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-11-07 01:14:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-11-07 01:14:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 737 transitions. [2019-11-07 01:14:16,376 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 737 transitions. Word has length 151 [2019-11-07 01:14:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:16,376 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 737 transitions. [2019-11-07 01:14:16,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 737 transitions. [2019-11-07 01:14:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:14:16,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:16,379 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:16,379 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:16,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash 311984194, now seen corresponding path program 1 times [2019-11-07 01:14:16,380 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:16,380 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661676955] [2019-11-07 01:14:16,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-07 01:14:16,470 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661676955] [2019-11-07 01:14:16,470 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:16,471 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:16,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934738722] [2019-11-07 01:14:16,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:16,472 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:16,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:16,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:16,472 INFO L87 Difference]: Start difference. First operand 490 states and 737 transitions. Second operand 5 states. [2019-11-07 01:14:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:16,739 INFO L93 Difference]: Finished difference Result 1014 states and 1523 transitions. [2019-11-07 01:14:16,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:16,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-11-07 01:14:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:16,743 INFO L225 Difference]: With dead ends: 1014 [2019-11-07 01:14:16,743 INFO L226 Difference]: Without dead ends: 537 [2019-11-07 01:14:16,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-11-07 01:14:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2019-11-07 01:14:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-11-07 01:14:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 792 transitions. [2019-11-07 01:14:16,781 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 792 transitions. Word has length 157 [2019-11-07 01:14:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:16,781 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 792 transitions. [2019-11-07 01:14:16,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 792 transitions. [2019-11-07 01:14:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:14:16,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:16,784 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:16,784 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:16,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:16,785 INFO L82 PathProgramCache]: Analyzing trace with hash -611548539, now seen corresponding path program 1 times [2019-11-07 01:14:16,785 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:16,785 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629504038] [2019-11-07 01:14:16,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-07 01:14:16,856 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629504038] [2019-11-07 01:14:16,856 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:16,856 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:16,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092144110] [2019-11-07 01:14:16,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:16,857 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:16,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:16,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:16,858 INFO L87 Difference]: Start difference. First operand 531 states and 792 transitions. Second operand 5 states. [2019-11-07 01:14:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:17,093 INFO L93 Difference]: Finished difference Result 1055 states and 1576 transitions. [2019-11-07 01:14:17,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:17,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-11-07 01:14:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:17,097 INFO L225 Difference]: With dead ends: 1055 [2019-11-07 01:14:17,097 INFO L226 Difference]: Without dead ends: 518 [2019-11-07 01:14:17,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-11-07 01:14:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-11-07 01:14:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-07 01:14:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 762 transitions. [2019-11-07 01:14:17,128 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 762 transitions. Word has length 158 [2019-11-07 01:14:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:17,129 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 762 transitions. [2019-11-07 01:14:17,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 762 transitions. [2019-11-07 01:14:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-07 01:14:17,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:17,133 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:17,133 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1831676618, now seen corresponding path program 1 times [2019-11-07 01:14:17,134 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:17,134 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058021414] [2019-11-07 01:14:17,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-11-07 01:14:17,242 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058021414] [2019-11-07 01:14:17,243 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:17,243 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:17,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428937459] [2019-11-07 01:14:17,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:17,244 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:17,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:17,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:17,245 INFO L87 Difference]: Start difference. First operand 512 states and 762 transitions. Second operand 5 states. [2019-11-07 01:14:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:17,455 INFO L93 Difference]: Finished difference Result 1036 states and 1548 transitions. [2019-11-07 01:14:17,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:17,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-11-07 01:14:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:17,460 INFO L225 Difference]: With dead ends: 1036 [2019-11-07 01:14:17,460 INFO L226 Difference]: Without dead ends: 537 [2019-11-07 01:14:17,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-11-07 01:14:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2019-11-07 01:14:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-11-07 01:14:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 786 transitions. [2019-11-07 01:14:17,499 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 786 transitions. Word has length 171 [2019-11-07 01:14:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:17,500 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 786 transitions. [2019-11-07 01:14:17,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 786 transitions. [2019-11-07 01:14:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-07 01:14:17,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:17,503 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:17,503 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash -813103810, now seen corresponding path program 1 times [2019-11-07 01:14:17,504 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:17,504 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617430942] [2019-11-07 01:14:17,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-11-07 01:14:17,578 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617430942] [2019-11-07 01:14:17,579 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:17,579 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:17,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827178128] [2019-11-07 01:14:17,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:17,580 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:17,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:17,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:17,581 INFO L87 Difference]: Start difference. First operand 533 states and 786 transitions. Second operand 5 states. [2019-11-07 01:14:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:17,830 INFO L93 Difference]: Finished difference Result 1057 states and 1561 transitions. [2019-11-07 01:14:17,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:17,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-11-07 01:14:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:17,834 INFO L225 Difference]: With dead ends: 1057 [2019-11-07 01:14:17,834 INFO L226 Difference]: Without dead ends: 535 [2019-11-07 01:14:17,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-11-07 01:14:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2019-11-07 01:14:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-11-07 01:14:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 772 transitions. [2019-11-07 01:14:17,865 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 772 transitions. Word has length 172 [2019-11-07 01:14:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:17,865 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 772 transitions. [2019-11-07 01:14:17,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 772 transitions. [2019-11-07 01:14:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-07 01:14:17,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:17,869 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:17,869 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:17,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:17,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1628821973, now seen corresponding path program 1 times [2019-11-07 01:14:17,870 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:17,870 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428545549] [2019-11-07 01:14:17,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-07 01:14:17,946 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428545549] [2019-11-07 01:14:17,946 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624041576] [2019-11-07 01:14:17,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:18,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:14:18,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-11-07 01:14:18,175 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-11-07 01:14:18,239 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:14:18,240 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-07 01:14:18,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451721247] [2019-11-07 01:14:18,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:14:18,241 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:18,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:14:18,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:18,242 INFO L87 Difference]: Start difference. First operand 531 states and 772 transitions. Second operand 4 states. [2019-11-07 01:14:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:18,439 INFO L93 Difference]: Finished difference Result 2081 states and 3035 transitions. [2019-11-07 01:14:18,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:14:18,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-07 01:14:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:18,450 INFO L225 Difference]: With dead ends: 2081 [2019-11-07 01:14:18,450 INFO L226 Difference]: Without dead ends: 1563 [2019-11-07 01:14:18,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-11-07 01:14:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2019-11-07 01:14:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-11-07 01:14:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2271 transitions. [2019-11-07 01:14:18,554 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2271 transitions. Word has length 187 [2019-11-07 01:14:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:18,554 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 2271 transitions. [2019-11-07 01:14:18,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:14:18,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2271 transitions. [2019-11-07 01:14:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-07 01:14:18,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:18,559 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:18,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:18,764 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:18,764 INFO L82 PathProgramCache]: Analyzing trace with hash -304112884, now seen corresponding path program 1 times [2019-11-07 01:14:18,765 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:18,765 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507035803] [2019-11-07 01:14:18,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-07 01:14:18,872 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507035803] [2019-11-07 01:14:18,872 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:18,872 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:18,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032468960] [2019-11-07 01:14:18,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:18,874 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:18,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:18,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:18,875 INFO L87 Difference]: Start difference. First operand 1563 states and 2271 transitions. Second operand 3 states. [2019-11-07 01:14:19,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:19,078 INFO L93 Difference]: Finished difference Result 3624 states and 5270 transitions. [2019-11-07 01:14:19,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:19,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-11-07 01:14:19,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:19,089 INFO L225 Difference]: With dead ends: 3624 [2019-11-07 01:14:19,089 INFO L226 Difference]: Without dead ends: 2074 [2019-11-07 01:14:19,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2019-11-07 01:14:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2019-11-07 01:14:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-11-07 01:14:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3008 transitions. [2019-11-07 01:14:19,205 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3008 transitions. Word has length 196 [2019-11-07 01:14:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:19,206 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 3008 transitions. [2019-11-07 01:14:19,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3008 transitions. [2019-11-07 01:14:19,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-07 01:14:19,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:19,216 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:19,216 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:19,216 INFO L82 PathProgramCache]: Analyzing trace with hash 779902296, now seen corresponding path program 1 times [2019-11-07 01:14:19,217 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:19,217 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560138194] [2019-11-07 01:14:19,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 468 proven. 26 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-07 01:14:19,334 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560138194] [2019-11-07 01:14:19,334 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966365551] [2019-11-07 01:14:19,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:19,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:14:19,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-07 01:14:19,576 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-07 01:14:19,637 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:14:19,637 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-07 01:14:19,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117719300] [2019-11-07 01:14:19,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:14:19,641 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:19,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:14:19,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:19,641 INFO L87 Difference]: Start difference. First operand 2074 states and 3008 transitions. Second operand 4 states. [2019-11-07 01:14:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:19,847 INFO L93 Difference]: Finished difference Result 5167 states and 7505 transitions. [2019-11-07 01:14:19,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:14:19,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-11-07 01:14:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:19,864 INFO L225 Difference]: With dead ends: 5167 [2019-11-07 01:14:19,864 INFO L226 Difference]: Without dead ends: 3106 [2019-11-07 01:14:19,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2019-11-07 01:14:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3106. [2019-11-07 01:14:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3106 states. [2019-11-07 01:14:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4508 transitions. [2019-11-07 01:14:20,060 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4508 transitions. Word has length 266 [2019-11-07 01:14:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:20,061 INFO L462 AbstractCegarLoop]: Abstraction has 3106 states and 4508 transitions. [2019-11-07 01:14:20,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:14:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4508 transitions. [2019-11-07 01:14:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-11-07 01:14:20,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:20,077 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:20,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:20,291 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:20,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1979389122, now seen corresponding path program 1 times [2019-11-07 01:14:20,292 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:20,292 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828470565] [2019-11-07 01:14:20,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-07 01:14:20,598 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828470565] [2019-11-07 01:14:20,598 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:20,599 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:20,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801089719] [2019-11-07 01:14:20,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:20,601 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:20,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:20,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:20,603 INFO L87 Difference]: Start difference. First operand 3106 states and 4508 transitions. Second operand 3 states. [2019-11-07 01:14:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:20,951 INFO L93 Difference]: Finished difference Result 8796 states and 12757 transitions. [2019-11-07 01:14:20,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:20,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-11-07 01:14:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:20,980 INFO L225 Difference]: With dead ends: 8796 [2019-11-07 01:14:20,981 INFO L226 Difference]: Without dead ends: 5703 [2019-11-07 01:14:20,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2019-11-07 01:14:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5701. [2019-11-07 01:14:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5701 states. [2019-11-07 01:14:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 8249 transitions. [2019-11-07 01:14:21,315 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 8249 transitions. Word has length 346 [2019-11-07 01:14:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:21,316 INFO L462 AbstractCegarLoop]: Abstraction has 5701 states and 8249 transitions. [2019-11-07 01:14:21,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 8249 transitions. [2019-11-07 01:14:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-11-07 01:14:21,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:21,331 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:21,331 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1101052781, now seen corresponding path program 1 times [2019-11-07 01:14:21,336 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:21,337 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607399039] [2019-11-07 01:14:21,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-11-07 01:14:21,463 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607399039] [2019-11-07 01:14:21,465 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:21,465 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:21,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669027263] [2019-11-07 01:14:21,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:21,470 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:21,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:21,470 INFO L87 Difference]: Start difference. First operand 5701 states and 8249 transitions. Second operand 3 states. [2019-11-07 01:14:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:21,937 INFO L93 Difference]: Finished difference Result 11629 states and 16865 transitions. [2019-11-07 01:14:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:21,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2019-11-07 01:14:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:21,968 INFO L225 Difference]: With dead ends: 11629 [2019-11-07 01:14:21,969 INFO L226 Difference]: Without dead ends: 4505 [2019-11-07 01:14:21,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2019-11-07 01:14:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 4465. [2019-11-07 01:14:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4465 states. [2019-11-07 01:14:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 6358 transitions. [2019-11-07 01:14:22,201 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 6358 transitions. Word has length 383 [2019-11-07 01:14:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:22,201 INFO L462 AbstractCegarLoop]: Abstraction has 4465 states and 6358 transitions. [2019-11-07 01:14:22,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 6358 transitions. [2019-11-07 01:14:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-11-07 01:14:22,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:22,219 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:22,221 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:22,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1869824397, now seen corresponding path program 1 times [2019-11-07 01:14:22,223 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:22,223 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487459853] [2019-11-07 01:14:22,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-11-07 01:14:22,447 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487459853] [2019-11-07 01:14:22,447 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295481549] [2019-11-07 01:14:22,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:22,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:14:22,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-11-07 01:14:22,804 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-11-07 01:14:23,117 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:14:23,118 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:14:23,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668472369] [2019-11-07 01:14:23,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:23,121 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:23,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:23,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:23,122 INFO L87 Difference]: Start difference. First operand 4465 states and 6358 transitions. Second operand 3 states. [2019-11-07 01:14:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:23,245 INFO L93 Difference]: Finished difference Result 4525 states and 6444 transitions. [2019-11-07 01:14:23,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:23,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2019-11-07 01:14:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:23,254 INFO L225 Difference]: With dead ends: 4525 [2019-11-07 01:14:23,254 INFO L226 Difference]: Without dead ends: 3146 [2019-11-07 01:14:23,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2019-11-07 01:14:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 3088. [2019-11-07 01:14:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3088 states. [2019-11-07 01:14:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 4395 transitions. [2019-11-07 01:14:23,411 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 4395 transitions. Word has length 449 [2019-11-07 01:14:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:23,412 INFO L462 AbstractCegarLoop]: Abstraction has 3088 states and 4395 transitions. [2019-11-07 01:14:23,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 4395 transitions. [2019-11-07 01:14:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-11-07 01:14:23,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:23,433 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:23,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:23,649 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash -915884239, now seen corresponding path program 1 times [2019-11-07 01:14:23,650 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:23,650 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708103837] [2019-11-07 01:14:23,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-11-07 01:14:23,848 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708103837] [2019-11-07 01:14:23,848 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858729618] [2019-11-07 01:14:23,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:24,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:14:24,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-11-07 01:14:24,256 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-11-07 01:14:24,508 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:14:24,509 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:14:24,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598633600] [2019-11-07 01:14:24,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:24,510 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:24,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:24,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:24,511 INFO L87 Difference]: Start difference. First operand 3088 states and 4395 transitions. Second operand 3 states. [2019-11-07 01:14:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:24,789 INFO L93 Difference]: Finished difference Result 6631 states and 9448 transitions. [2019-11-07 01:14:24,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:24,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2019-11-07 01:14:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:24,802 INFO L225 Difference]: With dead ends: 6631 [2019-11-07 01:14:24,802 INFO L226 Difference]: Without dead ends: 3556 [2019-11-07 01:14:24,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2019-11-07 01:14:25,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 3556. [2019-11-07 01:14:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3556 states. [2019-11-07 01:14:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 5062 transitions. [2019-11-07 01:14:25,037 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 5062 transitions. Word has length 449 [2019-11-07 01:14:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:25,038 INFO L462 AbstractCegarLoop]: Abstraction has 3556 states and 5062 transitions. [2019-11-07 01:14:25,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 5062 transitions. [2019-11-07 01:14:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-11-07 01:14:25,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:25,076 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:25,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:25,282 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1287293752, now seen corresponding path program 1 times [2019-11-07 01:14:25,283 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:25,283 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089612932] [2019-11-07 01:14:25,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1629 proven. 26 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2019-11-07 01:14:25,543 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089612932] [2019-11-07 01:14:25,544 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244009880] [2019-11-07 01:14:25,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:25,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:14:25,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1679 proven. 0 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2019-11-07 01:14:25,893 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1679 proven. 0 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2019-11-07 01:14:26,031 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:14:26,031 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:14:26,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782243642] [2019-11-07 01:14:26,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:26,033 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:26,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:26,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:26,033 INFO L87 Difference]: Start difference. First operand 3556 states and 5062 transitions. Second operand 3 states. [2019-11-07 01:14:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:26,250 INFO L93 Difference]: Finished difference Result 7612 states and 10840 transitions. [2019-11-07 01:14:26,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:26,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 561 [2019-11-07 01:14:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:26,259 INFO L225 Difference]: With dead ends: 7612 [2019-11-07 01:14:26,259 INFO L226 Difference]: Without dead ends: 4069 [2019-11-07 01:14:26,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 1121 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2019-11-07 01:14:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 4069. [2019-11-07 01:14:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-11-07 01:14:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 5794 transitions. [2019-11-07 01:14:26,429 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 5794 transitions. Word has length 561 [2019-11-07 01:14:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:26,430 INFO L462 AbstractCegarLoop]: Abstraction has 4069 states and 5794 transitions. [2019-11-07 01:14:26,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 5794 transitions. [2019-11-07 01:14:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-11-07 01:14:26,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:26,443 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:26,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:26,649 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:26,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1109132628, now seen corresponding path program 1 times [2019-11-07 01:14:26,649 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:26,649 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185260411] [2019-11-07 01:14:26,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-11-07 01:14:26,949 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185260411] [2019-11-07 01:14:26,949 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620232151] [2019-11-07 01:14:26,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:27,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:14:27,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-11-07 01:14:27,454 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-11-07 01:14:27,669 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [990818920] [2019-11-07 01:14:27,674 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 601 [2019-11-07 01:14:27,741 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:14:27,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:14:27,990 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:14:29,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:14:29,586 INFO L272 AbstractInterpreter]: Visited 109 different actions 2392 times. Merged at 95 different actions 1937 times. Widened at 18 different actions 293 times. Performed 5536 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5536 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 319 fixpoints after 32 different actions. Largest state had 97 variables. [2019-11-07 01:14:29,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:29,593 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:14:29,593 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:14:29,593 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:14:29,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468979109] [2019-11-07 01:14:29,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:14:29,595 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:29,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:14:29,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:29,596 INFO L87 Difference]: Start difference. First operand 4069 states and 5794 transitions. Second operand 6 states. [2019-11-07 01:14:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:30,149 INFO L93 Difference]: Finished difference Result 8211 states and 11666 transitions. [2019-11-07 01:14:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:14:30,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 600 [2019-11-07 01:14:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:30,161 INFO L225 Difference]: With dead ends: 8211 [2019-11-07 01:14:30,162 INFO L226 Difference]: Without dead ends: 4067 [2019-11-07 01:14:30,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1207 GetRequests, 1201 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:14:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2019-11-07 01:14:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3780. [2019-11-07 01:14:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-11-07 01:14:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5132 transitions. [2019-11-07 01:14:30,428 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5132 transitions. Word has length 600 [2019-11-07 01:14:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:30,429 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 5132 transitions. [2019-11-07 01:14:30,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:14:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5132 transitions. [2019-11-07 01:14:30,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2019-11-07 01:14:30,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:30,446 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:30,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:30,652 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:30,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash 859855159, now seen corresponding path program 1 times [2019-11-07 01:14:30,653 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:30,653 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351384177] [2019-11-07 01:14:30,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-11-07 01:14:31,794 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351384177] [2019-11-07 01:14:31,794 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832963258] [2019-11-07 01:14:31,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:32,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:14:32,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-11-07 01:14:32,586 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-11-07 01:14:33,070 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [156039915] [2019-11-07 01:14:33,071 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 1021 [2019-11-07 01:14:33,077 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:14:33,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:14:33,147 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:14:34,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:14:34,699 INFO L272 AbstractInterpreter]: Visited 121 different actions 2696 times. Merged at 104 different actions 2127 times. Widened at 22 different actions 342 times. Performed 6485 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6485 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 401 fixpoints after 28 different actions. Largest state had 101 variables. [2019-11-07 01:14:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:34,700 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:14:34,700 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:14:34,701 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:14:34,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176005972] [2019-11-07 01:14:34,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:14:34,703 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:34,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:14:34,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:34,703 INFO L87 Difference]: Start difference. First operand 3780 states and 5132 transitions. Second operand 6 states. [2019-11-07 01:14:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:35,387 INFO L93 Difference]: Finished difference Result 11228 states and 15494 transitions. [2019-11-07 01:14:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:14:35,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1020 [2019-11-07 01:14:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:35,403 INFO L225 Difference]: With dead ends: 11228 [2019-11-07 01:14:35,403 INFO L226 Difference]: Without dead ends: 7183 [2019-11-07 01:14:35,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2049 GetRequests, 2042 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:14:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2019-11-07 01:14:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 4292. [2019-11-07 01:14:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-11-07 01:14:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 5908 transitions. [2019-11-07 01:14:35,695 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 5908 transitions. Word has length 1020 [2019-11-07 01:14:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:35,696 INFO L462 AbstractCegarLoop]: Abstraction has 4292 states and 5908 transitions. [2019-11-07 01:14:35,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:14:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 5908 transitions. [2019-11-07 01:14:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1314 [2019-11-07 01:14:35,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:35,717 INFO L410 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 44, 44, 41, 41, 41, 37, 37, 33, 33, 29, 29, 25, 25, 25, 25, 21, 17, 17, 13, 13, 9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-07 01:14:35,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:35,925 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1929452856, now seen corresponding path program 1 times [2019-11-07 01:14:35,926 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:35,926 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825431189] [2019-11-07 01:14:35,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat