/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/fork_loop_local.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 13:03:04,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 13:03:04,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 13:03:04,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 13:03:04,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 13:03:04,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 13:03:04,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 13:03:04,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 13:03:04,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 13:03:04,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 13:03:04,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 13:03:04,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 13:03:04,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 13:03:04,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 13:03:04,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 13:03:04,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 13:03:04,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 13:03:04,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 13:03:04,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 13:03:04,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 13:03:04,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 13:03:04,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 13:03:04,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 13:03:04,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 13:03:04,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 13:03:04,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 13:03:04,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 13:03:04,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 13:03:04,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 13:03:04,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 13:03:04,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 13:03:04,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 13:03:04,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 13:03:04,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 13:03:04,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 13:03:04,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 13:03:04,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 13:03:04,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 13:03:04,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 13:03:04,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 13:03:04,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 13:03:04,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 13:03:04,649 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 13:03:04,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 13:03:04,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 13:03:04,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 13:03:04,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 13:03:04,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 13:03:04,653 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 13:03:04,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 13:03:04,653 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 13:03:04,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 13:03:04,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 13:03:04,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 13:03:04,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 13:03:04,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 13:03:04,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 13:03:04,655 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 13:03:04,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 13:03:04,655 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 13:03:04,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 13:03:04,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 13:03:04,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 13:03:04,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 13:03:04,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 13:03:04,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 13:03:04,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 13:03:04,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 13:03:04,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 13:03:04,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 13:03:04,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 13:03:04,657 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 13:03:04,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 13:03:04,657 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 13:03:04,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 13:03:04,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 13:03:05,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 13:03:05,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 13:03:05,017 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 13:03:05,018 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 13:03:05,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_local.bpl [2021-06-05 13:03:05,019 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_local.bpl' [2021-06-05 13:03:05,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 13:03:05,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 13:03:05,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 13:03:05,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 13:03:05,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 13:03:05,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (1/1) ... [2021-06-05 13:03:05,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (1/1) ... [2021-06-05 13:03:05,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 13:03:05,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 13:03:05,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 13:03:05,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 13:03:05,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (1/1) ... [2021-06-05 13:03:05,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (1/1) ... [2021-06-05 13:03:05,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (1/1) ... [2021-06-05 13:03:05,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (1/1) ... [2021-06-05 13:03:05,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (1/1) ... [2021-06-05 13:03:05,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (1/1) ... [2021-06-05 13:03:05,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (1/1) ... [2021-06-05 13:03:05,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 13:03:05,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 13:03:05,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 13:03:05,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 13:03:05,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (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 [2021-06-05 13:03:05,166 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 13:03:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 13:03:05,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 13:03:05,167 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2021-06-05 13:03:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2021-06-05 13:03:05,167 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2021-06-05 13:03:05,168 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 13:03:05,290 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 13:03:05,290 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-06-05 13:03:05,293 INFO L202 PluginConnector]: Adding new model fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 01:03:05 BoogieIcfgContainer [2021-06-05 13:03:05,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 13:03:05,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 13:03:05,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 13:03:05,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 13:03:05,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:03:05" (1/2) ... [2021-06-05 13:03:05,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1a29e1 and model type fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 01:03:05, skipping insertion in model container [2021-06-05 13:03:05,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_local.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 01:03:05" (2/2) ... [2021-06-05 13:03:05,307 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_loop_local.bpl [2021-06-05 13:03:05,317 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 13:03:05,317 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 13:03:05,318 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 13:03:05,319 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 13:03:05,344 WARN L313 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,344 WARN L313 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,345 WARN L313 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,345 WARN L313 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,351 WARN L313 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,354 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 13:03:05,373 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 13:03:05,399 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:03:05,399 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:03:05,399 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:03:05,400 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:03:05,400 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:03:05,400 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:03:05,400 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:03:05,400 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 13:03:05,408 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 12 places, 9 transitions, 23 flow [2021-06-05 13:03:05,424 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 21 states, 16 states have (on average 1.875) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.875) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-06-05 13:03:05,432 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:05,433 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-06-05 13:03:05,434 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:05,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:05,441 INFO L82 PathProgramCache]: Analyzing trace with hash 40505862, now seen corresponding path program 1 times [2021-06-05 13:03:05,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:05,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854284571] [2021-06-05 13:03:05,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 13:03:05,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:05,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854284571] [2021-06-05 13:03:05,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854284571] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:05,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:05,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:05,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503565897] [2021-06-05 13:03:05,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:05,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:05,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:05,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:05,707 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.875) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:05,756 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2021-06-05 13:03:05,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 13:03:05,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-06-05 13:03:05,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:05,765 INFO L225 Difference]: With dead ends: 18 [2021-06-05 13:03:05,765 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 13:03:05,766 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 13:03:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 13:03:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 13:03:05,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2021-06-05 13:03:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:05,783 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 13:03:05,783 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 13:03:05,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 13:03:05,784 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 13:03:05,784 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 13:03:05,786 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 13:03:05,788 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:03:05,788 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:03:05,788 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:03:05,788 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:03:05,788 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:03:05,788 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:03:05,788 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:03:05,788 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 13:03:05,789 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 12 places, 9 transitions, 23 flow [2021-06-05 13:03:05,791 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 21 states, 16 states have (on average 1.875) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.875) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-06-05 13:03:05,791 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:05,791 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-06-05 13:03:05,792 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 13:03:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash 42154, now seen corresponding path program 1 times [2021-06-05 13:03:05,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:05,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604907888] [2021-06-05 13:03:05,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 13:03:05,796 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 13:03:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 13:03:05,798 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 13:03:05,809 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 13:03:05,810 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 13:03:05,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 13:03:05,810 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 13:03:05,811 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 13:03:05,811 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 13:03:05,814 WARN L313 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,814 WARN L313 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,814 WARN L313 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,815 WARN L313 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,815 WARN L313 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,815 WARN L313 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,816 WARN L313 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,816 WARN L313 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,816 WARN L313 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,818 WARN L313 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:05,818 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 13:03:05,819 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 13:03:05,820 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:03:05,821 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:03:05,821 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:03:05,821 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:03:05,821 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:03:05,821 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:03:05,821 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:03:05,821 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 13:03:05,822 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 15 transitions, 42 flow [2021-06-05 13:03:05,833 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 123 states, 112 states have (on average 2.4732142857142856) internal successors, (277), 122 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 112 states have (on average 2.4732142857142856) internal successors, (277), 122 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-06-05 13:03:05,835 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:05,835 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-06-05 13:03:05,835 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash 54969392, now seen corresponding path program 1 times [2021-06-05 13:03:05,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:05,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892339416] [2021-06-05 13:03:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 13:03:05,871 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:05,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892339416] [2021-06-05 13:03:05,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892339416] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:05,872 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:05,872 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:05,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588971964] [2021-06-05 13:03:05,872 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:05,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:05,874 INFO L87 Difference]: Start difference. First operand has 123 states, 112 states have (on average 2.4732142857142856) internal successors, (277), 122 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:05,941 INFO L93 Difference]: Finished difference Result 205 states and 431 transitions. [2021-06-05 13:03:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-06-05 13:03:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:05,946 INFO L225 Difference]: With dead ends: 205 [2021-06-05 13:03:05,946 INFO L226 Difference]: Without dead ends: 136 [2021-06-05 13:03:05,947 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-06-05 13:03:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 100. [2021-06-05 13:03:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 94 states have (on average 2.2127659574468086) internal successors, (208), 99 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 208 transitions. [2021-06-05 13:03:05,974 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 208 transitions. Word has length 5 [2021-06-05 13:03:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:05,974 INFO L482 AbstractCegarLoop]: Abstraction has 100 states and 208 transitions. [2021-06-05 13:03:05,974 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 208 transitions. [2021-06-05 13:03:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 13:03:05,975 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:05,975 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 13:03:05,975 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 13:03:05,976 INFO L430 AbstractCegarLoop]: === Iteration 2 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:05,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1704412654, now seen corresponding path program 1 times [2021-06-05 13:03:05,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:05,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871356311] [2021-06-05 13:03:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 13:03:06,011 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:06,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871356311] [2021-06-05 13:03:06,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871356311] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:06,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:06,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:06,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020489481] [2021-06-05 13:03:06,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:06,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:06,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:06,015 INFO L87 Difference]: Start difference. First operand 100 states and 208 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:06,053 INFO L93 Difference]: Finished difference Result 142 states and 263 transitions. [2021-06-05 13:03:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:06,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-06-05 13:03:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:06,055 INFO L225 Difference]: With dead ends: 142 [2021-06-05 13:03:06,055 INFO L226 Difference]: Without dead ends: 110 [2021-06-05 13:03:06,056 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-06-05 13:03:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2021-06-05 13:03:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 68 states have (on average 2.1029411764705883) internal successors, (143), 73 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 143 transitions. [2021-06-05 13:03:06,067 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 143 transitions. Word has length 6 [2021-06-05 13:03:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:06,068 INFO L482 AbstractCegarLoop]: Abstraction has 74 states and 143 transitions. [2021-06-05 13:03:06,068 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 143 transitions. [2021-06-05 13:03:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 13:03:06,069 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:06,069 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:06,069 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 13:03:06,069 INFO L430 AbstractCegarLoop]: === Iteration 3 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:06,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1210954954, now seen corresponding path program 1 times [2021-06-05 13:03:06,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:06,070 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783031073] [2021-06-05 13:03:06,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 13:03:06,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:06,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783031073] [2021-06-05 13:03:06,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783031073] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:06,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:06,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:06,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721016764] [2021-06-05 13:03:06,117 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:06,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:06,118 INFO L87 Difference]: Start difference. First operand 74 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:06,193 INFO L93 Difference]: Finished difference Result 53 states and 93 transitions. [2021-06-05 13:03:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 13:03:06,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-06-05 13:03:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:06,194 INFO L225 Difference]: With dead ends: 53 [2021-06-05 13:03:06,194 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 13:03:06,195 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 57.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:03:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 13:03:06,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 13:03:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 13:03:06,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2021-06-05 13:03:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:06,196 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 13:03:06,196 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 13:03:06,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 13:03:06,196 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 13:03:06,197 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 13:03:06,197 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 13:03:06,198 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:03:06,198 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:03:06,198 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:03:06,198 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:03:06,198 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:03:06,198 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:03:06,199 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:03:06,199 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 13:03:06,199 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 15 transitions, 42 flow [2021-06-05 13:03:06,204 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 123 states, 112 states have (on average 2.4732142857142856) internal successors, (277), 122 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 112 states have (on average 2.4732142857142856) internal successors, (277), 122 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 13:03:06,205 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:06,206 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 13:03:06,206 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 13:03:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1773586, now seen corresponding path program 1 times [2021-06-05 13:03:06,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:06,207 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001743123] [2021-06-05 13:03:06,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 13:03:06,210 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 13:03:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 13:03:06,212 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 13:03:06,213 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 13:03:06,213 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 13:03:06,214 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 13:03:06,214 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 13:03:06,214 WARN L242 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 13:03:06,214 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-06-05 13:03:06,218 WARN L313 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,218 WARN L313 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,218 WARN L313 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,218 WARN L313 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,219 WARN L313 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,219 WARN L313 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,219 WARN L313 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,219 WARN L313 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,220 WARN L313 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,220 WARN L313 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,220 WARN L313 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,220 WARN L313 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,221 WARN L313 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,240 WARN L313 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,241 WARN L313 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:06,242 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 13:03:06,242 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 13:03:06,243 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:03:06,243 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:03:06,243 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:03:06,244 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:03:06,244 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:03:06,244 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:03:06,244 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:03:06,244 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 13:03:06,245 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 21 transitions, 63 flow [2021-06-05 13:03:06,321 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 735 states, 712 states have (on average 3.186797752808989) internal successors, (2269), 734 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 735 states, 712 states have (on average 3.186797752808989) internal successors, (2269), 734 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-06-05 13:03:06,324 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:06,325 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-06-05 13:03:06,325 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash 75168682, now seen corresponding path program 1 times [2021-06-05 13:03:06,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:06,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745610299] [2021-06-05 13:03:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 13:03:06,383 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:06,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745610299] [2021-06-05 13:03:06,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745610299] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:06,384 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:06,384 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:06,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902551093] [2021-06-05 13:03:06,384 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:06,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:06,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:06,387 INFO L87 Difference]: Start difference. First operand has 735 states, 712 states have (on average 3.186797752808989) internal successors, (2269), 734 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:06,484 INFO L93 Difference]: Finished difference Result 1725 states and 4897 transitions. [2021-06-05 13:03:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:06,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-06-05 13:03:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:06,502 INFO L225 Difference]: With dead ends: 1725 [2021-06-05 13:03:06,502 INFO L226 Difference]: Without dead ends: 1491 [2021-06-05 13:03:06,503 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2021-06-05 13:03:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 907. [2021-06-05 13:03:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 890 states have (on average 3.0) internal successors, (2670), 906 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2670 transitions. [2021-06-05 13:03:06,608 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2670 transitions. Word has length 5 [2021-06-05 13:03:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:06,609 INFO L482 AbstractCegarLoop]: Abstraction has 907 states and 2670 transitions. [2021-06-05 13:03:06,609 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2670 transitions. [2021-06-05 13:03:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 13:03:06,611 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:06,612 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 13:03:06,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 13:03:06,612 INFO L430 AbstractCegarLoop]: === Iteration 2 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1964535506, now seen corresponding path program 1 times [2021-06-05 13:03:06,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:06,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279952441] [2021-06-05 13:03:06,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 13:03:06,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:06,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279952441] [2021-06-05 13:03:06,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279952441] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:06,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:06,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:06,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4948695] [2021-06-05 13:03:06,681 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:06,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:06,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:06,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:06,683 INFO L87 Difference]: Start difference. First operand 907 states and 2670 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:06,770 INFO L93 Difference]: Finished difference Result 1770 states and 4789 transitions. [2021-06-05 13:03:06,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:06,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-06-05 13:03:06,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:06,782 INFO L225 Difference]: With dead ends: 1770 [2021-06-05 13:03:06,783 INFO L226 Difference]: Without dead ends: 1661 [2021-06-05 13:03:06,783 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2021-06-05 13:03:06,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 982. [2021-06-05 13:03:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 965 states have (on average 2.9129533678756476) internal successors, (2811), 981 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 2811 transitions. [2021-06-05 13:03:06,841 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 2811 transitions. Word has length 6 [2021-06-05 13:03:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:06,842 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 2811 transitions. [2021-06-05 13:03:06,843 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 2811 transitions. [2021-06-05 13:03:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 13:03:06,845 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:06,845 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:06,845 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 13:03:06,845 INFO L430 AbstractCegarLoop]: === Iteration 3 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash -770677153, now seen corresponding path program 1 times [2021-06-05 13:03:06,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:06,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741997795] [2021-06-05 13:03:06,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:03:06,904 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:06,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741997795] [2021-06-05 13:03:06,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741997795] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:06,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:06,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:06,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70331870] [2021-06-05 13:03:06,905 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:06,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:06,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:06,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:06,906 INFO L87 Difference]: Start difference. First operand 982 states and 2811 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:06,972 INFO L93 Difference]: Finished difference Result 1843 states and 4881 transitions. [2021-06-05 13:03:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-06-05 13:03:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:06,982 INFO L225 Difference]: With dead ends: 1843 [2021-06-05 13:03:06,983 INFO L226 Difference]: Without dead ends: 1703 [2021-06-05 13:03:06,984 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2021-06-05 13:03:07,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1018. [2021-06-05 13:03:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1001 states have (on average 2.8011988011988014) internal successors, (2804), 1017 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2804 transitions. [2021-06-05 13:03:07,035 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2804 transitions. Word has length 7 [2021-06-05 13:03:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:07,035 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 2804 transitions. [2021-06-05 13:03:07,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2804 transitions. [2021-06-05 13:03:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 13:03:07,039 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:07,039 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:07,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 13:03:07,040 INFO L430 AbstractCegarLoop]: === Iteration 4 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:07,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:07,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1672453812, now seen corresponding path program 1 times [2021-06-05 13:03:07,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:07,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275137637] [2021-06-05 13:03:07,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 13:03:07,147 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:07,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275137637] [2021-06-05 13:03:07,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275137637] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:07,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:07,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:07,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095677373] [2021-06-05 13:03:07,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:07,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:07,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:07,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:07,149 INFO L87 Difference]: Start difference. First operand 1018 states and 2804 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:07,266 INFO L93 Difference]: Finished difference Result 2020 states and 5128 transitions. [2021-06-05 13:03:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:07,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-06-05 13:03:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:07,275 INFO L225 Difference]: With dead ends: 2020 [2021-06-05 13:03:07,275 INFO L226 Difference]: Without dead ends: 1818 [2021-06-05 13:03:07,276 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 49.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2021-06-05 13:03:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 766. [2021-06-05 13:03:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 752 states have (on average 2.7752659574468086) internal successors, (2087), 765 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2087 transitions. [2021-06-05 13:03:07,310 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 2087 transitions. Word has length 8 [2021-06-05 13:03:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:07,311 INFO L482 AbstractCegarLoop]: Abstraction has 766 states and 2087 transitions. [2021-06-05 13:03:07,311 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 2087 transitions. [2021-06-05 13:03:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-05 13:03:07,312 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:07,312 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:07,312 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 13:03:07,312 INFO L430 AbstractCegarLoop]: === Iteration 5 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:07,312 INFO L82 PathProgramCache]: Analyzing trace with hash 306841864, now seen corresponding path program 1 times [2021-06-05 13:03:07,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:07,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129922059] [2021-06-05 13:03:07,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:03:07,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:07,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129922059] [2021-06-05 13:03:07,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129922059] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:07,348 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:07,348 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:07,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805030796] [2021-06-05 13:03:07,348 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:07,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:07,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:07,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:07,349 INFO L87 Difference]: Start difference. First operand 766 states and 2087 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:07,464 INFO L93 Difference]: Finished difference Result 1709 states and 4239 transitions. [2021-06-05 13:03:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:07,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-06-05 13:03:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:07,471 INFO L225 Difference]: With dead ends: 1709 [2021-06-05 13:03:07,471 INFO L226 Difference]: Without dead ends: 1507 [2021-06-05 13:03:07,471 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:07,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2021-06-05 13:03:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 579. [2021-06-05 13:03:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 565 states have (on average 2.711504424778761) internal successors, (1532), 578 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1532 transitions. [2021-06-05 13:03:07,498 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1532 transitions. Word has length 9 [2021-06-05 13:03:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:07,498 INFO L482 AbstractCegarLoop]: Abstraction has 579 states and 1532 transitions. [2021-06-05 13:03:07,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1532 transitions. [2021-06-05 13:03:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-05 13:03:07,499 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:07,499 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:07,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 13:03:07,499 INFO L430 AbstractCegarLoop]: === Iteration 6 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1886364258, now seen corresponding path program 1 times [2021-06-05 13:03:07,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:07,500 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207233162] [2021-06-05 13:03:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:03:07,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:07,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207233162] [2021-06-05 13:03:07,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207233162] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:07,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:07,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:07,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218555704] [2021-06-05 13:03:07,538 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:07,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:07,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:07,539 INFO L87 Difference]: Start difference. First operand 579 states and 1532 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:07,654 INFO L93 Difference]: Finished difference Result 1327 states and 3179 transitions. [2021-06-05 13:03:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:07,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-06-05 13:03:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:07,659 INFO L225 Difference]: With dead ends: 1327 [2021-06-05 13:03:07,659 INFO L226 Difference]: Without dead ends: 1111 [2021-06-05 13:03:07,660 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 50.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-06-05 13:03:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 426. [2021-06-05 13:03:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 412 states have (on average 2.5679611650485437) internal successors, (1058), 425 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1058 transitions. [2021-06-05 13:03:07,679 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1058 transitions. Word has length 9 [2021-06-05 13:03:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:07,679 INFO L482 AbstractCegarLoop]: Abstraction has 426 states and 1058 transitions. [2021-06-05 13:03:07,679 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1058 transitions. [2021-06-05 13:03:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-06-05 13:03:07,680 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:07,680 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:07,680 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 13:03:07,680 INFO L430 AbstractCegarLoop]: === Iteration 7 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:07,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:07,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1477716857, now seen corresponding path program 1 times [2021-06-05 13:03:07,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:07,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88545712] [2021-06-05 13:03:07,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:03:07,733 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:07,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88545712] [2021-06-05 13:03:07,733 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88545712] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:07,733 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:07,733 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:03:07,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033246486] [2021-06-05 13:03:07,734 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:03:07,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:03:07,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:03:07,734 INFO L87 Difference]: Start difference. First operand 426 states and 1058 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:07,897 INFO L93 Difference]: Finished difference Result 279 states and 636 transitions. [2021-06-05 13:03:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 13:03:07,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-06-05 13:03:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:07,897 INFO L225 Difference]: With dead ends: 279 [2021-06-05 13:03:07,897 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 13:03:07,898 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 122.5ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-06-05 13:03:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 13:03:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 13:03:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 13:03:07,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2021-06-05 13:03:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:07,899 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 13:03:07,899 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 13:03:07,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 13:03:07,899 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 13:03:07,900 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 13:03:07,900 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 13:03:07,901 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:03:07,901 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:03:07,901 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:03:07,901 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:03:07,901 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:03:07,901 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:03:07,901 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:03:07,901 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 13:03:07,902 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 21 transitions, 63 flow [2021-06-05 13:03:07,920 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 735 states, 712 states have (on average 3.186797752808989) internal successors, (2269), 734 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 735 states, 712 states have (on average 3.186797752808989) internal successors, (2269), 734 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-06-05 13:03:07,921 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:07,921 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-06-05 13:03:07,922 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 13:03:07,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 75175629, now seen corresponding path program 1 times [2021-06-05 13:03:07,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:07,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145398930] [2021-06-05 13:03:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 13:03:07,927 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 13:03:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 13:03:07,929 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 13:03:07,931 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 13:03:07,931 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 13:03:07,931 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 13:03:07,931 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 13:03:07,931 WARN L242 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 13:03:07,931 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-06-05 13:03:07,936 WARN L313 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,936 WARN L313 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,936 WARN L313 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,936 WARN L313 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,937 WARN L313 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,937 WARN L313 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,938 WARN L313 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,938 WARN L313 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,938 WARN L313 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,938 WARN L313 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,938 WARN L313 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,938 WARN L313 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,939 WARN L313 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,939 WARN L313 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,940 WARN L313 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,940 WARN L313 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,941 WARN L313 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,942 WARN L313 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,942 WARN L313 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,943 WARN L313 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:07,944 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 13:03:07,946 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 13:03:07,946 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:03:07,946 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:03:07,946 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:03:07,946 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:03:07,947 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:03:07,947 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:03:07,947 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:03:07,948 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 13:03:07,952 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 86 flow [2021-06-05 13:03:08,200 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4407 states, 4360 states have (on average 3.963532110091743) internal successors, (17281), 4406 states have internal predecessors, (17281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 4407 states, 4360 states have (on average 3.963532110091743) internal successors, (17281), 4406 states have internal predecessors, (17281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-06-05 13:03:08,212 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:08,212 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-06-05 13:03:08,216 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:08,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash 101078907, now seen corresponding path program 1 times [2021-06-05 13:03:08,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:08,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004713660] [2021-06-05 13:03:08,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 13:03:08,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:08,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004713660] [2021-06-05 13:03:08,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004713660] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:08,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:08,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:08,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670841212] [2021-06-05 13:03:08,255 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:08,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:08,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:08,279 INFO L87 Difference]: Start difference. First operand has 4407 states, 4360 states have (on average 3.963532110091743) internal successors, (17281), 4406 states have internal predecessors, (17281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:08,443 INFO L93 Difference]: Finished difference Result 12381 states and 44365 transitions. [2021-06-05 13:03:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:08,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-06-05 13:03:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:08,520 INFO L225 Difference]: With dead ends: 12381 [2021-06-05 13:03:08,520 INFO L226 Difference]: Without dead ends: 11646 [2021-06-05 13:03:08,521 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:08,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11646 states. [2021-06-05 13:03:08,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11646 to 6708. [2021-06-05 13:03:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6708 states, 6668 states have (on average 3.770995800839832) internal successors, (25145), 6707 states have internal predecessors, (25145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6708 states to 6708 states and 25145 transitions. [2021-06-05 13:03:08,957 INFO L78 Accepts]: Start accepts. Automaton has 6708 states and 25145 transitions. Word has length 5 [2021-06-05 13:03:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:08,958 INFO L482 AbstractCegarLoop]: Abstraction has 6708 states and 25145 transitions. [2021-06-05 13:03:08,958 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6708 states and 25145 transitions. [2021-06-05 13:03:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 13:03:08,958 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:08,958 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 13:03:08,959 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 13:03:08,959 INFO L430 AbstractCegarLoop]: === Iteration 2 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:08,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1161010669, now seen corresponding path program 1 times [2021-06-05 13:03:08,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:08,960 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961910317] [2021-06-05 13:03:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 13:03:08,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:08,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961910317] [2021-06-05 13:03:08,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961910317] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:08,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:08,983 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:08,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817722653] [2021-06-05 13:03:08,983 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:08,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:08,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:08,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:08,984 INFO L87 Difference]: Start difference. First operand 6708 states and 25145 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:09,143 INFO L93 Difference]: Finished difference Result 14672 states and 51665 transitions. [2021-06-05 13:03:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:09,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-06-05 13:03:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:09,355 INFO L225 Difference]: With dead ends: 14672 [2021-06-05 13:03:09,356 INFO L226 Difference]: Without dead ends: 14314 [2021-06-05 13:03:09,356 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14314 states. [2021-06-05 13:03:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14314 to 7861. [2021-06-05 13:03:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7861 states, 7821 states have (on average 3.7344329369645823) internal successors, (29207), 7860 states have internal predecessors, (29207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 29207 transitions. [2021-06-05 13:03:09,895 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 29207 transitions. Word has length 6 [2021-06-05 13:03:09,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:09,895 INFO L482 AbstractCegarLoop]: Abstraction has 7861 states and 29207 transitions. [2021-06-05 13:03:09,895 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 29207 transitions. [2021-06-05 13:03:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 13:03:09,896 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:09,896 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:09,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 13:03:09,896 INFO L430 AbstractCegarLoop]: === Iteration 3 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:09,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1631215915, now seen corresponding path program 1 times [2021-06-05 13:03:09,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:09,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699734412] [2021-06-05 13:03:09,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:03:09,939 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:09,939 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699734412] [2021-06-05 13:03:09,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699734412] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:09,939 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:09,939 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:09,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263337501] [2021-06-05 13:03:09,939 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:09,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:09,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:09,940 INFO L87 Difference]: Start difference. First operand 7861 states and 29207 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:10,144 INFO L93 Difference]: Finished difference Result 17053 states and 59681 transitions. [2021-06-05 13:03:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:10,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-06-05 13:03:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:10,251 INFO L225 Difference]: With dead ends: 17053 [2021-06-05 13:03:10,252 INFO L226 Difference]: Without dead ends: 16592 [2021-06-05 13:03:10,252 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16592 states. [2021-06-05 13:03:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16592 to 9136. [2021-06-05 13:03:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9136 states, 9096 states have (on average 3.691182937554969) internal successors, (33575), 9135 states have internal predecessors, (33575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9136 states to 9136 states and 33575 transitions. [2021-06-05 13:03:10,701 INFO L78 Accepts]: Start accepts. Automaton has 9136 states and 33575 transitions. Word has length 7 [2021-06-05 13:03:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:10,702 INFO L482 AbstractCegarLoop]: Abstraction has 9136 states and 33575 transitions. [2021-06-05 13:03:10,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 9136 states and 33575 transitions. [2021-06-05 13:03:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 13:03:10,702 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:10,702 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:10,703 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 13:03:10,703 INFO L430 AbstractCegarLoop]: === Iteration 4 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:10,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash 470183183, now seen corresponding path program 1 times [2021-06-05 13:03:10,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:10,703 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114328239] [2021-06-05 13:03:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 13:03:10,732 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:10,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114328239] [2021-06-05 13:03:10,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114328239] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:10,732 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:10,732 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:10,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287081901] [2021-06-05 13:03:10,733 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:10,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:10,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:10,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:10,733 INFO L87 Difference]: Start difference. First operand 9136 states and 33575 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:11,019 INFO L93 Difference]: Finished difference Result 23707 states and 80648 transitions. [2021-06-05 13:03:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:11,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-06-05 13:03:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:11,082 INFO L225 Difference]: With dead ends: 23707 [2021-06-05 13:03:11,082 INFO L226 Difference]: Without dead ends: 23053 [2021-06-05 13:03:11,082 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 49.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23053 states. [2021-06-05 13:03:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23053 to 8445. [2021-06-05 13:03:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8445 states, 8408 states have (on average 3.6701950523311133) internal successors, (30859), 8444 states have internal predecessors, (30859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8445 states to 8445 states and 30859 transitions. [2021-06-05 13:03:11,623 INFO L78 Accepts]: Start accepts. Automaton has 8445 states and 30859 transitions. Word has length 8 [2021-06-05 13:03:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:11,623 INFO L482 AbstractCegarLoop]: Abstraction has 8445 states and 30859 transitions. [2021-06-05 13:03:11,623 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 8445 states and 30859 transitions. [2021-06-05 13:03:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 13:03:11,624 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:11,624 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:11,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 13:03:11,624 INFO L430 AbstractCegarLoop]: === Iteration 5 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:11,625 INFO L82 PathProgramCache]: Analyzing trace with hash 972643159, now seen corresponding path program 1 times [2021-06-05 13:03:11,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:11,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412931132] [2021-06-05 13:03:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:03:11,648 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:11,648 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412931132] [2021-06-05 13:03:11,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412931132] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:11,648 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:11,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:11,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016797722] [2021-06-05 13:03:11,649 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:11,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:11,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:11,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:11,650 INFO L87 Difference]: Start difference. First operand 8445 states and 30859 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:11,794 INFO L93 Difference]: Finished difference Result 17797 states and 61568 transitions. [2021-06-05 13:03:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:11,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-06-05 13:03:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:11,844 INFO L225 Difference]: With dead ends: 17797 [2021-06-05 13:03:11,845 INFO L226 Difference]: Without dead ends: 17219 [2021-06-05 13:03:11,845 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17219 states. [2021-06-05 13:03:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17219 to 9545. [2021-06-05 13:03:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9545 states, 9508 states have (on average 3.6168489692890198) internal successors, (34389), 9544 states have internal predecessors, (34389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 34389 transitions. [2021-06-05 13:03:12,228 INFO L78 Accepts]: Start accepts. Automaton has 9545 states and 34389 transitions. Word has length 8 [2021-06-05 13:03:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:12,229 INFO L482 AbstractCegarLoop]: Abstraction has 9545 states and 34389 transitions. [2021-06-05 13:03:12,229 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 9545 states and 34389 transitions. [2021-06-05 13:03:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-05 13:03:12,230 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:12,230 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:12,230 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 13:03:12,230 INFO L430 AbstractCegarLoop]: === Iteration 6 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1691153396, now seen corresponding path program 1 times [2021-06-05 13:03:12,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:12,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798999219] [2021-06-05 13:03:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:03:12,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:12,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798999219] [2021-06-05 13:03:12,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798999219] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:12,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:12,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:12,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197332483] [2021-06-05 13:03:12,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:12,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:12,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:12,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:12,261 INFO L87 Difference]: Start difference. First operand 9545 states and 34389 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:12,570 INFO L93 Difference]: Finished difference Result 26352 states and 88073 transitions. [2021-06-05 13:03:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:12,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-06-05 13:03:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:12,632 INFO L225 Difference]: With dead ends: 26352 [2021-06-05 13:03:12,633 INFO L226 Difference]: Without dead ends: 25483 [2021-06-05 13:03:12,633 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 50.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25483 states. [2021-06-05 13:03:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25483 to 8957. [2021-06-05 13:03:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8957 states, 8920 states have (on average 3.578699551569507) internal successors, (31922), 8956 states have internal predecessors, (31922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8957 states to 8957 states and 31922 transitions. [2021-06-05 13:03:13,099 INFO L78 Accepts]: Start accepts. Automaton has 8957 states and 31922 transitions. Word has length 9 [2021-06-05 13:03:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:13,099 INFO L482 AbstractCegarLoop]: Abstraction has 8957 states and 31922 transitions. [2021-06-05 13:03:13,099 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8957 states and 31922 transitions. [2021-06-05 13:03:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-05 13:03:13,100 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:13,101 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:13,101 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 13:03:13,101 INFO L430 AbstractCegarLoop]: === Iteration 7 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:13,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash 64579412, now seen corresponding path program 1 times [2021-06-05 13:03:13,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:13,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424535040] [2021-06-05 13:03:13,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:03:13,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:13,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424535040] [2021-06-05 13:03:13,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424535040] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:13,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:13,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:13,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023245893] [2021-06-05 13:03:13,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:13,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:13,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:13,138 INFO L87 Difference]: Start difference. First operand 8957 states and 31922 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:13,500 INFO L93 Difference]: Finished difference Result 26150 states and 86754 transitions. [2021-06-05 13:03:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:13,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-06-05 13:03:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:13,569 INFO L225 Difference]: With dead ends: 26150 [2021-06-05 13:03:13,569 INFO L226 Difference]: Without dead ends: 25254 [2021-06-05 13:03:13,569 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25254 states. [2021-06-05 13:03:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25254 to 8761. [2021-06-05 13:03:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8761 states, 8724 states have (on average 3.543672627235213) internal successors, (30915), 8760 states have internal predecessors, (30915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8761 states to 8761 states and 30915 transitions. [2021-06-05 13:03:13,945 INFO L78 Accepts]: Start accepts. Automaton has 8761 states and 30915 transitions. Word has length 9 [2021-06-05 13:03:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:13,946 INFO L482 AbstractCegarLoop]: Abstraction has 8761 states and 30915 transitions. [2021-06-05 13:03:13,946 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 8761 states and 30915 transitions. [2021-06-05 13:03:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 13:03:13,948 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:13,948 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:13,948 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 13:03:13,948 INFO L430 AbstractCegarLoop]: === Iteration 8 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:13,949 INFO L82 PathProgramCache]: Analyzing trace with hash 886876696, now seen corresponding path program 1 times [2021-06-05 13:03:13,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:13,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483985941] [2021-06-05 13:03:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:03:13,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:13,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483985941] [2021-06-05 13:03:13,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483985941] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:13,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:13,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:13,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972873478] [2021-06-05 13:03:13,991 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:13,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:13,992 INFO L87 Difference]: Start difference. First operand 8761 states and 30915 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:14,377 INFO L93 Difference]: Finished difference Result 24508 states and 81051 transitions. [2021-06-05 13:03:14,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:14,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-06-05 13:03:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:14,423 INFO L225 Difference]: With dead ends: 24508 [2021-06-05 13:03:14,423 INFO L226 Difference]: Without dead ends: 23646 [2021-06-05 13:03:14,424 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 54.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23646 states. [2021-06-05 13:03:14,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23646 to 8055. [2021-06-05 13:03:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8055 states, 8018 states have (on average 3.5016213519580943) internal successors, (28076), 8054 states have internal predecessors, (28076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8055 states to 8055 states and 28076 transitions. [2021-06-05 13:03:14,716 INFO L78 Accepts]: Start accepts. Automaton has 8055 states and 28076 transitions. Word has length 10 [2021-06-05 13:03:14,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:14,716 INFO L482 AbstractCegarLoop]: Abstraction has 8055 states and 28076 transitions. [2021-06-05 13:03:14,716 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8055 states and 28076 transitions. [2021-06-05 13:03:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 13:03:14,718 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:14,719 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:14,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 13:03:14,719 INFO L430 AbstractCegarLoop]: === Iteration 9 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:14,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2002383224, now seen corresponding path program 1 times [2021-06-05 13:03:14,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:14,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849800087] [2021-06-05 13:03:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:03:14,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:14,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849800087] [2021-06-05 13:03:14,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849800087] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:14,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:14,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:14,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203252140] [2021-06-05 13:03:14,748 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:14,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:14,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:14,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:14,748 INFO L87 Difference]: Start difference. First operand 8055 states and 28076 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:14,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:14,941 INFO L93 Difference]: Finished difference Result 23710 states and 77705 transitions. [2021-06-05 13:03:14,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:14,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-06-05 13:03:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:15,012 INFO L225 Difference]: With dead ends: 23710 [2021-06-05 13:03:15,012 INFO L226 Difference]: Without dead ends: 22808 [2021-06-05 13:03:15,012 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 50.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22808 states. [2021-06-05 13:03:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22808 to 7613. [2021-06-05 13:03:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7613 states, 7576 states have (on average 3.4473336853220697) internal successors, (26117), 7612 states have internal predecessors, (26117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7613 states to 7613 states and 26117 transitions. [2021-06-05 13:03:15,355 INFO L78 Accepts]: Start accepts. Automaton has 7613 states and 26117 transitions. Word has length 10 [2021-06-05 13:03:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:15,355 INFO L482 AbstractCegarLoop]: Abstraction has 7613 states and 26117 transitions. [2021-06-05 13:03:15,355 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 7613 states and 26117 transitions. [2021-06-05 13:03:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 13:03:15,358 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:15,358 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:15,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 13:03:15,358 INFO L430 AbstractCegarLoop]: === Iteration 10 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1592798442, now seen corresponding path program 1 times [2021-06-05 13:03:15,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:15,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683965900] [2021-06-05 13:03:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:03:15,393 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:15,393 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683965900] [2021-06-05 13:03:15,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683965900] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:15,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:15,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:15,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762728534] [2021-06-05 13:03:15,393 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:15,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:15,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:15,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:15,394 INFO L87 Difference]: Start difference. First operand 7613 states and 26117 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:15,589 INFO L93 Difference]: Finished difference Result 22263 states and 72314 transitions. [2021-06-05 13:03:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-06-05 13:03:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:15,635 INFO L225 Difference]: With dead ends: 22263 [2021-06-05 13:03:15,635 INFO L226 Difference]: Without dead ends: 21325 [2021-06-05 13:03:15,635 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21325 states. [2021-06-05 13:03:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21325 to 7177. [2021-06-05 13:03:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7140 states have (on average 3.38781512605042) internal successors, (24189), 7176 states have internal predecessors, (24189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 24189 transitions. [2021-06-05 13:03:15,945 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 24189 transitions. Word has length 10 [2021-06-05 13:03:15,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:15,945 INFO L482 AbstractCegarLoop]: Abstraction has 7177 states and 24189 transitions. [2021-06-05 13:03:15,945 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 24189 transitions. [2021-06-05 13:03:15,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-06-05 13:03:15,948 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:15,948 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:15,949 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 13:03:15,949 INFO L430 AbstractCegarLoop]: === Iteration 11 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:15,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:15,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1700786355, now seen corresponding path program 1 times [2021-06-05 13:03:15,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:15,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324664594] [2021-06-05 13:03:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:03:16,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:16,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324664594] [2021-06-05 13:03:16,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324664594] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:16,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:16,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:03:16,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135941462] [2021-06-05 13:03:16,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:03:16,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:16,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:03:16,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:03:16,009 INFO L87 Difference]: Start difference. First operand 7177 states and 24189 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:16,359 INFO L93 Difference]: Finished difference Result 23543 states and 74715 transitions. [2021-06-05 13:03:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:03:16,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-06-05 13:03:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:16,405 INFO L225 Difference]: With dead ends: 23543 [2021-06-05 13:03:16,406 INFO L226 Difference]: Without dead ends: 22323 [2021-06-05 13:03:16,406 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 124.3ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:03:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22323 states. [2021-06-05 13:03:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22323 to 5657. [2021-06-05 13:03:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5657 states, 5627 states have (on average 3.3525857472898526) internal successors, (18865), 5656 states have internal predecessors, (18865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5657 states to 5657 states and 18865 transitions. [2021-06-05 13:03:16,674 INFO L78 Accepts]: Start accepts. Automaton has 5657 states and 18865 transitions. Word has length 11 [2021-06-05 13:03:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:16,674 INFO L482 AbstractCegarLoop]: Abstraction has 5657 states and 18865 transitions. [2021-06-05 13:03:16,674 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 5657 states and 18865 transitions. [2021-06-05 13:03:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-05 13:03:16,677 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:16,677 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:16,678 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 13:03:16,678 INFO L430 AbstractCegarLoop]: === Iteration 12 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:16,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:16,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1185190905, now seen corresponding path program 1 times [2021-06-05 13:03:16,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:16,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892624690] [2021-06-05 13:03:16,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:03:16,721 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:16,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892624690] [2021-06-05 13:03:16,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892624690] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:16,721 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:16,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:03:16,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142361607] [2021-06-05 13:03:16,722 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:03:16,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:16,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:03:16,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:03:16,722 INFO L87 Difference]: Start difference. First operand 5657 states and 18865 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:17,080 INFO L93 Difference]: Finished difference Result 20106 states and 62973 transitions. [2021-06-05 13:03:17,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:03:17,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-06-05 13:03:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:17,126 INFO L225 Difference]: With dead ends: 20106 [2021-06-05 13:03:17,126 INFO L226 Difference]: Without dead ends: 18894 [2021-06-05 13:03:17,127 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 145.8ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:03:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18894 states. [2021-06-05 13:03:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18894 to 4333. [2021-06-05 13:03:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 4303 states have (on average 3.3060655356727864) internal successors, (14226), 4332 states have internal predecessors, (14226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 14226 transitions. [2021-06-05 13:03:17,358 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 14226 transitions. Word has length 12 [2021-06-05 13:03:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:17,358 INFO L482 AbstractCegarLoop]: Abstraction has 4333 states and 14226 transitions. [2021-06-05 13:03:17,358 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 14226 transitions. [2021-06-05 13:03:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-05 13:03:17,360 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:17,360 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:17,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 13:03:17,361 INFO L430 AbstractCegarLoop]: === Iteration 13 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:17,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1884976535, now seen corresponding path program 1 times [2021-06-05 13:03:17,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:17,361 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144192098] [2021-06-05 13:03:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:03:17,409 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:17,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144192098] [2021-06-05 13:03:17,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144192098] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:17,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:17,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:03:17,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769186623] [2021-06-05 13:03:17,410 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:03:17,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:17,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:03:17,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:03:17,410 INFO L87 Difference]: Start difference. First operand 4333 states and 14226 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:17,767 INFO L93 Difference]: Finished difference Result 16054 states and 49388 transitions. [2021-06-05 13:03:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:03:17,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-06-05 13:03:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:17,796 INFO L225 Difference]: With dead ends: 16054 [2021-06-05 13:03:17,796 INFO L226 Difference]: Without dead ends: 14837 [2021-06-05 13:03:17,797 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 126.6ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:03:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14837 states. [2021-06-05 13:03:17,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14837 to 3110. [2021-06-05 13:03:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3110 states, 3080 states have (on average 3.2506493506493506) internal successors, (10012), 3109 states have internal predecessors, (10012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 10012 transitions. [2021-06-05 13:03:17,957 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 10012 transitions. Word has length 12 [2021-06-05 13:03:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:17,957 INFO L482 AbstractCegarLoop]: Abstraction has 3110 states and 10012 transitions. [2021-06-05 13:03:17,957 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 10012 transitions. [2021-06-05 13:03:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-05 13:03:17,959 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:17,960 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:17,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 13:03:17,960 INFO L430 AbstractCegarLoop]: === Iteration 14 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash 144925943, now seen corresponding path program 1 times [2021-06-05 13:03:17,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:17,960 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218406912] [2021-06-05 13:03:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:03:18,010 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:18,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218406912] [2021-06-05 13:03:18,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218406912] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:18,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:18,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:03:18,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303412418] [2021-06-05 13:03:18,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:03:18,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:18,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:03:18,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:03:18,012 INFO L87 Difference]: Start difference. First operand 3110 states and 10012 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:18,307 INFO L93 Difference]: Finished difference Result 11892 states and 35592 transitions. [2021-06-05 13:03:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:03:18,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-06-05 13:03:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:18,328 INFO L225 Difference]: With dead ends: 11892 [2021-06-05 13:03:18,328 INFO L226 Difference]: Without dead ends: 10651 [2021-06-05 13:03:18,328 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 125.4ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:03:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10651 states. [2021-06-05 13:03:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10651 to 2216. [2021-06-05 13:03:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2186 states have (on average 3.0768526989935956) internal successors, (6726), 2215 states have internal predecessors, (6726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 6726 transitions. [2021-06-05 13:03:18,451 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 6726 transitions. Word has length 12 [2021-06-05 13:03:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:18,451 INFO L482 AbstractCegarLoop]: Abstraction has 2216 states and 6726 transitions. [2021-06-05 13:03:18,451 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 6726 transitions. [2021-06-05 13:03:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 13:03:18,453 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:18,453 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:18,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 13:03:18,453 INFO L430 AbstractCegarLoop]: === Iteration 15 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:18,454 INFO L82 PathProgramCache]: Analyzing trace with hash 802122552, now seen corresponding path program 1 times [2021-06-05 13:03:18,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:18,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365839499] [2021-06-05 13:03:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:03:18,516 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:18,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365839499] [2021-06-05 13:03:18,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365839499] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:18,516 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:18,516 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 13:03:18,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545756362] [2021-06-05 13:03:18,517 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:03:18,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:18,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:03:18,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:03:18,517 INFO L87 Difference]: Start difference. First operand 2216 states and 6726 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:18,869 INFO L93 Difference]: Finished difference Result 1403 states and 3952 transitions. [2021-06-05 13:03:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 13:03:18,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 13:03:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:18,869 INFO L225 Difference]: With dead ends: 1403 [2021-06-05 13:03:18,869 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 13:03:18,870 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 223.6ms TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2021-06-05 13:03:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 13:03:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 13:03:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 13:03:18,870 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2021-06-05 13:03:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:18,870 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 13:03:18,870 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 13:03:18,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 13:03:18,870 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 13:03:18,870 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 13:03:18,871 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 13:03:18,871 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:03:18,871 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:03:18,871 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:03:18,871 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:03:18,872 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:03:18,872 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:03:18,872 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:03:18,872 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 13:03:18,872 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 86 flow [2021-06-05 13:03:19,022 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4407 states, 4360 states have (on average 3.963532110091743) internal successors, (17281), 4406 states have internal predecessors, (17281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 4407 states, 4360 states have (on average 3.963532110091743) internal successors, (17281), 4406 states have internal predecessors, (17281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 13:03:19,027 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:19,027 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 13:03:19,027 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 13:03:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1160997765, now seen corresponding path program 1 times [2021-06-05 13:03:19,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:19,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214422371] [2021-06-05 13:03:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 13:03:19,030 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 13:03:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 13:03:19,031 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 13:03:19,032 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 13:03:19,032 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 13:03:19,032 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 13:03:19,032 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 13:03:19,032 WARN L242 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 13:03:19,032 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2021-06-05 13:03:19,036 WARN L313 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,037 WARN L313 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,037 WARN L313 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,037 WARN L313 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,037 WARN L313 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,037 WARN L313 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,037 WARN L313 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,037 WARN L313 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,038 WARN L313 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,038 WARN L313 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,038 WARN L313 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,038 WARN L313 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,038 WARN L313 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,038 WARN L313 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,038 WARN L313 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,039 WARN L313 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,039 WARN L313 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,039 WARN L313 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,039 WARN L313 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,039 WARN L313 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,040 WARN L313 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,041 WARN L313 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,042 WARN L313 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,043 WARN L313 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,043 WARN L313 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:03:19,044 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 13:03:19,044 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 13:03:19,045 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:03:19,045 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:03:19,045 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:03:19,045 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:03:19,045 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:03:19,045 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:03:19,045 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:03:19,045 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 13:03:19,046 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 33 transitions, 111 flow [2021-06-05 13:03:23,362 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26439 states, 26344 states have (on average 4.771978439113271) internal successors, (125713), 26438 states have internal predecessors, (125713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 26439 states, 26344 states have (on average 4.771978439113271) internal successors, (125713), 26438 states have internal predecessors, (125713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-06-05 13:03:23,405 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:23,405 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-06-05 13:03:23,405 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:23,405 INFO L82 PathProgramCache]: Analyzing trace with hash 132714962, now seen corresponding path program 1 times [2021-06-05 13:03:23,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:23,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508289157] [2021-06-05 13:03:23,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 13:03:23,424 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:23,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508289157] [2021-06-05 13:03:23,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508289157] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:23,424 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:23,424 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:23,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974308571] [2021-06-05 13:03:23,424 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:23,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:23,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:23,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:23,468 INFO L87 Difference]: Start difference. First operand has 26439 states, 26344 states have (on average 4.771978439113271) internal successors, (125713), 26438 states have internal predecessors, (125713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:24,018 INFO L93 Difference]: Finished difference Result 82189 states and 355977 transitions. [2021-06-05 13:03:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:24,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-06-05 13:03:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:24,290 INFO L225 Difference]: With dead ends: 82189 [2021-06-05 13:03:24,290 INFO L226 Difference]: Without dead ends: 79945 [2021-06-05 13:03:24,290 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79945 states. [2021-06-05 13:03:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79945 to 45471. [2021-06-05 13:03:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45471 states, 45384 states have (on average 4.531883483165873) internal successors, (205675), 45470 states have internal predecessors, (205675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45471 states to 45471 states and 205675 transitions. [2021-06-05 13:03:26,722 INFO L78 Accepts]: Start accepts. Automaton has 45471 states and 205675 transitions. Word has length 5 [2021-06-05 13:03:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:26,722 INFO L482 AbstractCegarLoop]: Abstraction has 45471 states and 205675 transitions. [2021-06-05 13:03:26,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 45471 states and 205675 transitions. [2021-06-05 13:03:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 13:03:26,722 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:26,722 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 13:03:26,722 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 13:03:26,723 INFO L430 AbstractCegarLoop]: === Iteration 2 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:26,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:26,723 INFO L82 PathProgramCache]: Analyzing trace with hash -179995026, now seen corresponding path program 1 times [2021-06-05 13:03:26,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:26,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921093260] [2021-06-05 13:03:26,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 13:03:26,742 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:26,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921093260] [2021-06-05 13:03:26,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921093260] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:26,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:26,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:26,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225660396] [2021-06-05 13:03:26,743 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:26,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:26,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:26,743 INFO L87 Difference]: Start difference. First operand 45471 states and 205675 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:27,358 INFO L93 Difference]: Finished difference Result 102730 states and 442097 transitions. [2021-06-05 13:03:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:27,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-06-05 13:03:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:28,388 INFO L225 Difference]: With dead ends: 102730 [2021-06-05 13:03:28,388 INFO L226 Difference]: Without dead ends: 101619 [2021-06-05 13:03:28,388 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101619 states. [2021-06-05 13:03:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101619 to 54544. [2021-06-05 13:03:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54544 states, 54457 states have (on average 4.518647740419047) internal successors, (246072), 54543 states have internal predecessors, (246072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54544 states to 54544 states and 246072 transitions. [2021-06-05 13:03:31,906 INFO L78 Accepts]: Start accepts. Automaton has 54544 states and 246072 transitions. Word has length 6 [2021-06-05 13:03:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:31,907 INFO L482 AbstractCegarLoop]: Abstraction has 54544 states and 246072 transitions. [2021-06-05 13:03:31,907 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 54544 states and 246072 transitions. [2021-06-05 13:03:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 13:03:31,909 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:31,909 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:31,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 13:03:31,910 INFO L430 AbstractCegarLoop]: === Iteration 3 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:31,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:31,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1284189221, now seen corresponding path program 1 times [2021-06-05 13:03:31,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:31,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036716057] [2021-06-05 13:03:31,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:03:31,937 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:31,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036716057] [2021-06-05 13:03:31,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036716057] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:31,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:31,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:31,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200082789] [2021-06-05 13:03:31,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:31,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:31,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:31,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:31,938 INFO L87 Difference]: Start difference. First operand 54544 states and 246072 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:33,180 INFO L93 Difference]: Finished difference Result 123655 states and 532236 transitions. [2021-06-05 13:03:33,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:33,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-06-05 13:03:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:33,650 INFO L225 Difference]: With dead ends: 123655 [2021-06-05 13:03:33,650 INFO L226 Difference]: Without dead ends: 122191 [2021-06-05 13:03:33,650 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122191 states. [2021-06-05 13:03:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122191 to 65495. [2021-06-05 13:03:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65495 states, 65408 states have (on average 4.504433708414873) internal successors, (294626), 65494 states have internal predecessors, (294626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65495 states to 65495 states and 294626 transitions. [2021-06-05 13:03:37,504 INFO L78 Accepts]: Start accepts. Automaton has 65495 states and 294626 transitions. Word has length 7 [2021-06-05 13:03:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:37,504 INFO L482 AbstractCegarLoop]: Abstraction has 65495 states and 294626 transitions. [2021-06-05 13:03:37,504 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 65495 states and 294626 transitions. [2021-06-05 13:03:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 13:03:37,505 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:37,505 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:37,505 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 13:03:37,505 INFO L430 AbstractCegarLoop]: === Iteration 4 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:37,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1952581718, now seen corresponding path program 1 times [2021-06-05 13:03:37,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:37,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255592815] [2021-06-05 13:03:37,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 13:03:37,541 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:37,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255592815] [2021-06-05 13:03:37,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255592815] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:37,542 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:37,542 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:37,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900738666] [2021-06-05 13:03:37,542 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:37,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:37,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:37,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:37,542 INFO L87 Difference]: Start difference. First operand 65495 states and 294626 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:39,194 INFO L93 Difference]: Finished difference Result 187030 states and 791770 transitions. [2021-06-05 13:03:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-06-05 13:03:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:40,470 INFO L225 Difference]: With dead ends: 187030 [2021-06-05 13:03:40,470 INFO L226 Difference]: Without dead ends: 185014 [2021-06-05 13:03:40,470 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 54.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185014 states. [2021-06-05 13:03:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185014 to 63358. [2021-06-05 13:03:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63358 states, 63274 states have (on average 4.496807535480608) internal successors, (284531), 63357 states have internal predecessors, (284531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63358 states to 63358 states and 284531 transitions. [2021-06-05 13:03:44,829 INFO L78 Accepts]: Start accepts. Automaton has 63358 states and 284531 transitions. Word has length 8 [2021-06-05 13:03:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:44,829 INFO L482 AbstractCegarLoop]: Abstraction has 63358 states and 284531 transitions. [2021-06-05 13:03:44,830 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 63358 states and 284531 transitions. [2021-06-05 13:03:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 13:03:44,830 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:44,830 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:44,830 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 13:03:44,830 INFO L430 AbstractCegarLoop]: === Iteration 5 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1154585092, now seen corresponding path program 1 times [2021-06-05 13:03:44,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:44,831 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572747709] [2021-06-05 13:03:44,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:03:44,850 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:44,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572747709] [2021-06-05 13:03:44,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572747709] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:44,851 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:44,851 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:03:44,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757882408] [2021-06-05 13:03:44,851 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:03:44,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:44,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:03:44,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:03:44,851 INFO L87 Difference]: Start difference. First operand 63358 states and 284531 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:46,429 INFO L93 Difference]: Finished difference Result 143649 states and 617169 transitions. [2021-06-05 13:03:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:03:46,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-06-05 13:03:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:46,991 INFO L225 Difference]: With dead ends: 143649 [2021-06-05 13:03:46,991 INFO L226 Difference]: Without dead ends: 141764 [2021-06-05 13:03:46,991 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141764 states. [2021-06-05 13:03:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141764 to 75713. [2021-06-05 13:03:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75713 states, 75629 states have (on average 4.479538272355843) internal successors, (338783), 75712 states have internal predecessors, (338783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75713 states to 75713 states and 338783 transitions. [2021-06-05 13:03:51,432 INFO L78 Accepts]: Start accepts. Automaton has 75713 states and 338783 transitions. Word has length 8 [2021-06-05 13:03:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:03:51,432 INFO L482 AbstractCegarLoop]: Abstraction has 75713 states and 338783 transitions. [2021-06-05 13:03:51,432 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 75713 states and 338783 transitions. [2021-06-05 13:03:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-05 13:03:51,433 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:03:51,433 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:03:51,433 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 13:03:51,433 INFO L430 AbstractCegarLoop]: === Iteration 6 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:03:51,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:03:51,434 INFO L82 PathProgramCache]: Analyzing trace with hash -399801670, now seen corresponding path program 1 times [2021-06-05 13:03:51,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:03:51,434 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501237162] [2021-06-05 13:03:51,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:03:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:03:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:03:51,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:03:51,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501237162] [2021-06-05 13:03:51,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501237162] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:03:51,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:03:51,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:03:51,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744442677] [2021-06-05 13:03:51,476 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:03:51,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:03:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:03:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:03:51,477 INFO L87 Difference]: Start difference. First operand 75713 states and 338783 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:03:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:03:53,547 INFO L93 Difference]: Finished difference Result 231785 states and 976296 transitions. [2021-06-05 13:03:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:03:53,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-06-05 13:03:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:03:55,192 INFO L225 Difference]: With dead ends: 231785 [2021-06-05 13:03:55,192 INFO L226 Difference]: Without dead ends: 229016 [2021-06-05 13:03:55,192 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:03:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229016 states. [2021-06-05 13:04:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229016 to 75409. [2021-06-05 13:04:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75409 states, 75325 states have (on average 4.467122469299701) internal successors, (336486), 75408 states have internal predecessors, (336486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75409 states to 75409 states and 336486 transitions. [2021-06-05 13:04:01,287 INFO L78 Accepts]: Start accepts. Automaton has 75409 states and 336486 transitions. Word has length 9 [2021-06-05 13:04:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:04:01,287 INFO L482 AbstractCegarLoop]: Abstraction has 75409 states and 336486 transitions. [2021-06-05 13:04:01,287 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 75409 states and 336486 transitions. [2021-06-05 13:04:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-05 13:04:01,289 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:04:01,289 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:04:01,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 13:04:01,289 INFO L430 AbstractCegarLoop]: === Iteration 7 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:04:01,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:04:01,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1432107393, now seen corresponding path program 1 times [2021-06-05 13:04:01,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:04:01,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725542357] [2021-06-05 13:04:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:04:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:04:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:04:01,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:04:01,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725542357] [2021-06-05 13:04:01,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725542357] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:04:01,309 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:04:01,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:04:01,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357875019] [2021-06-05 13:04:01,310 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:04:01,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:04:01,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:04:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:04:01,310 INFO L87 Difference]: Start difference. First operand 75409 states and 336486 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:04:02,961 INFO L93 Difference]: Finished difference Result 162426 states and 697579 transitions. [2021-06-05 13:04:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:04:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-06-05 13:04:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:04:03,573 INFO L225 Difference]: With dead ends: 162426 [2021-06-05 13:04:03,573 INFO L226 Difference]: Without dead ends: 160090 [2021-06-05 13:04:03,573 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:04:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160090 states. [2021-06-05 13:04:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160090 to 88482. [2021-06-05 13:04:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88482 states, 88398 states have (on average 4.451503427679359) internal successors, (393504), 88481 states have internal predecessors, (393504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88482 states to 88482 states and 393504 transitions. [2021-06-05 13:04:08,568 INFO L78 Accepts]: Start accepts. Automaton has 88482 states and 393504 transitions. Word has length 9 [2021-06-05 13:04:08,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:04:08,568 INFO L482 AbstractCegarLoop]: Abstraction has 88482 states and 393504 transitions. [2021-06-05 13:04:08,568 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 88482 states and 393504 transitions. [2021-06-05 13:04:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-05 13:04:08,570 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:04:08,570 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:04:08,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 13:04:08,570 INFO L430 AbstractCegarLoop]: === Iteration 8 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:04:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:04:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1454991846, now seen corresponding path program 1 times [2021-06-05 13:04:08,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:04:08,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368474802] [2021-06-05 13:04:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:04:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:04:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:04:08,614 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:04:08,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368474802] [2021-06-05 13:04:08,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368474802] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:04:08,615 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:04:08,615 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:04:08,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520396371] [2021-06-05 13:04:08,615 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:04:08,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:04:08,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:04:08,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:04:08,615 INFO L87 Difference]: Start difference. First operand 88482 states and 393504 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:04:10,928 INFO L93 Difference]: Finished difference Result 278936 states and 1168949 transitions. [2021-06-05 13:04:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:04:10,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-06-05 13:04:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:04:12,628 INFO L225 Difference]: With dead ends: 278936 [2021-06-05 13:04:12,628 INFO L226 Difference]: Without dead ends: 275262 [2021-06-05 13:04:12,628 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:04:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275262 states. [2021-06-05 13:04:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275262 to 90975. [2021-06-05 13:04:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90975 states, 90891 states have (on average 4.444158387519116) internal successors, (403934), 90974 states have internal predecessors, (403934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90975 states to 90975 states and 403934 transitions. [2021-06-05 13:04:19,339 INFO L78 Accepts]: Start accepts. Automaton has 90975 states and 403934 transitions. Word has length 9 [2021-06-05 13:04:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:04:19,339 INFO L482 AbstractCegarLoop]: Abstraction has 90975 states and 403934 transitions. [2021-06-05 13:04:19,339 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 90975 states and 403934 transitions. [2021-06-05 13:04:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 13:04:19,341 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:04:19,342 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:04:19,342 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 13:04:19,342 INFO L430 AbstractCegarLoop]: === Iteration 9 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:04:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:04:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash 491625193, now seen corresponding path program 1 times [2021-06-05 13:04:19,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:04:19,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004286025] [2021-06-05 13:04:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:04:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:04:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:04:19,371 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:04:19,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004286025] [2021-06-05 13:04:19,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004286025] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:04:19,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:04:19,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:04:19,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927377343] [2021-06-05 13:04:19,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:04:19,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:04:19,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:04:19,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:04:19,373 INFO L87 Difference]: Start difference. First operand 90975 states and 403934 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:04:21,690 INFO L93 Difference]: Finished difference Result 270752 states and 1134193 transitions. [2021-06-05 13:04:21,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:04:21,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-06-05 13:04:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:04:23,498 INFO L225 Difference]: With dead ends: 270752 [2021-06-05 13:04:23,498 INFO L226 Difference]: Without dead ends: 267119 [2021-06-05 13:04:23,498 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:04:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267119 states. [2021-06-05 13:04:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267119 to 89256. [2021-06-05 13:04:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89256 states, 89172 states have (on average 4.4259072354550755) internal successors, (394667), 89255 states have internal predecessors, (394667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89256 states to 89256 states and 394667 transitions. [2021-06-05 13:04:30,440 INFO L78 Accepts]: Start accepts. Automaton has 89256 states and 394667 transitions. Word has length 10 [2021-06-05 13:04:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:04:30,440 INFO L482 AbstractCegarLoop]: Abstraction has 89256 states and 394667 transitions. [2021-06-05 13:04:30,440 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 89256 states and 394667 transitions. [2021-06-05 13:04:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 13:04:30,444 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:04:30,444 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:04:30,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 13:04:30,444 INFO L430 AbstractCegarLoop]: === Iteration 10 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:04:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:04:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1454723461, now seen corresponding path program 1 times [2021-06-05 13:04:30,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:04:30,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097277988] [2021-06-05 13:04:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:04:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:04:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:04:30,472 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:04:30,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097277988] [2021-06-05 13:04:30,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097277988] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:04:30,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:04:30,473 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:04:30,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844886076] [2021-06-05 13:04:30,473 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:04:30,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:04:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:04:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:04:30,473 INFO L87 Difference]: Start difference. First operand 89256 states and 394667 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:04:33,351 INFO L93 Difference]: Finished difference Result 279914 states and 1169550 transitions. [2021-06-05 13:04:33,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:04:33,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-06-05 13:04:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:04:35,634 INFO L225 Difference]: With dead ends: 279914 [2021-06-05 13:04:35,635 INFO L226 Difference]: Without dead ends: 276195 [2021-06-05 13:04:35,635 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:04:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276195 states. [2021-06-05 13:04:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276195 to 90671. [2021-06-05 13:04:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90671 states, 90587 states have (on average 4.412211465221279) internal successors, (399689), 90670 states have internal predecessors, (399689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90671 states to 90671 states and 399689 transitions. [2021-06-05 13:04:42,636 INFO L78 Accepts]: Start accepts. Automaton has 90671 states and 399689 transitions. Word has length 10 [2021-06-05 13:04:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:04:42,636 INFO L482 AbstractCegarLoop]: Abstraction has 90671 states and 399689 transitions. [2021-06-05 13:04:42,636 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 90671 states and 399689 transitions. [2021-06-05 13:04:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 13:04:42,639 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:04:42,640 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:04:42,640 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 13:04:42,640 INFO L430 AbstractCegarLoop]: === Iteration 11 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:04:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:04:42,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1454718511, now seen corresponding path program 1 times [2021-06-05 13:04:42,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:04:42,640 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433655513] [2021-06-05 13:04:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:04:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:04:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:04:42,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:04:42,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433655513] [2021-06-05 13:04:42,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433655513] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:04:42,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:04:42,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:04:42,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744219542] [2021-06-05 13:04:42,665 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:04:42,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:04:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:04:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:04:42,665 INFO L87 Difference]: Start difference. First operand 90671 states and 399689 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:04:45,866 INFO L93 Difference]: Finished difference Result 280953 states and 1172515 transitions. [2021-06-05 13:04:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:04:45,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-06-05 13:04:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:04:46,924 INFO L225 Difference]: With dead ends: 280953 [2021-06-05 13:04:46,924 INFO L226 Difference]: Without dead ends: 277121 [2021-06-05 13:04:46,924 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:04:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277121 states. [2021-06-05 13:04:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277121 to 92503. [2021-06-05 13:04:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92503 states, 92419 states have (on average 4.401270301561367) internal successors, (406761), 92502 states have internal predecessors, (406761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92503 states to 92503 states and 406761 transitions. [2021-06-05 13:04:53,515 INFO L78 Accepts]: Start accepts. Automaton has 92503 states and 406761 transitions. Word has length 10 [2021-06-05 13:04:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:04:53,515 INFO L482 AbstractCegarLoop]: Abstraction has 92503 states and 406761 transitions. [2021-06-05 13:04:53,515 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 92503 states and 406761 transitions. [2021-06-05 13:04:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-06-05 13:04:53,519 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:04:53,519 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:04:53,519 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 13:04:53,519 INFO L430 AbstractCegarLoop]: === Iteration 12 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:04:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:04:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1939195490, now seen corresponding path program 1 times [2021-06-05 13:04:53,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:04:53,519 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025103156] [2021-06-05 13:04:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:04:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:04:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:04:53,551 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:04:53,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025103156] [2021-06-05 13:04:53,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025103156] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:04:53,552 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:04:53,552 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:04:53,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223174729] [2021-06-05 13:04:53,552 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:04:53,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:04:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:04:53,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:04:53,553 INFO L87 Difference]: Start difference. First operand 92503 states and 406761 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:04:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:04:56,902 INFO L93 Difference]: Finished difference Result 269252 states and 1123617 transitions. [2021-06-05 13:04:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:04:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-06-05 13:04:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:04:57,865 INFO L225 Difference]: With dead ends: 269252 [2021-06-05 13:04:57,866 INFO L226 Difference]: Without dead ends: 265684 [2021-06-05 13:04:57,866 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:05:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265684 states. [2021-06-05 13:05:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265684 to 89852. [2021-06-05 13:05:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89852 states, 89768 states have (on average 4.375512432047055) internal successors, (392781), 89851 states have internal predecessors, (392781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89852 states to 89852 states and 392781 transitions. [2021-06-05 13:05:04,352 INFO L78 Accepts]: Start accepts. Automaton has 89852 states and 392781 transitions. Word has length 11 [2021-06-05 13:05:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:05:04,352 INFO L482 AbstractCegarLoop]: Abstraction has 89852 states and 392781 transitions. [2021-06-05 13:05:04,352 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 89852 states and 392781 transitions. [2021-06-05 13:05:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-06-05 13:05:04,357 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:05:04,357 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:05:04,357 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 13:05:04,357 INFO L430 AbstractCegarLoop]: === Iteration 13 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:05:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:05:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1962079943, now seen corresponding path program 1 times [2021-06-05 13:05:04,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:05:04,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224851719] [2021-06-05 13:05:04,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:05:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:05:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:05:04,413 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:05:04,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224851719] [2021-06-05 13:05:04,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224851719] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:05:04,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:05:04,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:05:04,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024156340] [2021-06-05 13:05:04,414 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:05:04,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:05:04,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:05:04,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:05:04,415 INFO L87 Difference]: Start difference. First operand 89852 states and 392781 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:05:08,301 INFO L93 Difference]: Finished difference Result 370534 states and 1506849 transitions. [2021-06-05 13:05:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:05:08,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-06-05 13:05:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:05:10,458 INFO L225 Difference]: With dead ends: 370534 [2021-06-05 13:05:10,458 INFO L226 Difference]: Without dead ends: 365564 [2021-06-05 13:05:10,458 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 123.5ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:05:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365564 states. [2021-06-05 13:05:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365564 to 83714. [2021-06-05 13:05:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83714 states, 83637 states have (on average 4.360223346126714) internal successors, (364676), 83713 states have internal predecessors, (364676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83714 states to 83714 states and 364676 transitions. [2021-06-05 13:05:18,581 INFO L78 Accepts]: Start accepts. Automaton has 83714 states and 364676 transitions. Word has length 11 [2021-06-05 13:05:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:05:18,581 INFO L482 AbstractCegarLoop]: Abstraction has 83714 states and 364676 transitions. [2021-06-05 13:05:18,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 83714 states and 364676 transitions. [2021-06-05 13:05:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-06-05 13:05:18,587 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:05:18,587 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:05:18,587 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 13:05:18,587 INFO L430 AbstractCegarLoop]: === Iteration 14 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:05:18,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:05:18,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1865662690, now seen corresponding path program 1 times [2021-06-05 13:05:18,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:05:18,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265226508] [2021-06-05 13:05:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:05:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:05:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:05:18,618 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:05:18,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265226508] [2021-06-05 13:05:18,618 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265226508] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:05:18,618 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:05:18,618 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:05:18,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355392897] [2021-06-05 13:05:18,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:05:18,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:05:18,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:05:18,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:05:18,619 INFO L87 Difference]: Start difference. First operand 83714 states and 364676 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:05:21,878 INFO L93 Difference]: Finished difference Result 259831 states and 1077121 transitions. [2021-06-05 13:05:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:05:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-06-05 13:05:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:05:22,841 INFO L225 Difference]: With dead ends: 259831 [2021-06-05 13:05:22,841 INFO L226 Difference]: Without dead ends: 256133 [2021-06-05 13:05:22,842 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:05:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256133 states. [2021-06-05 13:05:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256133 to 82847. [2021-06-05 13:05:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82847 states, 82770 states have (on average 4.336909508275945) internal successors, (358966), 82846 states have internal predecessors, (358966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82847 states to 82847 states and 358966 transitions. [2021-06-05 13:05:29,139 INFO L78 Accepts]: Start accepts. Automaton has 82847 states and 358966 transitions. Word has length 11 [2021-06-05 13:05:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:05:29,139 INFO L482 AbstractCegarLoop]: Abstraction has 82847 states and 358966 transitions. [2021-06-05 13:05:29,139 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 82847 states and 358966 transitions. [2021-06-05 13:05:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-06-05 13:05:29,145 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:05:29,145 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:05:29,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 13:05:29,145 INFO L430 AbstractCegarLoop]: === Iteration 15 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:05:29,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:05:29,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1865677570, now seen corresponding path program 1 times [2021-06-05 13:05:29,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:05:29,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367938075] [2021-06-05 13:05:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:05:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:05:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:05:29,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:05:29,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367938075] [2021-06-05 13:05:29,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367938075] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:05:29,171 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:05:29,171 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:05:29,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029165155] [2021-06-05 13:05:29,171 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:05:29,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:05:29,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:05:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:05:29,171 INFO L87 Difference]: Start difference. First operand 82847 states and 358966 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:05:31,391 INFO L93 Difference]: Finished difference Result 260729 states and 1076895 transitions. [2021-06-05 13:05:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:05:31,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-06-05 13:05:31,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:05:32,947 INFO L225 Difference]: With dead ends: 260729 [2021-06-05 13:05:32,948 INFO L226 Difference]: Without dead ends: 256921 [2021-06-05 13:05:32,948 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:05:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256921 states. [2021-06-05 13:05:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256921 to 83566. [2021-06-05 13:05:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83566 states, 83489 states have (on average 4.314388721867552) internal successors, (360204), 83565 states have internal predecessors, (360204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83566 states to 83566 states and 360204 transitions. [2021-06-05 13:05:38,520 INFO L78 Accepts]: Start accepts. Automaton has 83566 states and 360204 transitions. Word has length 11 [2021-06-05 13:05:38,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:05:38,520 INFO L482 AbstractCegarLoop]: Abstraction has 83566 states and 360204 transitions. [2021-06-05 13:05:38,520 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 83566 states and 360204 transitions. [2021-06-05 13:05:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-06-05 13:05:38,526 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:05:38,526 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:05:38,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 13:05:38,526 INFO L430 AbstractCegarLoop]: === Iteration 16 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:05:38,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:05:38,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1865672615, now seen corresponding path program 1 times [2021-06-05 13:05:38,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:05:38,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096992142] [2021-06-05 13:05:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:05:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:05:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:05:38,564 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:05:38,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096992142] [2021-06-05 13:05:38,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096992142] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:05:38,564 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:05:38,564 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:05:38,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704717941] [2021-06-05 13:05:38,564 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:05:38,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:05:38,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:05:38,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:05:38,565 INFO L87 Difference]: Start difference. First operand 83566 states and 360204 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:05:41,722 INFO L93 Difference]: Finished difference Result 257393 states and 1059330 transitions. [2021-06-05 13:05:41,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:05:41,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-06-05 13:05:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:05:43,685 INFO L225 Difference]: With dead ends: 257393 [2021-06-05 13:05:43,685 INFO L226 Difference]: Without dead ends: 253405 [2021-06-05 13:05:43,685 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 13:05:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253405 states. [2021-06-05 13:05:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253405 to 83379. [2021-06-05 13:05:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83379 states, 83302 states have (on average 4.286991908957768) internal successors, (357115), 83378 states have internal predecessors, (357115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83379 states to 83379 states and 357115 transitions. [2021-06-05 13:05:50,593 INFO L78 Accepts]: Start accepts. Automaton has 83379 states and 357115 transitions. Word has length 11 [2021-06-05 13:05:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:05:50,593 INFO L482 AbstractCegarLoop]: Abstraction has 83379 states and 357115 transitions. [2021-06-05 13:05:50,593 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 83379 states and 357115 transitions. [2021-06-05 13:05:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-05 13:05:50,619 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:05:50,620 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:05:50,620 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 13:05:50,620 INFO L430 AbstractCegarLoop]: === Iteration 17 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:05:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:05:50,620 INFO L82 PathProgramCache]: Analyzing trace with hash 5414696, now seen corresponding path program 1 times [2021-06-05 13:05:50,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:05:50,620 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377587428] [2021-06-05 13:05:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:05:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:05:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:05:50,683 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:05:50,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377587428] [2021-06-05 13:05:50,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377587428] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:05:50,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:05:50,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:05:50,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972877157] [2021-06-05 13:05:50,684 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:05:50,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:05:50,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:05:50,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:05:50,684 INFO L87 Difference]: Start difference. First operand 83379 states and 357115 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:05:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:05:53,623 INFO L93 Difference]: Finished difference Result 356804 states and 1435303 transitions. [2021-06-05 13:05:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:05:53,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-06-05 13:05:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:05:55,635 INFO L225 Difference]: With dead ends: 356804 [2021-06-05 13:05:55,635 INFO L226 Difference]: Without dead ends: 351485 [2021-06-05 13:05:55,635 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 136.7ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:05:58,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351485 states. [2021-06-05 13:06:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351485 to 77868. [2021-06-05 13:06:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77868 states, 77791 states have (on average 4.26617475029245) internal successors, (331870), 77867 states have internal predecessors, (331870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77868 states to 77868 states and 331870 transitions. [2021-06-05 13:06:03,525 INFO L78 Accepts]: Start accepts. Automaton has 77868 states and 331870 transitions. Word has length 12 [2021-06-05 13:06:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:06:03,525 INFO L482 AbstractCegarLoop]: Abstraction has 77868 states and 331870 transitions. [2021-06-05 13:06:03,525 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 77868 states and 331870 transitions. [2021-06-05 13:06:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-05 13:06:03,534 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:06:03,534 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:06:03,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 13:06:03,535 INFO L430 AbstractCegarLoop]: === Iteration 18 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:06:03,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:06:03,535 INFO L82 PathProgramCache]: Analyzing trace with hash 5419666, now seen corresponding path program 1 times [2021-06-05 13:06:03,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:06:03,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792338389] [2021-06-05 13:06:03,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:06:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:06:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:06:03,571 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:06:03,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792338389] [2021-06-05 13:06:03,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792338389] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:06:03,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:06:03,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:06:03,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748541975] [2021-06-05 13:06:03,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:06:03,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:06:03,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:06:03,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:06:03,572 INFO L87 Difference]: Start difference. First operand 77868 states and 331870 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:06:07,007 INFO L93 Difference]: Finished difference Result 339105 states and 1358962 transitions. [2021-06-05 13:06:07,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:06:07,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-06-05 13:06:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:06:08,303 INFO L225 Difference]: With dead ends: 339105 [2021-06-05 13:06:08,303 INFO L226 Difference]: Without dead ends: 333759 [2021-06-05 13:06:08,303 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 108.5ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:06:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333759 states. [2021-06-05 13:06:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333759 to 72322. [2021-06-05 13:06:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72322 states, 72245 states have (on average 4.2454149076060625) internal successors, (306710), 72321 states have internal predecessors, (306710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72322 states to 72322 states and 306710 transitions. [2021-06-05 13:06:15,368 INFO L78 Accepts]: Start accepts. Automaton has 72322 states and 306710 transitions. Word has length 12 [2021-06-05 13:06:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:06:15,368 INFO L482 AbstractCegarLoop]: Abstraction has 72322 states and 306710 transitions. [2021-06-05 13:06:15,368 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 72322 states and 306710 transitions. [2021-06-05 13:06:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-05 13:06:15,382 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:06:15,382 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:06:15,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 13:06:15,382 INFO L430 AbstractCegarLoop]: === Iteration 19 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:06:15,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:06:15,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2124882288, now seen corresponding path program 1 times [2021-06-05 13:06:15,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:06:15,383 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709081250] [2021-06-05 13:06:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:06:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:06:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:06:15,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:06:15,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709081250] [2021-06-05 13:06:15,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709081250] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:06:15,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:06:15,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:06:15,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923202272] [2021-06-05 13:06:15,420 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:06:15,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:06:15,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:06:15,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:06:15,420 INFO L87 Difference]: Start difference. First operand 72322 states and 306710 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:06:18,861 INFO L93 Difference]: Finished difference Result 321356 states and 1283269 transitions. [2021-06-05 13:06:18,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:06:18,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-06-05 13:06:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:06:20,106 INFO L225 Difference]: With dead ends: 321356 [2021-06-05 13:06:20,106 INFO L226 Difference]: Without dead ends: 315983 [2021-06-05 13:06:20,107 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 110.1ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:06:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315983 states. [2021-06-05 13:06:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315983 to 68218. [2021-06-05 13:06:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68218 states, 68141 states have (on average 4.221247119942472) internal successors, (287640), 68217 states have internal predecessors, (287640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68218 states to 68218 states and 287640 transitions. [2021-06-05 13:06:27,231 INFO L78 Accepts]: Start accepts. Automaton has 68218 states and 287640 transitions. Word has length 12 [2021-06-05 13:06:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:06:27,231 INFO L482 AbstractCegarLoop]: Abstraction has 68218 states and 287640 transitions. [2021-06-05 13:06:27,231 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 68218 states and 287640 transitions. [2021-06-05 13:06:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-06-05 13:06:27,266 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:06:27,267 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:06:27,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 13:06:27,267 INFO L430 AbstractCegarLoop]: === Iteration 20 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:06:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:06:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash 448947837, now seen corresponding path program 1 times [2021-06-05 13:06:27,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:06:27,267 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98269768] [2021-06-05 13:06:27,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:06:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:06:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:06:27,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:06:27,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98269768] [2021-06-05 13:06:27,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98269768] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:06:27,333 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:06:27,333 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:06:27,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096647549] [2021-06-05 13:06:27,333 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:06:27,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:06:27,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:06:27,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:06:27,334 INFO L87 Difference]: Start difference. First operand 68218 states and 287640 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:06:29,939 INFO L93 Difference]: Finished difference Result 305988 states and 1218772 transitions. [2021-06-05 13:06:29,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:06:29,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-06-05 13:06:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:06:30,937 INFO L225 Difference]: With dead ends: 305988 [2021-06-05 13:06:30,937 INFO L226 Difference]: Without dead ends: 300732 [2021-06-05 13:06:30,938 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 153.5ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:06:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300732 states. [2021-06-05 13:06:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300732 to 63112. [2021-06-05 13:06:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63112 states, 63035 states have (on average 4.1858015388276355) internal successors, (263852), 63111 states have internal predecessors, (263852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63112 states to 63112 states and 263852 transitions. [2021-06-05 13:06:37,660 INFO L78 Accepts]: Start accepts. Automaton has 63112 states and 263852 transitions. Word has length 13 [2021-06-05 13:06:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:06:37,660 INFO L482 AbstractCegarLoop]: Abstraction has 63112 states and 263852 transitions. [2021-06-05 13:06:37,660 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 63112 states and 263852 transitions. [2021-06-05 13:06:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-06-05 13:06:37,677 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:06:37,677 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:06:37,677 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 13:06:37,677 INFO L430 AbstractCegarLoop]: === Iteration 21 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:06:37,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:06:37,679 INFO L82 PathProgramCache]: Analyzing trace with hash 448932957, now seen corresponding path program 1 times [2021-06-05 13:06:37,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:06:37,679 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299324079] [2021-06-05 13:06:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:06:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:06:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:06:37,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:06:37,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299324079] [2021-06-05 13:06:37,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299324079] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:06:37,754 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:06:37,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:06:37,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26675812] [2021-06-05 13:06:37,755 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:06:37,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:06:37,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:06:37,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:06:37,755 INFO L87 Difference]: Start difference. First operand 63112 states and 263852 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:06:40,174 INFO L93 Difference]: Finished difference Result 291730 states and 1155962 transitions. [2021-06-05 13:06:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:06:40,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-06-05 13:06:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:06:41,095 INFO L225 Difference]: With dead ends: 291730 [2021-06-05 13:06:41,095 INFO L226 Difference]: Without dead ends: 286467 [2021-06-05 13:06:41,096 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 142.2ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:06:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286467 states. [2021-06-05 13:06:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286467 to 58344. [2021-06-05 13:06:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58344 states, 58267 states have (on average 4.152161600906173) internal successors, (241934), 58343 states have internal predecessors, (241934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58344 states to 58344 states and 241934 transitions. [2021-06-05 13:06:46,960 INFO L78 Accepts]: Start accepts. Automaton has 58344 states and 241934 transitions. Word has length 13 [2021-06-05 13:06:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:06:46,961 INFO L482 AbstractCegarLoop]: Abstraction has 58344 states and 241934 transitions. [2021-06-05 13:06:46,961 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 58344 states and 241934 transitions. [2021-06-05 13:06:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-06-05 13:06:46,972 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:06:46,973 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:06:46,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 13:06:46,973 INFO L430 AbstractCegarLoop]: === Iteration 22 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:06:46,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:06:46,973 INFO L82 PathProgramCache]: Analyzing trace with hash 448937912, now seen corresponding path program 1 times [2021-06-05 13:06:46,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:06:46,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718193281] [2021-06-05 13:06:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:06:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:06:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:06:47,011 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:06:47,011 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718193281] [2021-06-05 13:06:47,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718193281] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:06:47,011 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:06:47,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:06:47,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338871002] [2021-06-05 13:06:47,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:06:47,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:06:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:06:47,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:06:47,012 INFO L87 Difference]: Start difference. First operand 58344 states and 241934 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:06:49,941 INFO L93 Difference]: Finished difference Result 271148 states and 1069264 transitions. [2021-06-05 13:06:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:06:49,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-06-05 13:06:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:06:50,969 INFO L225 Difference]: With dead ends: 271148 [2021-06-05 13:06:50,970 INFO L226 Difference]: Without dead ends: 265841 [2021-06-05 13:06:50,970 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 111.6ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:06:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265841 states. [2021-06-05 13:06:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265841 to 53081. [2021-06-05 13:06:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53081 states, 53004 states have (on average 4.120009810580334) internal successors, (218377), 53080 states have internal predecessors, (218377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53081 states to 53081 states and 218377 transitions. [2021-06-05 13:06:56,316 INFO L78 Accepts]: Start accepts. Automaton has 53081 states and 218377 transitions. Word has length 13 [2021-06-05 13:06:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:06:56,316 INFO L482 AbstractCegarLoop]: Abstraction has 53081 states and 218377 transitions. [2021-06-05 13:06:56,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 53081 states and 218377 transitions. [2021-06-05 13:06:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-06-05 13:06:56,329 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:06:56,329 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:06:56,329 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 13:06:56,329 INFO L430 AbstractCegarLoop]: === Iteration 23 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:06:56,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:06:56,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1900490275, now seen corresponding path program 1 times [2021-06-05 13:06:56,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:06:56,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615121321] [2021-06-05 13:06:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:06:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:06:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:06:56,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:06:56,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615121321] [2021-06-05 13:06:56,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615121321] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:06:56,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:06:56,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:06:56,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490055207] [2021-06-05 13:06:56,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:06:56,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:06:56,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:06:56,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:06:56,375 INFO L87 Difference]: Start difference. First operand 53081 states and 218377 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:06:56,815 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-06-05 13:06:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:06:58,956 INFO L93 Difference]: Finished difference Result 262818 states and 1030033 transitions. [2021-06-05 13:06:58,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:06:58,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-06-05 13:06:58,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:07:00,444 INFO L225 Difference]: With dead ends: 262818 [2021-06-05 13:07:00,445 INFO L226 Difference]: Without dead ends: 257490 [2021-06-05 13:07:00,445 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 535.4ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:07:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257490 states. [2021-06-05 13:07:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257490 to 49994. [2021-06-05 13:07:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49994 states, 49917 states have (on average 4.081655548210029) internal successors, (203744), 49993 states have internal predecessors, (203744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49994 states to 49994 states and 203744 transitions. [2021-06-05 13:07:05,591 INFO L78 Accepts]: Start accepts. Automaton has 49994 states and 203744 transitions. Word has length 13 [2021-06-05 13:07:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:07:05,591 INFO L482 AbstractCegarLoop]: Abstraction has 49994 states and 203744 transitions. [2021-06-05 13:07:05,591 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 49994 states and 203744 transitions. [2021-06-05 13:07:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-06-05 13:07:05,604 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:07:05,604 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:07:05,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-05 13:07:05,604 INFO L430 AbstractCegarLoop]: === Iteration 24 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:07:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:07:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1900485320, now seen corresponding path program 1 times [2021-06-05 13:07:05,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:07:05,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018764783] [2021-06-05 13:07:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:07:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:07:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:07:05,640 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:07:05,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018764783] [2021-06-05 13:07:05,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018764783] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:07:05,640 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:07:05,640 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:07:05,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577584637] [2021-06-05 13:07:05,641 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:07:05,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:07:05,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:07:05,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:07:05,641 INFO L87 Difference]: Start difference. First operand 49994 states and 203744 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:07:07,985 INFO L93 Difference]: Finished difference Result 248383 states and 968328 transitions. [2021-06-05 13:07:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:07:07,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-06-05 13:07:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:07:08,814 INFO L225 Difference]: With dead ends: 248383 [2021-06-05 13:07:08,814 INFO L226 Difference]: Without dead ends: 242992 [2021-06-05 13:07:08,814 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 109.7ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:07:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242992 states. [2021-06-05 13:07:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242992 to 46346. [2021-06-05 13:07:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46346 states, 46269 states have (on average 4.042339363288595) internal successors, (187035), 46345 states have internal predecessors, (187035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46346 states to 46346 states and 187035 transitions. [2021-06-05 13:07:14,085 INFO L78 Accepts]: Start accepts. Automaton has 46346 states and 187035 transitions. Word has length 13 [2021-06-05 13:07:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:07:14,085 INFO L482 AbstractCegarLoop]: Abstraction has 46346 states and 187035 transitions. [2021-06-05 13:07:14,085 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 46346 states and 187035 transitions. [2021-06-05 13:07:14,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-06-05 13:07:14,100 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:07:14,100 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:07:14,100 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 13:07:14,101 INFO L430 AbstractCegarLoop]: === Iteration 25 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:07:14,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:07:14,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1914785000, now seen corresponding path program 1 times [2021-06-05 13:07:14,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:07:14,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408381173] [2021-06-05 13:07:14,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:07:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:07:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:07:14,154 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:07:14,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408381173] [2021-06-05 13:07:14,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408381173] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:07:14,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:07:14,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 13:07:14,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006262581] [2021-06-05 13:07:14,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 13:07:14,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:07:14,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 13:07:14,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 13:07:14,155 INFO L87 Difference]: Start difference. First operand 46346 states and 187035 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:07:16,056 INFO L93 Difference]: Finished difference Result 231246 states and 896368 transitions. [2021-06-05 13:07:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 13:07:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-06-05 13:07:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:07:16,803 INFO L225 Difference]: With dead ends: 231246 [2021-06-05 13:07:16,803 INFO L226 Difference]: Without dead ends: 225863 [2021-06-05 13:07:16,804 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 113.4ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 13:07:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225863 states. [2021-06-05 13:07:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225863 to 42850. [2021-06-05 13:07:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42850 states, 42773 states have (on average 3.9991349683211372) internal successors, (171055), 42849 states have internal predecessors, (171055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42850 states to 42850 states and 171055 transitions. [2021-06-05 13:07:21,273 INFO L78 Accepts]: Start accepts. Automaton has 42850 states and 171055 transitions. Word has length 13 [2021-06-05 13:07:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:07:21,273 INFO L482 AbstractCegarLoop]: Abstraction has 42850 states and 171055 transitions. [2021-06-05 13:07:21,273 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 42850 states and 171055 transitions. [2021-06-05 13:07:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 13:07:21,287 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:07:21,287 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:07:21,287 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 13:07:21,287 INFO L430 AbstractCegarLoop]: === Iteration 26 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:07:21,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:07:21,287 INFO L82 PathProgramCache]: Analyzing trace with hash 908567313, now seen corresponding path program 1 times [2021-06-05 13:07:21,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:07:21,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942100572] [2021-06-05 13:07:21,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:07:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:07:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 13:07:21,326 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:07:21,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942100572] [2021-06-05 13:07:21,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942100572] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:07:21,327 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:07:21,327 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 13:07:21,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263962899] [2021-06-05 13:07:21,327 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:07:21,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:07:21,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:07:21,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:07:21,328 INFO L87 Difference]: Start difference. First operand 42850 states and 171055 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:07:23,588 INFO L93 Difference]: Finished difference Result 258595 states and 989063 transitions. [2021-06-05 13:07:23,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 13:07:23,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 13:07:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:07:25,227 INFO L225 Difference]: With dead ends: 258595 [2021-06-05 13:07:25,227 INFO L226 Difference]: Without dead ends: 252265 [2021-06-05 13:07:25,228 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 295.0ms TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 13:07:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252265 states. [2021-06-05 13:07:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252265 to 35102. [2021-06-05 13:07:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35102 states, 35040 states have (on average 3.9661529680365297) internal successors, (138974), 35101 states have internal predecessors, (138974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35102 states to 35102 states and 138974 transitions. [2021-06-05 13:07:30,023 INFO L78 Accepts]: Start accepts. Automaton has 35102 states and 138974 transitions. Word has length 14 [2021-06-05 13:07:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:07:30,023 INFO L482 AbstractCegarLoop]: Abstraction has 35102 states and 138974 transitions. [2021-06-05 13:07:30,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 35102 states and 138974 transitions. [2021-06-05 13:07:30,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 13:07:30,036 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:07:30,036 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:07:30,036 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-05 13:07:30,036 INFO L430 AbstractCegarLoop]: === Iteration 27 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:07:30,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:07:30,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1942134140, now seen corresponding path program 1 times [2021-06-05 13:07:30,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:07:30,037 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206818493] [2021-06-05 13:07:30,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:07:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:07:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:07:30,081 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:07:30,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206818493] [2021-06-05 13:07:30,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206818493] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:07:30,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:07:30,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 13:07:30,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088374636] [2021-06-05 13:07:30,081 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:07:30,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:07:30,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:07:30,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:07:30,082 INFO L87 Difference]: Start difference. First operand 35102 states and 138974 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:07:32,258 INFO L93 Difference]: Finished difference Result 225415 states and 854022 transitions. [2021-06-05 13:07:32,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 13:07:32,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 13:07:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:07:32,925 INFO L225 Difference]: With dead ends: 225415 [2021-06-05 13:07:32,925 INFO L226 Difference]: Without dead ends: 219068 [2021-06-05 13:07:32,925 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 287.9ms TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 13:07:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219068 states. [2021-06-05 13:07:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219068 to 28469. [2021-06-05 13:07:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28469 states, 28407 states have (on average 3.914985742950681) internal successors, (111213), 28468 states have internal predecessors, (111213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28469 states to 28469 states and 111213 transitions. [2021-06-05 13:07:36,778 INFO L78 Accepts]: Start accepts. Automaton has 28469 states and 111213 transitions. Word has length 15 [2021-06-05 13:07:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:07:36,779 INFO L482 AbstractCegarLoop]: Abstraction has 28469 states and 111213 transitions. [2021-06-05 13:07:36,779 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 28469 states and 111213 transitions. [2021-06-05 13:07:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 13:07:36,790 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:07:36,790 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:07:36,790 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-05 13:07:36,790 INFO L430 AbstractCegarLoop]: === Iteration 28 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:07:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:07:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1942139095, now seen corresponding path program 1 times [2021-06-05 13:07:36,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:07:36,791 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124180297] [2021-06-05 13:07:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:07:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:07:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:07:36,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:07:36,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124180297] [2021-06-05 13:07:36,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124180297] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:07:36,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:07:36,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 13:07:36,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374448893] [2021-06-05 13:07:36,829 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:07:36,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:07:36,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:07:36,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:07:36,829 INFO L87 Difference]: Start difference. First operand 28469 states and 111213 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:07:38,502 INFO L93 Difference]: Finished difference Result 186295 states and 699021 transitions. [2021-06-05 13:07:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 13:07:38,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 13:07:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:07:39,704 INFO L225 Difference]: With dead ends: 186295 [2021-06-05 13:07:39,704 INFO L226 Difference]: Without dead ends: 179926 [2021-06-05 13:07:39,705 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 293.0ms TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 13:07:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179926 states. [2021-06-05 13:07:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179926 to 21749. [2021-06-05 13:07:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21749 states, 21687 states have (on average 3.8629132660118963) internal successors, (83775), 21748 states have internal predecessors, (83775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21749 states to 21749 states and 83775 transitions. [2021-06-05 13:07:42,652 INFO L78 Accepts]: Start accepts. Automaton has 21749 states and 83775 transitions. Word has length 15 [2021-06-05 13:07:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:07:42,652 INFO L482 AbstractCegarLoop]: Abstraction has 21749 states and 83775 transitions. [2021-06-05 13:07:42,652 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 21749 states and 83775 transitions. [2021-06-05 13:07:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 13:07:42,660 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:07:42,660 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:07:42,660 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-05 13:07:42,660 INFO L430 AbstractCegarLoop]: === Iteration 29 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:07:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:07:42,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1927839415, now seen corresponding path program 1 times [2021-06-05 13:07:42,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:07:42,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562365987] [2021-06-05 13:07:42,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:07:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:07:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:07:42,705 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:07:42,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562365987] [2021-06-05 13:07:42,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562365987] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:07:42,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:07:42,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 13:07:42,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536246339] [2021-06-05 13:07:42,706 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:07:42,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:07:42,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:07:42,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:07:42,706 INFO L87 Difference]: Start difference. First operand 21749 states and 83775 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:07:44,216 INFO L93 Difference]: Finished difference Result 143292 states and 530220 transitions. [2021-06-05 13:07:44,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 13:07:44,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 13:07:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:07:44,627 INFO L225 Difference]: With dead ends: 143292 [2021-06-05 13:07:44,627 INFO L226 Difference]: Without dead ends: 136983 [2021-06-05 13:07:44,627 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 323.9ms TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 13:07:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136983 states. [2021-06-05 13:07:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136983 to 15287. [2021-06-05 13:07:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15287 states, 15225 states have (on average 3.807553366174056) internal successors, (57970), 15286 states have internal predecessors, (57970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15287 states to 15287 states and 57970 transitions. [2021-06-05 13:07:46,962 INFO L78 Accepts]: Start accepts. Automaton has 15287 states and 57970 transitions. Word has length 15 [2021-06-05 13:07:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:07:46,963 INFO L482 AbstractCegarLoop]: Abstraction has 15287 states and 57970 transitions. [2021-06-05 13:07:46,963 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 15287 states and 57970 transitions. [2021-06-05 13:07:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 13:07:46,968 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:07:46,968 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:07:46,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-05 13:07:46,968 INFO L430 AbstractCegarLoop]: === Iteration 30 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:07:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:07:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1010056137, now seen corresponding path program 1 times [2021-06-05 13:07:46,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:07:46,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116868572] [2021-06-05 13:07:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:07:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:07:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:07:47,011 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:07:47,011 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116868572] [2021-06-05 13:07:47,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116868572] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:07:47,011 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:07:47,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 13:07:47,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125990958] [2021-06-05 13:07:47,012 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:07:47,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:07:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:07:47,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:07:47,012 INFO L87 Difference]: Start difference. First operand 15287 states and 57970 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:07:48,313 INFO L93 Difference]: Finished difference Result 103243 states and 372718 transitions. [2021-06-05 13:07:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 13:07:48,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 13:07:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:07:48,580 INFO L225 Difference]: With dead ends: 103243 [2021-06-05 13:07:48,580 INFO L226 Difference]: Without dead ends: 96842 [2021-06-05 13:07:48,580 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 317.0ms TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 13:07:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96842 states. [2021-06-05 13:07:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96842 to 10688. [2021-06-05 13:07:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10688 states, 10626 states have (on average 3.6072840203274987) internal successors, (38331), 10687 states have internal predecessors, (38331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10688 states to 10688 states and 38331 transitions. [2021-06-05 13:07:50,010 INFO L78 Accepts]: Start accepts. Automaton has 10688 states and 38331 transitions. Word has length 15 [2021-06-05 13:07:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:07:50,010 INFO L482 AbstractCegarLoop]: Abstraction has 10688 states and 38331 transitions. [2021-06-05 13:07:50,010 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 10688 states and 38331 transitions. [2021-06-05 13:07:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 13:07:50,015 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:07:50,015 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:07:50,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-05 13:07:50,015 INFO L430 AbstractCegarLoop]: === Iteration 31 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:07:50,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:07:50,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1919867882, now seen corresponding path program 1 times [2021-06-05 13:07:50,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:07:50,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339490633] [2021-06-05 13:07:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:07:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:07:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 13:07:50,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:07:50,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339490633] [2021-06-05 13:07:50,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339490633] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:07:50,072 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:07:50,072 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:07:50,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775687088] [2021-06-05 13:07:50,072 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 13:07:50,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:07:50,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 13:07:50,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:07:50,073 INFO L87 Difference]: Start difference. First operand 10688 states and 38331 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:50,317 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-06-05 13:07:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:07:51,081 INFO L93 Difference]: Finished difference Result 6725 states and 22549 transitions. [2021-06-05 13:07:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 13:07:51,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 13:07:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:07:51,081 INFO L225 Difference]: With dead ends: 6725 [2021-06-05 13:07:51,081 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 13:07:51,081 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 650.4ms TimeCoverageRelationStatistics Valid=366, Invalid=1116, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 13:07:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 13:07:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 13:07:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 13:07:51,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2021-06-05 13:07:51,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:07:51,082 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 13:07:51,082 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 13:07:51,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 13:07:51,082 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-05 13:07:51,082 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 13:07:51,083 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 13:07:51,083 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:07:51,083 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:07:51,083 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:07:51,083 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:07:51,083 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:07:51,083 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:07:51,083 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:07:51,083 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 13:07:51,084 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 33 transitions, 111 flow [2021-06-05 13:07:54,072 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26439 states, 26344 states have (on average 4.771978439113271) internal successors, (125713), 26438 states have internal predecessors, (125713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 26439 states, 26344 states have (on average 4.771978439113271) internal successors, (125713), 26438 states have internal predecessors, (125713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:07:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 13:07:54,106 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:07:54,106 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:07:54,106 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 13:07:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:07:54,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1284170360, now seen corresponding path program 1 times [2021-06-05 13:07:54,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:07:54,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829063942] [2021-06-05 13:07:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:07:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 13:07:54,108 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 13:07:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 13:07:54,109 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 13:07:54,110 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 13:07:54,110 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 13:07:54,110 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-06-05 13:07:54,110 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 13:07:54,110 WARN L242 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 13:07:54,110 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2021-06-05 13:07:54,119 WARN L313 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,119 WARN L313 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,119 WARN L313 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,119 WARN L313 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,119 WARN L313 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,119 WARN L313 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,119 WARN L313 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,120 WARN L313 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,120 WARN L313 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,120 WARN L313 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,120 WARN L313 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,120 WARN L313 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,120 WARN L313 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,120 WARN L313 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,120 WARN L313 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,120 WARN L313 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,121 WARN L313 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,121 WARN L313 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,121 WARN L313 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,121 WARN L313 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,121 WARN L313 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,121 WARN L313 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,121 WARN L313 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,121 WARN L313 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,122 WARN L313 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,123 WARN L313 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,123 WARN L313 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,124 WARN L313 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,124 WARN L313 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,125 WARN L313 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_t not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 13:07:54,126 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 13:07:54,126 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-05 13:07:54,128 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:07:54,128 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:07:54,128 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:07:54,128 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:07:54,128 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:07:54,128 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:07:54,129 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:07:54,129 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 13:07:54,129 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 39 transitions, 138 flow [2021-06-05 13:09:46,816 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 158631 states, 158440 states have (on average 5.594957081545064) internal successors, (886465), 158630 states have internal predecessors, (886465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:09:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 158631 states, 158440 states have (on average 5.594957081545064) internal successors, (886465), 158630 states have internal predecessors, (886465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:09:47,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-06-05 13:09:47,109 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:09:47,109 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-06-05 13:09:47,109 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:09:47,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:09:47,109 INFO L82 PathProgramCache]: Analyzing trace with hash 170106637, now seen corresponding path program 1 times [2021-06-05 13:09:47,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:09:47,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690442457] [2021-06-05 13:09:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:09:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:09:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 13:09:47,129 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:09:47,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690442457] [2021-06-05 13:09:47,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690442457] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:09:47,131 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:09:47,131 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:09:47,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821627475] [2021-06-05 13:09:47,131 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:09:47,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:09:47,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:09:47,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:09:47,345 INFO L87 Difference]: Start difference. First operand has 158631 states, 158440 states have (on average 5.594957081545064) internal successors, (886465), 158630 states have internal predecessors, (886465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:09:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:09:53,263 INFO L93 Difference]: Finished difference Result 523661 states and 2660297 transitions. [2021-06-05 13:09:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:09:53,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-06-05 13:09:53,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:09:56,666 INFO L225 Difference]: With dead ends: 523661 [2021-06-05 13:09:56,667 INFO L226 Difference]: Without dead ends: 516884 [2021-06-05 13:09:56,667 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:10:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516884 states. [2021-06-05 13:10:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516884 to 295040. [2021-06-05 13:10:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295040 states, 294858 states have (on average 5.284238514810519) internal successors, (1558100), 295039 states have internal predecessors, (1558100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:10:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295040 states to 295040 states and 1558100 transitions. [2021-06-05 13:10:28,381 INFO L78 Accepts]: Start accepts. Automaton has 295040 states and 1558100 transitions. Word has length 5 [2021-06-05 13:10:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:10:28,381 INFO L482 AbstractCegarLoop]: Abstraction has 295040 states and 1558100 transitions. [2021-06-05 13:10:28,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:10:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 295040 states and 1558100 transitions. [2021-06-05 13:10:28,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 13:10:28,382 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:10:28,382 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 13:10:28,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-06-05 13:10:28,382 INFO L430 AbstractCegarLoop]: === Iteration 2 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:10:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:10:28,382 INFO L82 PathProgramCache]: Analyzing trace with hash 978536248, now seen corresponding path program 1 times [2021-06-05 13:10:28,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:10:28,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131838273] [2021-06-05 13:10:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:10:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:10:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 13:10:28,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:10:28,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131838273] [2021-06-05 13:10:28,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131838273] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:10:28,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:10:28,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:10:28,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709676701] [2021-06-05 13:10:28,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:10:28,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:10:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:10:28,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:10:28,403 INFO L87 Difference]: Start difference. First operand 295040 states and 1558100 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:10:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:10:36,298 INFO L93 Difference]: Finished difference Result 669228 states and 3390950 transitions. [2021-06-05 13:10:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:10:36,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-06-05 13:10:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:10:40,906 INFO L225 Difference]: With dead ends: 669228 [2021-06-05 13:10:40,906 INFO L226 Difference]: Without dead ends: 665852 [2021-06-05 13:10:40,906 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:10:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665852 states. [2021-06-05 13:11:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665852 to 356215. [2021-06-05 13:11:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356215 states, 356033 states have (on average 5.282886698704895) internal successors, (1880882), 356214 states have internal predecessors, (1880882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:11:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356215 states to 356215 states and 1880882 transitions. [2021-06-05 13:11:16,690 INFO L78 Accepts]: Start accepts. Automaton has 356215 states and 1880882 transitions. Word has length 6 [2021-06-05 13:11:16,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:11:16,690 INFO L482 AbstractCegarLoop]: Abstraction has 356215 states and 1880882 transitions. [2021-06-05 13:11:16,690 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:11:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 356215 states and 1880882 transitions. [2021-06-05 13:11:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 13:11:16,691 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:11:16,691 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:11:16,691 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-06-05 13:11:16,691 INFO L430 AbstractCegarLoop]: === Iteration 3 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:11:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:11:16,691 INFO L82 PathProgramCache]: Analyzing trace with hash 270378104, now seen corresponding path program 1 times [2021-06-05 13:11:16,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:11:16,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260012036] [2021-06-05 13:11:16,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:11:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:11:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 13:11:16,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:11:16,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260012036] [2021-06-05 13:11:16,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260012036] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:11:16,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:11:16,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 13:11:16,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115975780] [2021-06-05 13:11:16,741 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 13:11:16,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:11:16,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 13:11:16,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 13:11:16,741 INFO L87 Difference]: Start difference. First operand 356215 states and 1880882 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:11:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:11:30,068 INFO L93 Difference]: Finished difference Result 815793 states and 4141748 transitions. [2021-06-05 13:11:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 13:11:30,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-06-05 13:11:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:11:39,675 INFO L225 Difference]: With dead ends: 815793 [2021-06-05 13:11:39,676 INFO L226 Difference]: Without dead ends: 811310 [2021-06-05 13:11:39,676 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:12:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811310 states. [2021-06-05 13:12:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811310 to 432160. [2021-06-05 13:12:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432160 states, 431978 states have (on average 5.281655547273241) internal successors, (2281559), 432159 states have internal predecessors, (2281559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:12:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432160 states to 432160 states and 2281559 transitions. [2021-06-05 13:12:28,748 INFO L78 Accepts]: Start accepts. Automaton has 432160 states and 2281559 transitions. Word has length 7 [2021-06-05 13:12:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:12:28,748 INFO L482 AbstractCegarLoop]: Abstraction has 432160 states and 2281559 transitions. [2021-06-05 13:12:28,748 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:12:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 432160 states and 2281559 transitions. [2021-06-05 13:12:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 13:12:28,749 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:12:28,749 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:12:28,749 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-06-05 13:12:28,749 INFO L430 AbstractCegarLoop]: === Iteration 4 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 13:12:28,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:12:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash -414268605, now seen corresponding path program 1 times [2021-06-05 13:12:28,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:12:28,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287277528] [2021-06-05 13:12:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:12:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:12:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 13:12:28,774 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:12:28,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287277528] [2021-06-05 13:12:28,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287277528] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:12:28,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:12:28,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:12:28,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897667782] [2021-06-05 13:12:28,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 13:12:28,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:12:28,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 13:12:28,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 13:12:28,776 INFO L87 Difference]: Start difference. First operand 432160 states and 2281559 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 13:12:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:12:47,958 INFO L93 Difference]: Finished difference Result 1270931 states and 6384385 transitions. [2021-06-05 13:12:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 13:12:47,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-06-05 13:12:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted.