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_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:29:01,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:29:01,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:29:01,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:29:01,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:29:01,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:29:01,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:29:01,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:29:01,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:29:01,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:29:01,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:29:01,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:29:01,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:29:01,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:29:01,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:29:01,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:29:01,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:29:01,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:29:01,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:29:01,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:29:01,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:29:01,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:29:01,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:29:01,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:29:01,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:29:01,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:29:01,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:29:01,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:29:01,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:29:01,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:29:01,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:29:01,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:29:01,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:29:01,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:29:01,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:29:01,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:29:01,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:29:01,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:29:01,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:29:01,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:29:01,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:29:01,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:29:01,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:29:01,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:29:01,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:29:01,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:29:01,451 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:29:01,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:29:01,451 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:29:01,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:29:01,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:29:01,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:29:01,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:29:01,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:29:01,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:29:01,453 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:29:01,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:29:01,453 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:29:01,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:29:01,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:29:01,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:29:01,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:29:01,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:29:01,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:01,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:29:01,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:29:01,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:29:01,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:29:01,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:29:01,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:29:01,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:29:01,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:29:01,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:29:01,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:29:01,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:29:01,821 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:29:01,822 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-10-13 21:29:01,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c897c0a78/e3d7062f404a4f78be6a4780e081f77e/FLAGb522472a8 [2019-10-13 21:29:02,397 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:29:02,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-10-13 21:29:02,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c897c0a78/e3d7062f404a4f78be6a4780e081f77e/FLAGb522472a8 [2019-10-13 21:29:02,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c897c0a78/e3d7062f404a4f78be6a4780e081f77e [2019-10-13 21:29:02,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:29:02,744 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:29:02,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:02,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:29:02,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:29:02,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:02" (1/1) ... [2019-10-13 21:29:02,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2cd399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:02, skipping insertion in model container [2019-10-13 21:29:02,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:02" (1/1) ... [2019-10-13 21:29:02,761 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:29:02,823 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:29:03,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:03,111 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:29:03,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:03,299 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:29:03,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:03 WrapperNode [2019-10-13 21:29:03,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:03,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:29:03,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:29:03,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:29:03,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:03" (1/1) ... [2019-10-13 21:29:03,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:03" (1/1) ... [2019-10-13 21:29:03,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:03" (1/1) ... [2019-10-13 21:29:03,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:03" (1/1) ... [2019-10-13 21:29:03,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:03" (1/1) ... [2019-10-13 21:29:03,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:03" (1/1) ... [2019-10-13 21:29:03,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:03" (1/1) ... [2019-10-13 21:29:03,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:29:03,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:29:03,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:29:03,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:29:03,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:29:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:29:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 21:29:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:29:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:29:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:29:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:29:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 21:29:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 21:29:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 21:29:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:29:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:29:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:29:03,709 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:29:04,326 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 21:29:04,327 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 21:29:04,329 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:29:04,330 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:29:04,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:04 BoogieIcfgContainer [2019-10-13 21:29:04,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:29:04,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:29:04,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:29:04,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:29:04,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:29:02" (1/3) ... [2019-10-13 21:29:04,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b664fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:04, skipping insertion in model container [2019-10-13 21:29:04,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:03" (2/3) ... [2019-10-13 21:29:04,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b664fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:04, skipping insertion in model container [2019-10-13 21:29:04,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:04" (3/3) ... [2019-10-13 21:29:04,340 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2019-10-13 21:29:04,350 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:29:04,359 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:29:04,370 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:29:04,397 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:29:04,398 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:29:04,398 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:29:04,398 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:29:04,398 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:29:04,398 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:29:04,399 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:29:04,399 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:29:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-13 21:29:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 21:29:04,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:04,436 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:04,438 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-10-13 21:29:04,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:04,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646960249] [2019-10-13 21:29:04,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:04,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:04,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:04,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646960249] [2019-10-13 21:29:04,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:04,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:04,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860354294] [2019-10-13 21:29:04,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:04,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:04,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:04,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:04,770 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-13 21:29:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:05,210 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-13 21:29:05,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:05,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-13 21:29:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:05,228 INFO L225 Difference]: With dead ends: 337 [2019-10-13 21:29:05,228 INFO L226 Difference]: Without dead ends: 180 [2019-10-13 21:29:05,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-13 21:29:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-13 21:29:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 21:29:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-13 21:29:05,329 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-13 21:29:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:05,330 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-13 21:29:05,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-13 21:29:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 21:29:05,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:05,338 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:05,338 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:05,340 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-10-13 21:29:05,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:05,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726690388] [2019-10-13 21:29:05,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:05,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:05,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:05,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726690388] [2019-10-13 21:29:05,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:05,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:05,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826516682] [2019-10-13 21:29:05,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:05,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:05,549 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-13 21:29:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:05,884 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-13 21:29:05,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:05,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-13 21:29:05,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:05,890 INFO L225 Difference]: With dead ends: 385 [2019-10-13 21:29:05,891 INFO L226 Difference]: Without dead ends: 221 [2019-10-13 21:29:05,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-13 21:29:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-13 21:29:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-13 21:29:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-13 21:29:05,940 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-13 21:29:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:05,943 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-13 21:29:05,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-13 21:29:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:29:05,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:05,951 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:05,951 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:05,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:05,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1550770299, now seen corresponding path program 1 times [2019-10-13 21:29:05,952 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:05,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398419896] [2019-10-13 21:29:05,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:05,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:05,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:06,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398419896] [2019-10-13 21:29:06,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:06,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:06,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225877857] [2019-10-13 21:29:06,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:06,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:06,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:06,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:06,132 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-13 21:29:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:06,402 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-13 21:29:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:06,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-13 21:29:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:06,405 INFO L225 Difference]: With dead ends: 450 [2019-10-13 21:29:06,406 INFO L226 Difference]: Without dead ends: 247 [2019-10-13 21:29:06,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-13 21:29:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-13 21:29:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-13 21:29:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-13 21:29:06,425 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-13 21:29:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:06,425 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-13 21:29:06,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-13 21:29:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:29:06,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:06,433 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:06,433 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:06,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:06,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1202289061, now seen corresponding path program 1 times [2019-10-13 21:29:06,434 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:06,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895005356] [2019-10-13 21:29:06,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:06,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:06,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:06,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895005356] [2019-10-13 21:29:06,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:06,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:06,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455574568] [2019-10-13 21:29:06,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:06,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:06,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:06,567 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-13 21:29:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:06,776 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-13 21:29:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:06,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 21:29:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:06,779 INFO L225 Difference]: With dead ends: 498 [2019-10-13 21:29:06,779 INFO L226 Difference]: Without dead ends: 264 [2019-10-13 21:29:06,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-13 21:29:06,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-13 21:29:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-13 21:29:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-13 21:29:06,795 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-13 21:29:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:06,795 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-13 21:29:06,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-13 21:29:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:29:06,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:06,798 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:06,798 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:06,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1597952639, now seen corresponding path program 1 times [2019-10-13 21:29:06,799 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:06,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759969458] [2019-10-13 21:29:06,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:06,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:06,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:06,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759969458] [2019-10-13 21:29:06,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:06,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:06,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749561452] [2019-10-13 21:29:06,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:06,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:06,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:06,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:06,893 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-13 21:29:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:07,157 INFO L93 Difference]: Finished difference Result 558 states and 938 transitions. [2019-10-13 21:29:07,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:07,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 21:29:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:07,160 INFO L225 Difference]: With dead ends: 558 [2019-10-13 21:29:07,160 INFO L226 Difference]: Without dead ends: 309 [2019-10-13 21:29:07,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-13 21:29:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2019-10-13 21:29:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 21:29:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-13 21:29:07,176 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-13 21:29:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:07,177 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-13 21:29:07,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-13 21:29:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:29:07,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:07,179 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:07,179 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:07,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2044645757, now seen corresponding path program 1 times [2019-10-13 21:29:07,180 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:07,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908298648] [2019-10-13 21:29:07,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:07,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908298648] [2019-10-13 21:29:07,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:07,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:07,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668027867] [2019-10-13 21:29:07,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:07,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:07,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:07,238 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-13 21:29:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:07,427 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-13 21:29:07,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:07,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 21:29:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:07,429 INFO L225 Difference]: With dead ends: 597 [2019-10-13 21:29:07,429 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 21:29:07,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 21:29:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-13 21:29:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 21:29:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-13 21:29:07,444 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-13 21:29:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:07,444 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-13 21:29:07,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-13 21:29:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:29:07,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:07,446 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:07,447 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash -176213692, now seen corresponding path program 1 times [2019-10-13 21:29:07,447 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:07,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137167304] [2019-10-13 21:29:07,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:07,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137167304] [2019-10-13 21:29:07,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:07,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:07,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237005580] [2019-10-13 21:29:07,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:07,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:07,516 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-13 21:29:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:07,753 INFO L93 Difference]: Finished difference Result 600 states and 1002 transitions. [2019-10-13 21:29:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:07,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 21:29:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:07,756 INFO L225 Difference]: With dead ends: 600 [2019-10-13 21:29:07,756 INFO L226 Difference]: Without dead ends: 307 [2019-10-13 21:29:07,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-13 21:29:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2019-10-13 21:29:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-13 21:29:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-13 21:29:07,771 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-13 21:29:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:07,771 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-13 21:29:07,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-13 21:29:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:29:07,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:07,774 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:07,774 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:07,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:07,774 INFO L82 PathProgramCache]: Analyzing trace with hash -690895868, now seen corresponding path program 1 times [2019-10-13 21:29:07,774 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:07,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236421936] [2019-10-13 21:29:07,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-13 21:29:07,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236421936] [2019-10-13 21:29:07,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:07,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:07,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450708883] [2019-10-13 21:29:07,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:07,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:07,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:07,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:07,825 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-13 21:29:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:08,061 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-13 21:29:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:08,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 21:29:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:08,065 INFO L225 Difference]: With dead ends: 600 [2019-10-13 21:29:08,065 INFO L226 Difference]: Without dead ends: 311 [2019-10-13 21:29:08,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-13 21:29:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-13 21:29:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-13 21:29:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-13 21:29:08,085 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-13 21:29:08,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:08,086 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-13 21:29:08,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-13 21:29:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:29:08,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:08,089 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:08,089 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1568096766, now seen corresponding path program 1 times [2019-10-13 21:29:08,090 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846735351] [2019-10-13 21:29:08,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:08,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846735351] [2019-10-13 21:29:08,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:08,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:08,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560331363] [2019-10-13 21:29:08,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:08,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:08,168 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-13 21:29:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:08,372 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-13 21:29:08,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:08,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 21:29:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:08,375 INFO L225 Difference]: With dead ends: 640 [2019-10-13 21:29:08,375 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 21:29:08,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 21:29:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-13 21:29:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-13 21:29:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-13 21:29:08,394 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-13 21:29:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:08,395 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-13 21:29:08,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-13 21:29:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:29:08,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:08,398 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:08,398 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash -314967930, now seen corresponding path program 1 times [2019-10-13 21:29:08,399 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395532840] [2019-10-13 21:29:08,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:08,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395532840] [2019-10-13 21:29:08,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:08,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:08,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204449611] [2019-10-13 21:29:08,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:08,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:08,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:08,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:08,491 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-13 21:29:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:08,754 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-13 21:29:08,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:08,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 21:29:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:08,757 INFO L225 Difference]: With dead ends: 669 [2019-10-13 21:29:08,758 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 21:29:08,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 21:29:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-13 21:29:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-13 21:29:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-13 21:29:08,788 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-13 21:29:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:08,788 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-13 21:29:08,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-13 21:29:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:29:08,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:08,790 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:08,791 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1055150734, now seen corresponding path program 1 times [2019-10-13 21:29:08,791 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284927814] [2019-10-13 21:29:08,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:08,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284927814] [2019-10-13 21:29:08,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:08,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:08,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623025870] [2019-10-13 21:29:08,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:08,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:08,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:08,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:08,881 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-13 21:29:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,091 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-13 21:29:09,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-13 21:29:09,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,094 INFO L225 Difference]: With dead ends: 702 [2019-10-13 21:29:09,094 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 21:29:09,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 21:29:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-13 21:29:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 21:29:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-13 21:29:09,113 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-13 21:29:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,113 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-13 21:29:09,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-13 21:29:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:09,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,116 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:09,116 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2124208522, now seen corresponding path program 1 times [2019-10-13 21:29:09,116 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722814392] [2019-10-13 21:29:09,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:09,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722814392] [2019-10-13 21:29:09,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:09,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661137364] [2019-10-13 21:29:09,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:09,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:09,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:09,174 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-13 21:29:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,396 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-13 21:29:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,399 INFO L225 Difference]: With dead ends: 729 [2019-10-13 21:29:09,400 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 21:29:09,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 21:29:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-13 21:29:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 21:29:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-13 21:29:09,417 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-13 21:29:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,417 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-13 21:29:09,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-13 21:29:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:29:09,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,419 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:09,419 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1027752783, now seen corresponding path program 1 times [2019-10-13 21:29:09,420 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218521925] [2019-10-13 21:29:09,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 21:29:09,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218521925] [2019-10-13 21:29:09,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:09,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290294755] [2019-10-13 21:29:09,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:09,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:09,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:09,483 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-13 21:29:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,685 INFO L93 Difference]: Finished difference Result 746 states and 1198 transitions. [2019-10-13 21:29:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-13 21:29:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,688 INFO L225 Difference]: With dead ends: 746 [2019-10-13 21:29:09,688 INFO L226 Difference]: Without dead ends: 392 [2019-10-13 21:29:09,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-13 21:29:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-13 21:29:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 21:29:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-13 21:29:09,707 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-13 21:29:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,708 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-13 21:29:09,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-13 21:29:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:29:09,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,710 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:09,710 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1923701177, now seen corresponding path program 1 times [2019-10-13 21:29:09,711 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497764674] [2019-10-13 21:29:09,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 21:29:09,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497764674] [2019-10-13 21:29:09,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:09,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526902871] [2019-10-13 21:29:09,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:09,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:09,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:09,762 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-13 21:29:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,978 INFO L93 Difference]: Finished difference Result 767 states and 1221 transitions. [2019-10-13 21:29:09,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-13 21:29:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,982 INFO L225 Difference]: With dead ends: 767 [2019-10-13 21:29:09,982 INFO L226 Difference]: Without dead ends: 392 [2019-10-13 21:29:09,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-13 21:29:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-13 21:29:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 21:29:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-13 21:29:10,012 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-13 21:29:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,012 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-13 21:29:10,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-13 21:29:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 21:29:10,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,016 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,017 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1132457392, now seen corresponding path program 1 times [2019-10-13 21:29:10,017 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763361999] [2019-10-13 21:29:10,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:29:10,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763361999] [2019-10-13 21:29:10,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:10,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108938610] [2019-10-13 21:29:10,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:10,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:10,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:10,097 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-13 21:29:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,173 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-13 21:29:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:10,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-13 21:29:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,180 INFO L225 Difference]: With dead ends: 763 [2019-10-13 21:29:10,180 INFO L226 Difference]: Without dead ends: 761 [2019-10-13 21:29:10,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-13 21:29:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-13 21:29:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-13 21:29:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-13 21:29:10,248 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-13 21:29:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,248 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-13 21:29:10,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-13 21:29:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:29:10,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,253 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,253 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1143263811, now seen corresponding path program 1 times [2019-10-13 21:29:10,254 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045451873] [2019-10-13 21:29:10,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:29:10,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045451873] [2019-10-13 21:29:10,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:10,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986698042] [2019-10-13 21:29:10,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:10,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:10,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:10,324 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-10-13 21:29:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,396 INFO L93 Difference]: Finished difference Result 1837 states and 2905 transitions. [2019-10-13 21:29:10,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:10,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-13 21:29:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,403 INFO L225 Difference]: With dead ends: 1837 [2019-10-13 21:29:10,404 INFO L226 Difference]: Without dead ends: 1089 [2019-10-13 21:29:10,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-10-13 21:29:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2019-10-13 21:29:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-10-13 21:29:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1718 transitions. [2019-10-13 21:29:10,460 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1718 transitions. Word has length 127 [2019-10-13 21:29:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,460 INFO L462 AbstractCegarLoop]: Abstraction has 1089 states and 1718 transitions. [2019-10-13 21:29:10,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1718 transitions. [2019-10-13 21:29:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:29:10,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,463 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,464 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash 733219007, now seen corresponding path program 1 times [2019-10-13 21:29:10,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764488105] [2019-10-13 21:29:10,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 21:29:10,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764488105] [2019-10-13 21:29:10,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:10,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965819276] [2019-10-13 21:29:10,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:10,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:10,508 INFO L87 Difference]: Start difference. First operand 1089 states and 1718 transitions. Second operand 3 states. [2019-10-13 21:29:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,594 INFO L93 Difference]: Finished difference Result 2534 states and 4005 transitions. [2019-10-13 21:29:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:10,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-13 21:29:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,603 INFO L225 Difference]: With dead ends: 2534 [2019-10-13 21:29:10,603 INFO L226 Difference]: Without dead ends: 1458 [2019-10-13 21:29:10,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2019-10-13 21:29:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2019-10-13 21:29:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-10-13 21:29:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2300 transitions. [2019-10-13 21:29:10,670 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2300 transitions. Word has length 127 [2019-10-13 21:29:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,671 INFO L462 AbstractCegarLoop]: Abstraction has 1458 states and 2300 transitions. [2019-10-13 21:29:10,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2300 transitions. [2019-10-13 21:29:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:29:10,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,675 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,675 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2122513021, now seen corresponding path program 1 times [2019-10-13 21:29:10,676 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327054038] [2019-10-13 21:29:10,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-13 21:29:10,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327054038] [2019-10-13 21:29:10,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:10,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816464252] [2019-10-13 21:29:10,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:10,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:10,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:10,734 INFO L87 Difference]: Start difference. First operand 1458 states and 2300 transitions. Second operand 3 states. [2019-10-13 21:29:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,830 INFO L93 Difference]: Finished difference Result 3254 states and 5138 transitions. [2019-10-13 21:29:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:10,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-13 21:29:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,840 INFO L225 Difference]: With dead ends: 3254 [2019-10-13 21:29:10,841 INFO L226 Difference]: Without dead ends: 1809 [2019-10-13 21:29:10,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2019-10-13 21:29:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2019-10-13 21:29:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-10-13 21:29:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2851 transitions. [2019-10-13 21:29:10,935 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2851 transitions. Word has length 127 [2019-10-13 21:29:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,935 INFO L462 AbstractCegarLoop]: Abstraction has 1809 states and 2851 transitions. [2019-10-13 21:29:10,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2851 transitions. [2019-10-13 21:29:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-13 21:29:10,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,941 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,942 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,942 INFO L82 PathProgramCache]: Analyzing trace with hash 913291395, now seen corresponding path program 1 times [2019-10-13 21:29:10,942 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944147134] [2019-10-13 21:29:10,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 21:29:11,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944147134] [2019-10-13 21:29:11,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:11,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778078245] [2019-10-13 21:29:11,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:11,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:11,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:11,013 INFO L87 Difference]: Start difference. First operand 1809 states and 2851 transitions. Second operand 3 states. [2019-10-13 21:29:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,238 INFO L93 Difference]: Finished difference Result 3655 states and 5745 transitions. [2019-10-13 21:29:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:11,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-13 21:29:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,248 INFO L225 Difference]: With dead ends: 3655 [2019-10-13 21:29:11,249 INFO L226 Difference]: Without dead ends: 1859 [2019-10-13 21:29:11,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2019-10-13 21:29:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1809. [2019-10-13 21:29:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-10-13 21:29:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2779 transitions. [2019-10-13 21:29:11,350 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2779 transitions. Word has length 204 [2019-10-13 21:29:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,350 INFO L462 AbstractCegarLoop]: Abstraction has 1809 states and 2779 transitions. [2019-10-13 21:29:11,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2779 transitions. [2019-10-13 21:29:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-13 21:29:11,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,358 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:11,358 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,358 INFO L82 PathProgramCache]: Analyzing trace with hash -555522276, now seen corresponding path program 1 times [2019-10-13 21:29:11,359 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412574500] [2019-10-13 21:29:11,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-13 21:29:11,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412574500] [2019-10-13 21:29:11,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:11,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412233492] [2019-10-13 21:29:11,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:11,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:11,458 INFO L87 Difference]: Start difference. First operand 1809 states and 2779 transitions. Second operand 3 states. [2019-10-13 21:29:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,684 INFO L93 Difference]: Finished difference Result 3704 states and 5669 transitions. [2019-10-13 21:29:11,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:11,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-13 21:29:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,694 INFO L225 Difference]: With dead ends: 3704 [2019-10-13 21:29:11,695 INFO L226 Difference]: Without dead ends: 1908 [2019-10-13 21:29:11,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-10-13 21:29:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1815. [2019-10-13 21:29:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2019-10-13 21:29:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2712 transitions. [2019-10-13 21:29:11,781 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2712 transitions. Word has length 218 [2019-10-13 21:29:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,782 INFO L462 AbstractCegarLoop]: Abstraction has 1815 states and 2712 transitions. [2019-10-13 21:29:11,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2712 transitions. [2019-10-13 21:29:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-13 21:29:11,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,789 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:11,789 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2121219740, now seen corresponding path program 1 times [2019-10-13 21:29:11,789 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184229232] [2019-10-13 21:29:11,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-13 21:29:11,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184229232] [2019-10-13 21:29:11,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916407195] [2019-10-13 21:29:11,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:12,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-13 21:29:12,133 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-13 21:29:12,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [302511551] [2019-10-13 21:29:12,210 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 238 [2019-10-13 21:29:12,258 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:12,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:13,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:13,516 INFO L272 AbstractInterpreter]: Visited 76 different actions 1155 times. Merged at 65 different actions 976 times. Widened at 11 different actions 96 times. Performed 2689 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2689 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 99 fixpoints after 14 different actions. Largest state had 94 variables. [2019-10-13 21:29:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,523 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:13,523 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:13,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:29:13,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112403024] [2019-10-13 21:29:13,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:13,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:13,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:13,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:13,526 INFO L87 Difference]: Start difference. First operand 1815 states and 2712 transitions. Second operand 6 states. [2019-10-13 21:29:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:14,040 INFO L93 Difference]: Finished difference Result 4312 states and 6397 transitions. [2019-10-13 21:29:14,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:29:14,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-10-13 21:29:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:14,054 INFO L225 Difference]: With dead ends: 4312 [2019-10-13 21:29:14,054 INFO L226 Difference]: Without dead ends: 2483 [2019-10-13 21:29:14,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:29:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2019-10-13 21:29:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1641. [2019-10-13 21:29:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2019-10-13 21:29:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2418 transitions. [2019-10-13 21:29:14,142 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2418 transitions. Word has length 237 [2019-10-13 21:29:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:14,143 INFO L462 AbstractCegarLoop]: Abstraction has 1641 states and 2418 transitions. [2019-10-13 21:29:14,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2418 transitions. [2019-10-13 21:29:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-13 21:29:14,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:14,150 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:14,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:14,379 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,379 INFO L82 PathProgramCache]: Analyzing trace with hash 499648914, now seen corresponding path program 1 times [2019-10-13 21:29:14,379 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:14,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634824793] [2019-10-13 21:29:14,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-13 21:29:14,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634824793] [2019-10-13 21:29:14,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:14,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:14,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355639421] [2019-10-13 21:29:14,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:14,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:14,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:14,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:14,476 INFO L87 Difference]: Start difference. First operand 1641 states and 2418 transitions. Second operand 3 states. [2019-10-13 21:29:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:14,690 INFO L93 Difference]: Finished difference Result 3442 states and 5085 transitions. [2019-10-13 21:29:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:14,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-13 21:29:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:14,700 INFO L225 Difference]: With dead ends: 3442 [2019-10-13 21:29:14,700 INFO L226 Difference]: Without dead ends: 1726 [2019-10-13 21:29:14,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-10-13 21:29:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1716. [2019-10-13 21:29:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2019-10-13 21:29:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2483 transitions. [2019-10-13 21:29:14,774 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2483 transitions. Word has length 246 [2019-10-13 21:29:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:14,775 INFO L462 AbstractCegarLoop]: Abstraction has 1716 states and 2483 transitions. [2019-10-13 21:29:14,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2483 transitions. [2019-10-13 21:29:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-13 21:29:14,782 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:14,782 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:14,783 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1931626416, now seen corresponding path program 1 times [2019-10-13 21:29:14,783 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:14,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656976291] [2019-10-13 21:29:14,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 21:29:14,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656976291] [2019-10-13 21:29:14,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046126373] [2019-10-13 21:29:14,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:15,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 21:29:15,143 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 21:29:15,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [197489075] [2019-10-13 21:29:15,215 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 259 [2019-10-13 21:29:15,227 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:15,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:16,048 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:16,048 INFO L272 AbstractInterpreter]: Visited 77 different actions 1280 times. Merged at 66 different actions 1079 times. Widened at 11 different actions 97 times. Performed 2989 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2989 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 118 fixpoints after 17 different actions. Largest state had 94 variables. [2019-10-13 21:29:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:16,049 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:16,049 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:16,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:29:16,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053353924] [2019-10-13 21:29:16,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:16,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:16,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:16,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:16,053 INFO L87 Difference]: Start difference. First operand 1716 states and 2483 transitions. Second operand 6 states. [2019-10-13 21:29:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:17,079 INFO L93 Difference]: Finished difference Result 7747 states and 11324 transitions. [2019-10-13 21:29:17,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:29:17,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-10-13 21:29:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:17,108 INFO L225 Difference]: With dead ends: 7747 [2019-10-13 21:29:17,108 INFO L226 Difference]: Without dead ends: 6076 [2019-10-13 21:29:17,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:29:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2019-10-13 21:29:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 2394. [2019-10-13 21:29:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2019-10-13 21:29:17,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3181 transitions. [2019-10-13 21:29:17,245 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3181 transitions. Word has length 258 [2019-10-13 21:29:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:17,246 INFO L462 AbstractCegarLoop]: Abstraction has 2394 states and 3181 transitions. [2019-10-13 21:29:17,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3181 transitions. [2019-10-13 21:29:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-13 21:29:17,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:17,256 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:17,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:17,467 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2074521490, now seen corresponding path program 1 times [2019-10-13 21:29:17,467 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:17,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132807975] [2019-10-13 21:29:17,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-13 21:29:17,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132807975] [2019-10-13 21:29:17,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:17,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:17,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088467180] [2019-10-13 21:29:17,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:17,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:17,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:17,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:17,563 INFO L87 Difference]: Start difference. First operand 2394 states and 3181 transitions. Second operand 3 states. [2019-10-13 21:29:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:17,741 INFO L93 Difference]: Finished difference Result 6570 states and 8712 transitions. [2019-10-13 21:29:17,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:17,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-10-13 21:29:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:17,760 INFO L225 Difference]: With dead ends: 6570 [2019-10-13 21:29:17,761 INFO L226 Difference]: Without dead ends: 4221 [2019-10-13 21:29:17,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2019-10-13 21:29:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4219. [2019-10-13 21:29:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4219 states. [2019-10-13 21:29:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 4219 states and 5586 transitions. [2019-10-13 21:29:17,965 INFO L78 Accepts]: Start accepts. Automaton has 4219 states and 5586 transitions. Word has length 258 [2019-10-13 21:29:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:17,965 INFO L462 AbstractCegarLoop]: Abstraction has 4219 states and 5586 transitions. [2019-10-13 21:29:17,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4219 states and 5586 transitions. [2019-10-13 21:29:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-13 21:29:17,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:17,978 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:17,979 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:17,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:17,979 INFO L82 PathProgramCache]: Analyzing trace with hash -381613367, now seen corresponding path program 1 times [2019-10-13 21:29:17,979 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:17,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301363512] [2019-10-13 21:29:17,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-13 21:29:18,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301363512] [2019-10-13 21:29:18,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:18,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:18,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129120932] [2019-10-13 21:29:18,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:18,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:18,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:18,067 INFO L87 Difference]: Start difference. First operand 4219 states and 5586 transitions. Second operand 3 states. [2019-10-13 21:29:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:18,421 INFO L93 Difference]: Finished difference Result 8631 states and 11424 transitions. [2019-10-13 21:29:18,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:18,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-13 21:29:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:18,433 INFO L225 Difference]: With dead ends: 8631 [2019-10-13 21:29:18,434 INFO L226 Difference]: Without dead ends: 4457 [2019-10-13 21:29:18,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2019-10-13 21:29:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 4219. [2019-10-13 21:29:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4219 states. [2019-10-13 21:29:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 4219 states and 5514 transitions. [2019-10-13 21:29:18,700 INFO L78 Accepts]: Start accepts. Automaton has 4219 states and 5514 transitions. Word has length 261 [2019-10-13 21:29:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:18,700 INFO L462 AbstractCegarLoop]: Abstraction has 4219 states and 5514 transitions. [2019-10-13 21:29:18,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4219 states and 5514 transitions. [2019-10-13 21:29:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-13 21:29:18,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:18,711 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:18,712 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:18,712 INFO L82 PathProgramCache]: Analyzing trace with hash 281332617, now seen corresponding path program 1 times [2019-10-13 21:29:18,712 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:18,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10831768] [2019-10-13 21:29:18,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:18,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:18,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-10-13 21:29:18,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10831768] [2019-10-13 21:29:18,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:18,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:18,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373608522] [2019-10-13 21:29:18,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:18,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:18,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:18,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:18,809 INFO L87 Difference]: Start difference. First operand 4219 states and 5514 transitions. Second operand 3 states. [2019-10-13 21:29:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:19,081 INFO L93 Difference]: Finished difference Result 8525 states and 11126 transitions. [2019-10-13 21:29:19,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:19,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2019-10-13 21:29:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:19,093 INFO L225 Difference]: With dead ends: 8525 [2019-10-13 21:29:19,093 INFO L226 Difference]: Without dead ends: 4351 [2019-10-13 21:29:19,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4351 states. [2019-10-13 21:29:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4351 to 4311. [2019-10-13 21:29:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-10-13 21:29:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5626 transitions. [2019-10-13 21:29:19,282 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5626 transitions. Word has length 295 [2019-10-13 21:29:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:19,283 INFO L462 AbstractCegarLoop]: Abstraction has 4311 states and 5626 transitions. [2019-10-13 21:29:19,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5626 transitions. [2019-10-13 21:29:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-13 21:29:19,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:19,295 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:19,295 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:19,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:19,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1099840201, now seen corresponding path program 1 times [2019-10-13 21:29:19,296 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:19,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582093776] [2019-10-13 21:29:19,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-10-13 21:29:19,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582093776] [2019-10-13 21:29:19,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:19,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:19,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487915125] [2019-10-13 21:29:19,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:19,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:19,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:19,438 INFO L87 Difference]: Start difference. First operand 4311 states and 5626 transitions. Second operand 3 states. [2019-10-13 21:29:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:19,693 INFO L93 Difference]: Finished difference Result 8957 states and 11724 transitions. [2019-10-13 21:29:19,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:19,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-10-13 21:29:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:19,703 INFO L225 Difference]: With dead ends: 8957 [2019-10-13 21:29:19,704 INFO L226 Difference]: Without dead ends: 4691 [2019-10-13 21:29:19,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2019-10-13 21:29:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4561. [2019-10-13 21:29:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4561 states. [2019-10-13 21:29:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 5926 transitions. [2019-10-13 21:29:19,882 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 5926 transitions. Word has length 316 [2019-10-13 21:29:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:19,883 INFO L462 AbstractCegarLoop]: Abstraction has 4561 states and 5926 transitions. [2019-10-13 21:29:19,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 5926 transitions. [2019-10-13 21:29:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-13 21:29:19,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:19,896 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:19,896 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:19,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:19,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1319175701, now seen corresponding path program 1 times [2019-10-13 21:29:19,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:19,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219601465] [2019-10-13 21:29:19,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-10-13 21:29:20,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219601465] [2019-10-13 21:29:20,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:20,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:20,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561526240] [2019-10-13 21:29:20,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:20,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:20,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:20,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:20,033 INFO L87 Difference]: Start difference. First operand 4561 states and 5926 transitions. Second operand 3 states. [2019-10-13 21:29:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:20,247 INFO L93 Difference]: Finished difference Result 7673 states and 9899 transitions. [2019-10-13 21:29:20,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:20,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-13 21:29:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:20,253 INFO L225 Difference]: With dead ends: 7673 [2019-10-13 21:29:20,253 INFO L226 Difference]: Without dead ends: 2513 [2019-10-13 21:29:20,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2019-10-13 21:29:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2513. [2019-10-13 21:29:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-10-13 21:29:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3236 transitions. [2019-10-13 21:29:20,403 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3236 transitions. Word has length 326 [2019-10-13 21:29:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:20,403 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 3236 transitions. [2019-10-13 21:29:20,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3236 transitions. [2019-10-13 21:29:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-13 21:29:20,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:20,412 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:20,413 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash -231239372, now seen corresponding path program 1 times [2019-10-13 21:29:20,413 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:20,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818475382] [2019-10-13 21:29:20,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-13 21:29:20,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818475382] [2019-10-13 21:29:20,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:20,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:20,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146415745] [2019-10-13 21:29:20,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:20,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:20,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:20,515 INFO L87 Difference]: Start difference. First operand 2513 states and 3236 transitions. Second operand 3 states. [2019-10-13 21:29:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:20,699 INFO L93 Difference]: Finished difference Result 5021 states and 6470 transitions. [2019-10-13 21:29:20,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:20,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-10-13 21:29:20,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:20,705 INFO L225 Difference]: With dead ends: 5021 [2019-10-13 21:29:20,705 INFO L226 Difference]: Without dead ends: 2553 [2019-10-13 21:29:20,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-10-13 21:29:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2513. [2019-10-13 21:29:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-10-13 21:29:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3211 transitions. [2019-10-13 21:29:20,795 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3211 transitions. Word has length 342 [2019-10-13 21:29:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:20,796 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 3211 transitions. [2019-10-13 21:29:20,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3211 transitions. [2019-10-13 21:29:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-13 21:29:20,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:20,806 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:20,806 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:20,807 INFO L82 PathProgramCache]: Analyzing trace with hash -516641400, now seen corresponding path program 1 times [2019-10-13 21:29:20,807 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:20,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268817019] [2019-10-13 21:29:20,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-13 21:29:20,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268817019] [2019-10-13 21:29:20,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:20,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:20,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827243860] [2019-10-13 21:29:20,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:20,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:20,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:20,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:20,923 INFO L87 Difference]: Start difference. First operand 2513 states and 3211 transitions. Second operand 3 states. [2019-10-13 21:29:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:21,105 INFO L93 Difference]: Finished difference Result 4991 states and 6365 transitions. [2019-10-13 21:29:21,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:21,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-13 21:29:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:21,111 INFO L225 Difference]: With dead ends: 4991 [2019-10-13 21:29:21,111 INFO L226 Difference]: Without dead ends: 2523 [2019-10-13 21:29:21,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2019-10-13 21:29:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2513. [2019-10-13 21:29:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-10-13 21:29:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3186 transitions. [2019-10-13 21:29:21,259 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3186 transitions. Word has length 365 [2019-10-13 21:29:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:21,260 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 3186 transitions. [2019-10-13 21:29:21,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3186 transitions. [2019-10-13 21:29:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-13 21:29:21,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:21,273 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:21,274 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:21,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:21,274 INFO L82 PathProgramCache]: Analyzing trace with hash -753815824, now seen corresponding path program 1 times [2019-10-13 21:29:21,274 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:21,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932686067] [2019-10-13 21:29:21,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:21,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:21,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-13 21:29:21,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932686067] [2019-10-13 21:29:21,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843877407] [2019-10-13 21:29:21,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:21,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:21,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-13 21:29:21,656 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-13 21:29:21,787 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:21,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-13 21:29:21,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410343556] [2019-10-13 21:29:21,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:21,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:21,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:21,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:21,789 INFO L87 Difference]: Start difference. First operand 2513 states and 3186 transitions. Second operand 3 states. [2019-10-13 21:29:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:21,871 INFO L93 Difference]: Finished difference Result 3115 states and 3954 transitions. [2019-10-13 21:29:21,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:21,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-10-13 21:29:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:21,878 INFO L225 Difference]: With dead ends: 3115 [2019-10-13 21:29:21,878 INFO L226 Difference]: Without dead ends: 2977 [2019-10-13 21:29:21,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2019-10-13 21:29:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2377. [2019-10-13 21:29:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2019-10-13 21:29:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3032 transitions. [2019-10-13 21:29:21,965 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3032 transitions. Word has length 398 [2019-10-13 21:29:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:21,966 INFO L462 AbstractCegarLoop]: Abstraction has 2377 states and 3032 transitions. [2019-10-13 21:29:21,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3032 transitions. [2019-10-13 21:29:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-10-13 21:29:21,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:21,977 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:22,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:22,191 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:22,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1467408517, now seen corresponding path program 1 times [2019-10-13 21:29:22,193 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:22,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556493652] [2019-10-13 21:29:22,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:22,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:22,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-13 21:29:22,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556493652] [2019-10-13 21:29:22,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731290440] [2019-10-13 21:29:22,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:22,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:22,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-13 21:29:22,679 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-13 21:29:22,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1831858844] [2019-10-13 21:29:22,798 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 415 [2019-10-13 21:29:22,804 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:22,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:22,850 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:29:23,983 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:23,984 INFO L272 AbstractInterpreter]: Visited 99 different actions 2124 times. Merged at 85 different actions 1775 times. Widened at 19 different actions 260 times. Performed 4827 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 213 fixpoints after 20 different actions. Largest state had 97 variables. [2019-10-13 21:29:23,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:23,984 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:23,984 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:23,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:29:23,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679585519] [2019-10-13 21:29:23,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:23,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:23,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:23,987 INFO L87 Difference]: Start difference. First operand 2377 states and 3032 transitions. Second operand 6 states. [2019-10-13 21:29:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:24,601 INFO L93 Difference]: Finished difference Result 5666 states and 7218 transitions. [2019-10-13 21:29:24,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:29:24,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 414 [2019-10-13 21:29:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:24,607 INFO L225 Difference]: With dead ends: 5666 [2019-10-13 21:29:24,607 INFO L226 Difference]: Without dead ends: 3285 [2019-10-13 21:29:24,612 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 829 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:29:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-10-13 21:29:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2437. [2019-10-13 21:29:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-10-13 21:29:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3107 transitions. [2019-10-13 21:29:24,697 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3107 transitions. Word has length 414 [2019-10-13 21:29:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:24,698 INFO L462 AbstractCegarLoop]: Abstraction has 2437 states and 3107 transitions. [2019-10-13 21:29:24,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3107 transitions. [2019-10-13 21:29:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-10-13 21:29:24,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:24,706 INFO L380 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, 10, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:24,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:24,911 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash 540711013, now seen corresponding path program 1 times [2019-10-13 21:29:24,911 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:24,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090322736] [2019-10-13 21:29:24,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1661 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-10-13 21:29:25,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090322736] [2019-10-13 21:29:25,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:25,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:25,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483291436] [2019-10-13 21:29:25,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:25,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:25,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:25,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:25,134 INFO L87 Difference]: Start difference. First operand 2437 states and 3107 transitions. Second operand 3 states. [2019-10-13 21:29:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:25,318 INFO L93 Difference]: Finished difference Result 5009 states and 6387 transitions. [2019-10-13 21:29:25,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:25,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 542 [2019-10-13 21:29:25,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:25,323 INFO L225 Difference]: With dead ends: 5009 [2019-10-13 21:29:25,323 INFO L226 Difference]: Without dead ends: 2617 [2019-10-13 21:29:25,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2019-10-13 21:29:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2607. [2019-10-13 21:29:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-10-13 21:29:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3302 transitions. [2019-10-13 21:29:25,423 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3302 transitions. Word has length 542 [2019-10-13 21:29:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:25,424 INFO L462 AbstractCegarLoop]: Abstraction has 2607 states and 3302 transitions. [2019-10-13 21:29:25,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3302 transitions. [2019-10-13 21:29:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-10-13 21:29:25,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:25,436 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:25,436 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash -995203399, now seen corresponding path program 1 times [2019-10-13 21:29:25,437 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:25,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029208857] [2019-10-13 21:29:25,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:25,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:25,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-13 21:29:25,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029208857] [2019-10-13 21:29:25,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719895580] [2019-10-13 21:29:25,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:26,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:26,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-13 21:29:26,203 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-13 21:29:26,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1361502625] [2019-10-13 21:29:26,342 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 605 [2019-10-13 21:29:26,345 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:26,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:26,381 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:29:27,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:27,331 INFO L272 AbstractInterpreter]: Visited 110 different actions 2364 times. Merged at 93 different actions 1923 times. Widened at 22 different actions 309 times. Performed 5625 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5625 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 268 fixpoints after 22 different actions. Largest state had 101 variables. [2019-10-13 21:29:27,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:27,332 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:27,332 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:27,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:29:27,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739122938] [2019-10-13 21:29:27,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:27,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:27,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:27,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:27,335 INFO L87 Difference]: Start difference. First operand 2607 states and 3302 transitions. Second operand 6 states. [2019-10-13 21:29:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:27,693 INFO L93 Difference]: Finished difference Result 4192 states and 5300 transitions. [2019-10-13 21:29:27,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:27,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 604 [2019-10-13 21:29:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:27,694 INFO L225 Difference]: With dead ends: 4192 [2019-10-13 21:29:27,695 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:29:27,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1215 GetRequests, 1209 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:29:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:29:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:29:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:29:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:29:27,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 604 [2019-10-13 21:29:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:27,702 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:29:27,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:29:27,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:29:27,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:27,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:29:28,040 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2019-10-13 21:29:28,487 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 132 [2019-10-13 21:29:28,769 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 146 [2019-10-13 21:29:30,069 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 447 DAG size of output: 301 [2019-10-13 21:29:30,993 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 448 DAG size of output: 301 [2019-10-13 21:29:32,162 WARN L191 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 58