/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/mcr/example_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 13:30:12,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 13:30:12,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 13:30:12,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 13:30:12,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 13:30:12,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 13:30:12,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 13:30:12,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 13:30:12,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 13:30:12,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 13:30:12,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 13:30:12,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 13:30:12,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 13:30:12,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 13:30:12,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 13:30:12,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 13:30:12,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 13:30:12,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 13:30:12,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 13:30:12,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 13:30:12,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 13:30:12,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 13:30:12,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 13:30:12,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 13:30:12,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 13:30:12,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 13:30:12,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 13:30:12,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 13:30:12,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 13:30:12,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 13:30:12,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 13:30:12,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 13:30:12,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 13:30:12,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 13:30:12,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 13:30:12,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 13:30:12,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 13:30:12,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 13:30:12,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 13:30:12,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 13:30:12,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 13:30:12,279 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:30:12,292 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 13:30:12,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 13:30:12,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 13:30:12,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 13:30:12,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 13:30:12,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 13:30:12,294 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 13:30:12,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 13:30:12,294 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 13:30:12,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 13:30:12,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 13:30:12,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 13:30:12,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 13:30:12,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 13:30:12,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 13:30:12,295 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 13:30:12,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 13:30:12,295 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 13:30:12,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 13:30:12,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 13:30:12,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 13:30:12,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 13:30:12,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 13:30:12,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 13:30:12,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 13:30:12,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 13:30:12,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 13:30:12,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 13:30:12,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 13:30:12,297 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 13:30:12,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 13:30:12,297 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 13:30:12,297 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:30:12,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 13:30:12,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 13:30:12,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 13:30:12,562 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 13:30:12,564 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 13:30:12,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl [2021-06-05 13:30:12,565 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl' [2021-06-05 13:30:12,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 13:30:12,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 13:30:12,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 13:30:12,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 13:30:12,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 13:30:12,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (1/1) ... [2021-06-05 13:30:12,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (1/1) ... [2021-06-05 13:30:12,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 13:30:12,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 13:30:12,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 13:30:12,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 13:30:12,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (1/1) ... [2021-06-05 13:30:12,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (1/1) ... [2021-06-05 13:30:12,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (1/1) ... [2021-06-05 13:30:12,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (1/1) ... [2021-06-05 13:30:12,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (1/1) ... [2021-06-05 13:30:12,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (1/1) ... [2021-06-05 13:30:12,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (1/1) ... [2021-06-05 13:30:12,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 13:30:12,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 13:30:12,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 13:30:12,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 13:30:12,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (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:30:12,698 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2021-06-05 13:30:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2021-06-05 13:30:12,698 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2021-06-05 13:30:12,698 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2021-06-05 13:30:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2021-06-05 13:30:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2021-06-05 13:30:12,699 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2021-06-05 13:30:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2021-06-05 13:30:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2021-06-05 13:30:12,699 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2021-06-05 13:30:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2021-06-05 13:30:12,700 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2021-06-05 13:30:12,700 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2021-06-05 13:30:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2021-06-05 13:30:12,700 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2021-06-05 13:30:12,701 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 13:30:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 13:30:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 13:30:12,702 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:30:12,824 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 13:30:12,824 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-05 13:30:12,825 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 01:30:12 BoogieIcfgContainer [2021-06-05 13:30:12,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 13:30:12,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 13:30:12,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 13:30:12,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 13:30:12,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 01:30:12" (1/2) ... [2021-06-05 13:30:12,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341802fd and model type example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 01:30:12, skipping insertion in model container [2021-06-05 13:30:12,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 01:30:12" (2/2) ... [2021-06-05 13:30:12,830 INFO L111 eAbstractionObserver]: Analyzing ICFG example_5.bpl [2021-06-05 13:30:12,839 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 13:30:12,839 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 13:30:12,839 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 13:30:12,840 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 13:30:12,942 INFO L149 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2021-06-05 13:30:12,957 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 13:30:12,975 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 13:30:12,975 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 13:30:12,975 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 13:30:12,975 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 13:30:12,975 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 13:30:12,976 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 13:30:12,976 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 13:30:12,976 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 13:30:12,982 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 48 transitions, 196 flow [2021-06-05 13:30:13,098 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1148 states, 1146 states have (on average 3.7068062827225132) internal successors, (4248), 1147 states have internal predecessors, (4248), 0 states have call successors, (0), 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:30:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 1148 states, 1146 states have (on average 3.7068062827225132) internal successors, (4248), 1147 states have internal predecessors, (4248), 0 states have call successors, (0), 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:30:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:13,121 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:13,121 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:13,122 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:13,128 INFO L82 PathProgramCache]: Analyzing trace with hash 921696598, now seen corresponding path program 1 times [2021-06-05 13:30:13,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:13,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954191179] [2021-06-05 13:30:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:13,223 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:30:13,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:13,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954191179] [2021-06-05 13:30:13,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954191179] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:13,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:13,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:30:13,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129895228] [2021-06-05 13:30:13,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 13:30:13,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:13,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 13:30:13,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 13:30:13,240 INFO L87 Difference]: Start difference. First operand has 1148 states, 1146 states have (on average 3.7068062827225132) internal successors, (4248), 1147 states have internal predecessors, (4248), 0 states have call successors, (0), 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 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:13,269 INFO L93 Difference]: Finished difference Result 959 states and 3411 transitions. [2021-06-05 13:30:13,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 13:30:13,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:13,286 INFO L225 Difference]: With dead ends: 959 [2021-06-05 13:30:13,287 INFO L226 Difference]: Without dead ends: 957 [2021-06-05 13:30:13,287 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 13:30:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-06-05 13:30:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2021-06-05 13:30:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 3.5658995815899583) internal successors, (3409), 956 states have internal predecessors, (3409), 0 states have call successors, (0), 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:30:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 3409 transitions. [2021-06-05 13:30:13,354 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 3409 transitions. Word has length 21 [2021-06-05 13:30:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:13,355 INFO L482 AbstractCegarLoop]: Abstraction has 957 states and 3409 transitions. [2021-06-05 13:30:13,355 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 3409 transitions. [2021-06-05 13:30:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:13,358 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:13,358 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:13,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 13:30:13,358 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash 79574102, now seen corresponding path program 1 times [2021-06-05 13:30:13,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:13,359 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530662695] [2021-06-05 13:30:13,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:13,375 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:30:13,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:13,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530662695] [2021-06-05 13:30:13,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530662695] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:13,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:13,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:30:13,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602070423] [2021-06-05 13:30:13,376 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 13:30:13,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 13:30:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 13:30:13,377 INFO L87 Difference]: Start difference. First operand 957 states and 3409 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:13,388 INFO L93 Difference]: Finished difference Result 741 states and 2572 transitions. [2021-06-05 13:30:13,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 13:30:13,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:13,392 INFO L225 Difference]: With dead ends: 741 [2021-06-05 13:30:13,392 INFO L226 Difference]: Without dead ends: 741 [2021-06-05 13:30:13,393 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 13:30:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2021-06-05 13:30:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2021-06-05 13:30:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 3.4756756756756757) internal successors, (2572), 740 states have internal predecessors, (2572), 0 states have call successors, (0), 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:30:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2572 transitions. [2021-06-05 13:30:13,417 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2572 transitions. Word has length 21 [2021-06-05 13:30:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:13,417 INFO L482 AbstractCegarLoop]: Abstraction has 741 states and 2572 transitions. [2021-06-05 13:30:13,418 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2572 transitions. [2021-06-05 13:30:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:13,420 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:13,420 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:13,421 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 13:30:13,421 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:13,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1823307896, now seen corresponding path program 1 times [2021-06-05 13:30:13,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:13,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479518054] [2021-06-05 13:30:13,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:13,472 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:30:13,473 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:13,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479518054] [2021-06-05 13:30:13,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479518054] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:13,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:13,473 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:30:13,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596801232] [2021-06-05 13:30:13,474 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 13:30:13,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:13,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 13:30:13,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 13:30:13,475 INFO L87 Difference]: Start difference. First operand 741 states and 2572 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:13,491 INFO L93 Difference]: Finished difference Result 567 states and 1945 transitions. [2021-06-05 13:30:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 13:30:13,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:13,496 INFO L225 Difference]: With dead ends: 567 [2021-06-05 13:30:13,496 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 13:30:13,496 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 13:30:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 13:30:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2021-06-05 13:30:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 3.4363957597173145) internal successors, (1945), 566 states have internal predecessors, (1945), 0 states have call successors, (0), 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:30:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1945 transitions. [2021-06-05 13:30:13,512 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1945 transitions. Word has length 21 [2021-06-05 13:30:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:13,513 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1945 transitions. [2021-06-05 13:30:13,513 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1945 transitions. [2021-06-05 13:30:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:13,514 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:13,514 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:13,514 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 13:30:13,515 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:13,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:13,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1824113276, now seen corresponding path program 1 times [2021-06-05 13:30:13,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:13,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335543452] [2021-06-05 13:30:13,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:13,737 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:30:13,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:13,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335543452] [2021-06-05 13:30:13,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335543452] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:13,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:13,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:13,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208650782] [2021-06-05 13:30:13,739 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:13,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:13,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:13,740 INFO L87 Difference]: Start difference. First operand 567 states and 1945 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:13,800 INFO L93 Difference]: Finished difference Result 1267 states and 4072 transitions. [2021-06-05 13:30:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:13,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:13,807 INFO L225 Difference]: With dead ends: 1267 [2021-06-05 13:30:13,807 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 13:30:13,807 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 102.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 13:30:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 616. [2021-06-05 13:30:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 615 states have (on average 3.4) internal successors, (2091), 615 states have internal predecessors, (2091), 0 states have call successors, (0), 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:30:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 2091 transitions. [2021-06-05 13:30:13,828 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 2091 transitions. Word has length 21 [2021-06-05 13:30:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:13,828 INFO L482 AbstractCegarLoop]: Abstraction has 616 states and 2091 transitions. [2021-06-05 13:30:13,828 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 2091 transitions. [2021-06-05 13:30:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:13,831 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:13,831 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:13,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 13:30:13,832 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:13,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1418935620, now seen corresponding path program 2 times [2021-06-05 13:30:13,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:13,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853249191] [2021-06-05 13:30:13,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:13,950 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:30:13,950 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:13,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853249191] [2021-06-05 13:30:13,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853249191] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:13,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:13,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:13,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554330366] [2021-06-05 13:30:13,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:13,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:13,955 INFO L87 Difference]: Start difference. First operand 616 states and 2091 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:14,026 INFO L93 Difference]: Finished difference Result 1250 states and 3995 transitions. [2021-06-05 13:30:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:14,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:14,033 INFO L225 Difference]: With dead ends: 1250 [2021-06-05 13:30:14,033 INFO L226 Difference]: Without dead ends: 1098 [2021-06-05 13:30:14,034 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 89.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-06-05 13:30:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 581. [2021-06-05 13:30:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 3.420689655172414) internal successors, (1984), 580 states have internal predecessors, (1984), 0 states have call successors, (0), 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:30:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1984 transitions. [2021-06-05 13:30:14,056 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1984 transitions. Word has length 21 [2021-06-05 13:30:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:14,056 INFO L482 AbstractCegarLoop]: Abstraction has 581 states and 1984 transitions. [2021-06-05 13:30:14,056 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1984 transitions. [2021-06-05 13:30:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:14,058 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:14,058 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:14,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 13:30:14,058 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:14,059 INFO L82 PathProgramCache]: Analyzing trace with hash 213760410, now seen corresponding path program 3 times [2021-06-05 13:30:14,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:14,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464277958] [2021-06-05 13:30:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:14,146 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:30:14,146 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:14,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464277958] [2021-06-05 13:30:14,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464277958] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:14,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:14,147 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:14,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545595566] [2021-06-05 13:30:14,147 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:14,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:14,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:14,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:14,148 INFO L87 Difference]: Start difference. First operand 581 states and 1984 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:14,222 INFO L93 Difference]: Finished difference Result 1207 states and 3862 transitions. [2021-06-05 13:30:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:14,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:14,227 INFO L225 Difference]: With dead ends: 1207 [2021-06-05 13:30:14,227 INFO L226 Difference]: Without dead ends: 1104 [2021-06-05 13:30:14,228 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2021-06-05 13:30:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 601. [2021-06-05 13:30:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 3.4066666666666667) internal successors, (2044), 600 states have internal predecessors, (2044), 0 states have call successors, (0), 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:30:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 2044 transitions. [2021-06-05 13:30:14,245 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 2044 transitions. Word has length 21 [2021-06-05 13:30:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:14,245 INFO L482 AbstractCegarLoop]: Abstraction has 601 states and 2044 transitions. [2021-06-05 13:30:14,245 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 2044 transitions. [2021-06-05 13:30:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:14,247 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:14,247 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:14,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 13:30:14,247 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:14,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1651666564, now seen corresponding path program 4 times [2021-06-05 13:30:14,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:14,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523276648] [2021-06-05 13:30:14,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:14,371 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:30:14,371 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:14,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523276648] [2021-06-05 13:30:14,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523276648] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:14,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:14,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:14,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583727835] [2021-06-05 13:30:14,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:14,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:14,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:14,373 INFO L87 Difference]: Start difference. First operand 601 states and 2044 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:14,410 INFO L93 Difference]: Finished difference Result 1238 states and 3949 transitions. [2021-06-05 13:30:14,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:14,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:14,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:14,415 INFO L225 Difference]: With dead ends: 1238 [2021-06-05 13:30:14,416 INFO L226 Difference]: Without dead ends: 1084 [2021-06-05 13:30:14,416 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-06-05 13:30:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 581. [2021-06-05 13:30:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 3.4034482758620688) internal successors, (1974), 580 states have internal predecessors, (1974), 0 states have call successors, (0), 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:30:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1974 transitions. [2021-06-05 13:30:14,433 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1974 transitions. Word has length 21 [2021-06-05 13:30:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:14,433 INFO L482 AbstractCegarLoop]: Abstraction has 581 states and 1974 transitions. [2021-06-05 13:30:14,433 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1974 transitions. [2021-06-05 13:30:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:14,434 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:14,434 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:14,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 13:30:14,435 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:14,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:14,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1790028250, now seen corresponding path program 5 times [2021-06-05 13:30:14,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:14,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56869363] [2021-06-05 13:30:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:14,523 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:30:14,523 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:14,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56869363] [2021-06-05 13:30:14,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56869363] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:14,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:14,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:14,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758059695] [2021-06-05 13:30:14,524 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:14,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:14,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:14,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:14,525 INFO L87 Difference]: Start difference. First operand 581 states and 1974 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:14,578 INFO L93 Difference]: Finished difference Result 1182 states and 3774 transitions. [2021-06-05 13:30:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:14,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:14,583 INFO L225 Difference]: With dead ends: 1182 [2021-06-05 13:30:14,583 INFO L226 Difference]: Without dead ends: 1079 [2021-06-05 13:30:14,583 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-06-05 13:30:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 593. [2021-06-05 13:30:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 3.3885135135135136) internal successors, (2006), 592 states have internal predecessors, (2006), 0 states have call successors, (0), 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:30:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 2006 transitions. [2021-06-05 13:30:14,600 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 2006 transitions. Word has length 21 [2021-06-05 13:30:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:14,600 INFO L482 AbstractCegarLoop]: Abstraction has 593 states and 2006 transitions. [2021-06-05 13:30:14,600 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 2006 transitions. [2021-06-05 13:30:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:14,601 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:14,601 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:14,602 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 13:30:14,602 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:14,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:14,602 INFO L82 PathProgramCache]: Analyzing trace with hash 856912858, now seen corresponding path program 6 times [2021-06-05 13:30:14,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:14,602 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943300236] [2021-06-05 13:30:14,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:14,669 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:30:14,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:14,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943300236] [2021-06-05 13:30:14,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943300236] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:14,670 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:14,670 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:14,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106955843] [2021-06-05 13:30:14,670 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:14,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:14,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:14,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:14,671 INFO L87 Difference]: Start difference. First operand 593 states and 2006 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:14,721 INFO L93 Difference]: Finished difference Result 1196 states and 3811 transitions. [2021-06-05 13:30:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:14,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:14,726 INFO L225 Difference]: With dead ends: 1196 [2021-06-05 13:30:14,726 INFO L226 Difference]: Without dead ends: 1053 [2021-06-05 13:30:14,726 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-06-05 13:30:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 567. [2021-06-05 13:30:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 3.4240282685512367) internal successors, (1938), 566 states have internal predecessors, (1938), 0 states have call successors, (0), 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:30:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1938 transitions. [2021-06-05 13:30:14,741 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1938 transitions. Word has length 21 [2021-06-05 13:30:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:14,742 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1938 transitions. [2021-06-05 13:30:14,742 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1938 transitions. [2021-06-05 13:30:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:14,743 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:14,743 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:14,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 13:30:14,743 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:14,744 INFO L82 PathProgramCache]: Analyzing trace with hash -179046054, now seen corresponding path program 7 times [2021-06-05 13:30:14,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:14,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134303464] [2021-06-05 13:30:14,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:14,806 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:30:14,806 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:14,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134303464] [2021-06-05 13:30:14,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134303464] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:14,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:14,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:14,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648930099] [2021-06-05 13:30:14,807 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:14,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:14,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:14,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:14,807 INFO L87 Difference]: Start difference. First operand 567 states and 1938 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:14,850 INFO L93 Difference]: Finished difference Result 1298 states and 4181 transitions. [2021-06-05 13:30:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:14,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:14,856 INFO L225 Difference]: With dead ends: 1298 [2021-06-05 13:30:14,856 INFO L226 Difference]: Without dead ends: 1164 [2021-06-05 13:30:14,856 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2021-06-05 13:30:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 623. [2021-06-05 13:30:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 3.3858520900321545) internal successors, (2106), 622 states have internal predecessors, (2106), 0 states have call successors, (0), 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:30:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 2106 transitions. [2021-06-05 13:30:14,875 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 2106 transitions. Word has length 21 [2021-06-05 13:30:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:14,876 INFO L482 AbstractCegarLoop]: Abstraction has 623 states and 2106 transitions. [2021-06-05 13:30:14,876 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 2106 transitions. [2021-06-05 13:30:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:14,877 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:14,877 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:14,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 13:30:14,877 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:14,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:14,878 INFO L82 PathProgramCache]: Analyzing trace with hash 872872346, now seen corresponding path program 8 times [2021-06-05 13:30:14,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:14,879 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132572096] [2021-06-05 13:30:14,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:14,971 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:30:14,971 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:14,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132572096] [2021-06-05 13:30:14,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132572096] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:14,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:14,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:14,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858635780] [2021-06-05 13:30:14,972 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:14,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:14,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:14,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:14,974 INFO L87 Difference]: Start difference. First operand 623 states and 2106 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:15,057 INFO L93 Difference]: Finished difference Result 1281 states and 4104 transitions. [2021-06-05 13:30:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:15,062 INFO L225 Difference]: With dead ends: 1281 [2021-06-05 13:30:15,062 INFO L226 Difference]: Without dead ends: 1129 [2021-06-05 13:30:15,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 100.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-06-05 13:30:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 588. [2021-06-05 13:30:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 3.4003407155025553) internal successors, (1996), 587 states have internal predecessors, (1996), 0 states have call successors, (0), 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:30:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1996 transitions. [2021-06-05 13:30:15,083 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1996 transitions. Word has length 21 [2021-06-05 13:30:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:15,083 INFO L482 AbstractCegarLoop]: Abstraction has 588 states and 1996 transitions. [2021-06-05 13:30:15,083 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1996 transitions. [2021-06-05 13:30:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:15,084 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:15,084 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:15,085 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 13:30:15,085 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2136036634, now seen corresponding path program 9 times [2021-06-05 13:30:15,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:15,086 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434816761] [2021-06-05 13:30:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:15,183 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:30:15,183 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:15,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434816761] [2021-06-05 13:30:15,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434816761] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:15,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:15,184 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:15,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733055027] [2021-06-05 13:30:15,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:15,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:15,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:15,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:15,185 INFO L87 Difference]: Start difference. First operand 588 states and 1996 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:15,227 INFO L93 Difference]: Finished difference Result 1287 states and 4136 transitions. [2021-06-05 13:30:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:15,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:15,233 INFO L225 Difference]: With dead ends: 1287 [2021-06-05 13:30:15,233 INFO L226 Difference]: Without dead ends: 1153 [2021-06-05 13:30:15,233 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 59.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-06-05 13:30:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 614. [2021-06-05 13:30:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 3.3719412724306688) internal successors, (2067), 613 states have internal predecessors, (2067), 0 states have call successors, (0), 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:30:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 2067 transitions. [2021-06-05 13:30:15,251 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 2067 transitions. Word has length 21 [2021-06-05 13:30:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:15,251 INFO L482 AbstractCegarLoop]: Abstraction has 614 states and 2067 transitions. [2021-06-05 13:30:15,251 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 2067 transitions. [2021-06-05 13:30:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:15,253 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:15,253 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:15,253 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 13:30:15,253 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash 929894012, now seen corresponding path program 10 times [2021-06-05 13:30:15,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:15,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791199359] [2021-06-05 13:30:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:15,311 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:30:15,311 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:15,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791199359] [2021-06-05 13:30:15,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791199359] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:15,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:15,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:15,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109201833] [2021-06-05 13:30:15,312 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:15,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:15,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:15,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:15,312 INFO L87 Difference]: Start difference. First operand 614 states and 2067 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:15,372 INFO L93 Difference]: Finished difference Result 1268 states and 4055 transitions. [2021-06-05 13:30:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:15,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:15,378 INFO L225 Difference]: With dead ends: 1268 [2021-06-05 13:30:15,378 INFO L226 Difference]: Without dead ends: 1127 [2021-06-05 13:30:15,378 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2021-06-05 13:30:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 588. [2021-06-05 13:30:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 3.3781942078364566) internal successors, (1983), 587 states have internal predecessors, (1983), 0 states have call successors, (0), 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:30:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1983 transitions. [2021-06-05 13:30:15,395 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1983 transitions. Word has length 21 [2021-06-05 13:30:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:15,395 INFO L482 AbstractCegarLoop]: Abstraction has 588 states and 1983 transitions. [2021-06-05 13:30:15,396 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1983 transitions. [2021-06-05 13:30:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:15,397 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:15,397 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:15,397 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 13:30:15,397 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1110176068, now seen corresponding path program 11 times [2021-06-05 13:30:15,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:15,397 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200859800] [2021-06-05 13:30:15,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:15,459 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:30:15,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:15,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200859800] [2021-06-05 13:30:15,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200859800] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:15,459 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:15,459 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:15,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300703422] [2021-06-05 13:30:15,460 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:15,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:15,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:15,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:15,460 INFO L87 Difference]: Start difference. First operand 588 states and 1983 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:15,508 INFO L93 Difference]: Finished difference Result 1245 states and 3995 transitions. [2021-06-05 13:30:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:15,513 INFO L225 Difference]: With dead ends: 1245 [2021-06-05 13:30:15,513 INFO L226 Difference]: Without dead ends: 1128 [2021-06-05 13:30:15,513 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 59.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2021-06-05 13:30:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 606. [2021-06-05 13:30:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 3.3619834710743803) internal successors, (2034), 605 states have internal predecessors, (2034), 0 states have call successors, (0), 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:30:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 2034 transitions. [2021-06-05 13:30:15,528 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 2034 transitions. Word has length 21 [2021-06-05 13:30:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:15,528 INFO L482 AbstractCegarLoop]: Abstraction has 606 states and 2034 transitions. [2021-06-05 13:30:15,528 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 2034 transitions. [2021-06-05 13:30:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:15,529 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:15,529 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:15,529 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 13:30:15,529 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1438558950, now seen corresponding path program 12 times [2021-06-05 13:30:15,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:15,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585071322] [2021-06-05 13:30:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:15,588 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:30:15,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:15,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585071322] [2021-06-05 13:30:15,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585071322] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:15,588 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:15,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:15,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389130883] [2021-06-05 13:30:15,589 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:15,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:15,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:15,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:15,589 INFO L87 Difference]: Start difference. First operand 606 states and 2034 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:15,629 INFO L93 Difference]: Finished difference Result 1243 states and 3972 transitions. [2021-06-05 13:30:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:15,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:15,632 INFO L225 Difference]: With dead ends: 1243 [2021-06-05 13:30:15,633 INFO L226 Difference]: Without dead ends: 1089 [2021-06-05 13:30:15,633 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-06-05 13:30:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 567. [2021-06-05 13:30:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 3.408127208480565) internal successors, (1929), 566 states have internal predecessors, (1929), 0 states have call successors, (0), 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:30:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1929 transitions. [2021-06-05 13:30:15,646 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1929 transitions. Word has length 21 [2021-06-05 13:30:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:15,646 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1929 transitions. [2021-06-05 13:30:15,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1929 transitions. [2021-06-05 13:30:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:15,647 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:15,648 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:15,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 13:30:15,648 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:15,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:15,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1957163848, now seen corresponding path program 13 times [2021-06-05 13:30:15,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:15,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826224712] [2021-06-05 13:30:15,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:15,710 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:30:15,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:15,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826224712] [2021-06-05 13:30:15,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826224712] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:15,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:15,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:15,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683618883] [2021-06-05 13:30:15,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:15,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:15,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:15,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:15,711 INFO L87 Difference]: Start difference. First operand 567 states and 1929 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:15,753 INFO L93 Difference]: Finished difference Result 1192 states and 3820 transitions. [2021-06-05 13:30:15,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:15,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:15,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:15,756 INFO L225 Difference]: With dead ends: 1192 [2021-06-05 13:30:15,756 INFO L226 Difference]: Without dead ends: 1089 [2021-06-05 13:30:15,757 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-06-05 13:30:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 597. [2021-06-05 13:30:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 3.4060402684563758) internal successors, (2030), 596 states have internal predecessors, (2030), 0 states have call successors, (0), 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:30:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 2030 transitions. [2021-06-05 13:30:15,771 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 2030 transitions. Word has length 21 [2021-06-05 13:30:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:15,771 INFO L482 AbstractCegarLoop]: Abstraction has 597 states and 2030 transitions. [2021-06-05 13:30:15,771 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 2030 transitions. [2021-06-05 13:30:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:15,773 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:15,773 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:15,773 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 13:30:15,773 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:15,773 INFO L82 PathProgramCache]: Analyzing trace with hash 472376474, now seen corresponding path program 14 times [2021-06-05 13:30:15,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:15,774 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665540610] [2021-06-05 13:30:15,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:15,844 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:30:15,845 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:15,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665540610] [2021-06-05 13:30:15,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665540610] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:15,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:15,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:15,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591585234] [2021-06-05 13:30:15,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:15,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:15,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:15,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:15,846 INFO L87 Difference]: Start difference. First operand 597 states and 2030 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:15,880 INFO L93 Difference]: Finished difference Result 1223 states and 3907 transitions. [2021-06-05 13:30:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:15,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:15,883 INFO L225 Difference]: With dead ends: 1223 [2021-06-05 13:30:15,883 INFO L226 Difference]: Without dead ends: 1069 [2021-06-05 13:30:15,883 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-06-05 13:30:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 577. [2021-06-05 13:30:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 3.4027777777777777) internal successors, (1960), 576 states have internal predecessors, (1960), 0 states have call successors, (0), 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:30:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1960 transitions. [2021-06-05 13:30:15,907 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1960 transitions. Word has length 21 [2021-06-05 13:30:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:15,907 INFO L482 AbstractCegarLoop]: Abstraction has 577 states and 1960 transitions. [2021-06-05 13:30:15,907 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1960 transitions. [2021-06-05 13:30:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:15,909 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:15,909 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:15,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 13:30:15,909 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:15,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:15,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1419053670, now seen corresponding path program 15 times [2021-06-05 13:30:15,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:15,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758958707] [2021-06-05 13:30:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:15,978 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:30:15,978 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:15,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758958707] [2021-06-05 13:30:15,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758958707] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:15,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:15,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:15,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042880278] [2021-06-05 13:30:15,978 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:15,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:15,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:15,979 INFO L87 Difference]: Start difference. First operand 577 states and 1960 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:16,022 INFO L93 Difference]: Finished difference Result 1165 states and 3727 transitions. [2021-06-05 13:30:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:16,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:16,024 INFO L225 Difference]: With dead ends: 1165 [2021-06-05 13:30:16,024 INFO L226 Difference]: Without dead ends: 1062 [2021-06-05 13:30:16,025 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 59.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:16,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2021-06-05 13:30:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 589. [2021-06-05 13:30:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 3.3877551020408165) internal successors, (1992), 588 states have internal predecessors, (1992), 0 states have call successors, (0), 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:30:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1992 transitions. [2021-06-05 13:30:16,038 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1992 transitions. Word has length 21 [2021-06-05 13:30:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:16,038 INFO L482 AbstractCegarLoop]: Abstraction has 589 states and 1992 transitions. [2021-06-05 13:30:16,038 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1992 transitions. [2021-06-05 13:30:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:16,039 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:16,039 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:16,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 13:30:16,039 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:16,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1264168858, now seen corresponding path program 16 times [2021-06-05 13:30:16,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:16,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35692562] [2021-06-05 13:30:16,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:16,090 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:30:16,090 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:16,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35692562] [2021-06-05 13:30:16,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35692562] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:16,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:16,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:16,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239306370] [2021-06-05 13:30:16,091 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:16,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:16,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:16,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:16,091 INFO L87 Difference]: Start difference. First operand 589 states and 1992 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:16,147 INFO L93 Difference]: Finished difference Result 1177 states and 3759 transitions. [2021-06-05 13:30:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:16,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:16,150 INFO L225 Difference]: With dead ends: 1177 [2021-06-05 13:30:16,150 INFO L226 Difference]: Without dead ends: 1050 [2021-06-05 13:30:16,150 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 64.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-06-05 13:30:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 577. [2021-06-05 13:30:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 3.392361111111111) internal successors, (1954), 576 states have internal predecessors, (1954), 0 states have call successors, (0), 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:30:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1954 transitions. [2021-06-05 13:30:16,163 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1954 transitions. Word has length 21 [2021-06-05 13:30:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:16,163 INFO L482 AbstractCegarLoop]: Abstraction has 577 states and 1954 transitions. [2021-06-05 13:30:16,163 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1954 transitions. [2021-06-05 13:30:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:16,164 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:16,164 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:16,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 13:30:16,165 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash 947468028, now seen corresponding path program 17 times [2021-06-05 13:30:16,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:16,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713407680] [2021-06-05 13:30:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:16,217 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:30:16,218 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:16,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713407680] [2021-06-05 13:30:16,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713407680] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:16,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:16,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:16,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339043358] [2021-06-05 13:30:16,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:16,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:16,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:16,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:16,219 INFO L87 Difference]: Start difference. First operand 577 states and 1954 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:16,249 INFO L93 Difference]: Finished difference Result 1241 states and 3972 transitions. [2021-06-05 13:30:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:16,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:16,251 INFO L225 Difference]: With dead ends: 1241 [2021-06-05 13:30:16,251 INFO L226 Difference]: Without dead ends: 1107 [2021-06-05 13:30:16,252 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 49.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-06-05 13:30:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 603. [2021-06-05 13:30:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 3.3637873754152823) internal successors, (2025), 602 states have internal predecessors, (2025), 0 states have call successors, (0), 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:30:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 2025 transitions. [2021-06-05 13:30:16,265 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 2025 transitions. Word has length 21 [2021-06-05 13:30:16,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:16,265 INFO L482 AbstractCegarLoop]: Abstraction has 603 states and 2025 transitions. [2021-06-05 13:30:16,265 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 2025 transitions. [2021-06-05 13:30:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:16,266 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:16,266 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:16,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 13:30:16,267 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:16,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1035404762, now seen corresponding path program 18 times [2021-06-05 13:30:16,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:16,267 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732096258] [2021-06-05 13:30:16,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:16,324 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:30:16,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:16,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732096258] [2021-06-05 13:30:16,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732096258] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:16,324 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:16,324 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:16,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188973987] [2021-06-05 13:30:16,325 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:16,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:16,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:16,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:16,325 INFO L87 Difference]: Start difference. First operand 603 states and 2025 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:16,362 INFO L93 Difference]: Finished difference Result 1222 states and 3891 transitions. [2021-06-05 13:30:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:16,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:16,365 INFO L225 Difference]: With dead ends: 1222 [2021-06-05 13:30:16,365 INFO L226 Difference]: Without dead ends: 1071 [2021-06-05 13:30:16,365 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2021-06-05 13:30:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 567. [2021-06-05 13:30:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 3.3992932862190814) internal successors, (1924), 566 states have internal predecessors, (1924), 0 states have call successors, (0), 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:30:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1924 transitions. [2021-06-05 13:30:16,378 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1924 transitions. Word has length 21 [2021-06-05 13:30:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:16,378 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1924 transitions. [2021-06-05 13:30:16,378 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,378 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1924 transitions. [2021-06-05 13:30:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:16,379 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:16,379 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:16,379 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 13:30:16,379 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash 873653722, now seen corresponding path program 19 times [2021-06-05 13:30:16,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:16,380 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240130425] [2021-06-05 13:30:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:16,431 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:30:16,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:16,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240130425] [2021-06-05 13:30:16,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240130425] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:16,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:16,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:16,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210985118] [2021-06-05 13:30:16,432 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:16,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:16,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:16,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:16,432 INFO L87 Difference]: Start difference. First operand 567 states and 1924 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:16,473 INFO L93 Difference]: Finished difference Result 1130 states and 3615 transitions. [2021-06-05 13:30:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:16,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:16,475 INFO L225 Difference]: With dead ends: 1130 [2021-06-05 13:30:16,475 INFO L226 Difference]: Without dead ends: 1027 [2021-06-05 13:30:16,476 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:16,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2021-06-05 13:30:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 585. [2021-06-05 13:30:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 3.392123287671233) internal successors, (1981), 584 states have internal predecessors, (1981), 0 states have call successors, (0), 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:30:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1981 transitions. [2021-06-05 13:30:16,498 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1981 transitions. Word has length 21 [2021-06-05 13:30:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:16,498 INFO L482 AbstractCegarLoop]: Abstraction has 585 states and 1981 transitions. [2021-06-05 13:30:16,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1981 transitions. [2021-06-05 13:30:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:16,499 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:16,499 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:16,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 13:30:16,499 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:16,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:16,499 INFO L82 PathProgramCache]: Analyzing trace with hash -59461670, now seen corresponding path program 20 times [2021-06-05 13:30:16,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:16,500 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644012586] [2021-06-05 13:30:16,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:16,556 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:30:16,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:16,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644012586] [2021-06-05 13:30:16,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644012586] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:16,556 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:16,556 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:16,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211301891] [2021-06-05 13:30:16,556 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:16,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:16,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:16,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:16,557 INFO L87 Difference]: Start difference. First operand 585 states and 1981 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:16,596 INFO L93 Difference]: Finished difference Result 1144 states and 3652 transitions. [2021-06-05 13:30:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:16,598 INFO L225 Difference]: With dead ends: 1144 [2021-06-05 13:30:16,599 INFO L226 Difference]: Without dead ends: 1015 [2021-06-05 13:30:16,599 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-06-05 13:30:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 573. [2021-06-05 13:30:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 3.3968531468531467) internal successors, (1943), 572 states have internal predecessors, (1943), 0 states have call successors, (0), 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:30:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1943 transitions. [2021-06-05 13:30:16,612 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1943 transitions. Word has length 21 [2021-06-05 13:30:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:16,612 INFO L482 AbstractCegarLoop]: Abstraction has 573 states and 1943 transitions. [2021-06-05 13:30:16,612 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1943 transitions. [2021-06-05 13:30:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:16,613 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:16,613 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:16,613 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 13:30:16,613 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:16,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1169683272, now seen corresponding path program 21 times [2021-06-05 13:30:16,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:16,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501555184] [2021-06-05 13:30:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:16,671 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:30:16,672 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:16,672 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501555184] [2021-06-05 13:30:16,672 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501555184] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:16,672 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:16,672 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:16,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357415840] [2021-06-05 13:30:16,672 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:16,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:16,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:16,673 INFO L87 Difference]: Start difference. First operand 573 states and 1943 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:16,717 INFO L93 Difference]: Finished difference Result 1128 states and 3604 transitions. [2021-06-05 13:30:16,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:16,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:16,720 INFO L225 Difference]: With dead ends: 1128 [2021-06-05 13:30:16,720 INFO L226 Difference]: Without dead ends: 1025 [2021-06-05 13:30:16,720 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 55.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2021-06-05 13:30:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 585. [2021-06-05 13:30:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 3.381849315068493) internal successors, (1975), 584 states have internal predecessors, (1975), 0 states have call successors, (0), 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:30:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1975 transitions. [2021-06-05 13:30:16,733 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1975 transitions. Word has length 21 [2021-06-05 13:30:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:16,733 INFO L482 AbstractCegarLoop]: Abstraction has 585 states and 1975 transitions. [2021-06-05 13:30:16,733 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1975 transitions. [2021-06-05 13:30:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:16,735 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:16,735 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:16,735 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 13:30:16,735 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:16,735 INFO L82 PathProgramCache]: Analyzing trace with hash -65892390, now seen corresponding path program 22 times [2021-06-05 13:30:16,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:16,735 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373512226] [2021-06-05 13:30:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:16,789 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:30:16,789 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:16,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373512226] [2021-06-05 13:30:16,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373512226] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:16,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:16,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:16,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572427915] [2021-06-05 13:30:16,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:16,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:16,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:16,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:16,790 INFO L87 Difference]: Start difference. First operand 585 states and 1975 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:16,830 INFO L93 Difference]: Finished difference Result 1140 states and 3636 transitions. [2021-06-05 13:30:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:16,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:16,832 INFO L225 Difference]: With dead ends: 1140 [2021-06-05 13:30:16,832 INFO L226 Difference]: Without dead ends: 1013 [2021-06-05 13:30:16,833 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 55.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2021-06-05 13:30:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 573. [2021-06-05 13:30:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 3.3863636363636362) internal successors, (1937), 572 states have internal predecessors, (1937), 0 states have call successors, (0), 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:30:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1937 transitions. [2021-06-05 13:30:16,845 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1937 transitions. Word has length 21 [2021-06-05 13:30:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:16,845 INFO L482 AbstractCegarLoop]: Abstraction has 573 states and 1937 transitions. [2021-06-05 13:30:16,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1937 transitions. [2021-06-05 13:30:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:16,846 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:16,846 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:16,846 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 13:30:16,846 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:16,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1537010138, now seen corresponding path program 23 times [2021-06-05 13:30:16,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:16,847 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981157270] [2021-06-05 13:30:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:16,897 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:30:16,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:16,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981157270] [2021-06-05 13:30:16,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981157270] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:16,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:16,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:16,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269615383] [2021-06-05 13:30:16,898 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:16,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:16,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:16,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:16,899 INFO L87 Difference]: Start difference. First operand 573 states and 1937 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:16,939 INFO L93 Difference]: Finished difference Result 1162 states and 3721 transitions. [2021-06-05 13:30:16,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:16,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:16,942 INFO L225 Difference]: With dead ends: 1162 [2021-06-05 13:30:16,942 INFO L226 Difference]: Without dead ends: 1045 [2021-06-05 13:30:16,942 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-06-05 13:30:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 591. [2021-06-05 13:30:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 3.369491525423729) internal successors, (1988), 590 states have internal predecessors, (1988), 0 states have call successors, (0), 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:30:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1988 transitions. [2021-06-05 13:30:16,955 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1988 transitions. Word has length 21 [2021-06-05 13:30:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:16,955 INFO L482 AbstractCegarLoop]: Abstraction has 591 states and 1988 transitions. [2021-06-05 13:30:16,955 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1988 transitions. [2021-06-05 13:30:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:16,956 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:16,956 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:16,956 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 13:30:16,956 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:16,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:16,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1208627256, now seen corresponding path program 24 times [2021-06-05 13:30:16,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:16,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958865564] [2021-06-05 13:30:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:17,007 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:30:17,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:17,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958865564] [2021-06-05 13:30:17,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958865564] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:17,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:17,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:17,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620300468] [2021-06-05 13:30:17,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:17,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:17,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:17,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:17,008 INFO L87 Difference]: Start difference. First operand 591 states and 1988 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:17,047 INFO L93 Difference]: Finished difference Result 1160 states and 3698 transitions. [2021-06-05 13:30:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:17,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:17,050 INFO L225 Difference]: With dead ends: 1160 [2021-06-05 13:30:17,050 INFO L226 Difference]: Without dead ends: 1010 [2021-06-05 13:30:17,050 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-06-05 13:30:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 556. [2021-06-05 13:30:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.427027027027027) internal successors, (1902), 555 states have internal predecessors, (1902), 0 states have call successors, (0), 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:30:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1902 transitions. [2021-06-05 13:30:17,062 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1902 transitions. Word has length 21 [2021-06-05 13:30:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:17,062 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1902 transitions. [2021-06-05 13:30:17,062 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1902 transitions. [2021-06-05 13:30:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:17,063 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:17,063 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:17,063 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 13:30:17,064 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:17,064 INFO L82 PathProgramCache]: Analyzing trace with hash -281686468, now seen corresponding path program 25 times [2021-06-05 13:30:17,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:17,064 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706571215] [2021-06-05 13:30:17,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:17,115 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:30:17,115 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:17,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706571215] [2021-06-05 13:30:17,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706571215] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:17,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:17,115 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:17,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38554677] [2021-06-05 13:30:17,116 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:17,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:17,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:17,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:17,116 INFO L87 Difference]: Start difference. First operand 556 states and 1902 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:17,169 INFO L93 Difference]: Finished difference Result 1242 states and 3976 transitions. [2021-06-05 13:30:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:17,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:17,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:17,172 INFO L225 Difference]: With dead ends: 1242 [2021-06-05 13:30:17,172 INFO L226 Difference]: Without dead ends: 1108 [2021-06-05 13:30:17,172 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 71.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2021-06-05 13:30:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 591. [2021-06-05 13:30:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 3.3813559322033897) internal successors, (1995), 590 states have internal predecessors, (1995), 0 states have call successors, (0), 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:30:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1995 transitions. [2021-06-05 13:30:17,184 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1995 transitions. Word has length 21 [2021-06-05 13:30:17,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:17,185 INFO L482 AbstractCegarLoop]: Abstraction has 591 states and 1995 transitions. [2021-06-05 13:30:17,185 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1995 transitions. [2021-06-05 13:30:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:17,186 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:17,186 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:17,186 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 13:30:17,186 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash 770231932, now seen corresponding path program 26 times [2021-06-05 13:30:17,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:17,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838948230] [2021-06-05 13:30:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:17,238 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:30:17,239 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:17,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838948230] [2021-06-05 13:30:17,239 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838948230] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:17,239 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:17,239 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:17,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353154940] [2021-06-05 13:30:17,239 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:17,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:17,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:17,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:17,239 INFO L87 Difference]: Start difference. First operand 591 states and 1995 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:17,282 INFO L93 Difference]: Finished difference Result 1225 states and 3899 transitions. [2021-06-05 13:30:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:17,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:17,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:17,284 INFO L225 Difference]: With dead ends: 1225 [2021-06-05 13:30:17,284 INFO L226 Difference]: Without dead ends: 1073 [2021-06-05 13:30:17,284 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 57.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-06-05 13:30:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 556. [2021-06-05 13:30:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.4018018018018017) internal successors, (1888), 555 states have internal predecessors, (1888), 0 states have call successors, (0), 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:30:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1888 transitions. [2021-06-05 13:30:17,297 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1888 transitions. Word has length 21 [2021-06-05 13:30:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:17,297 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1888 transitions. [2021-06-05 13:30:17,297 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1888 transitions. [2021-06-05 13:30:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:17,298 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:17,298 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:17,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 13:30:17,298 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1892039334, now seen corresponding path program 27 times [2021-06-05 13:30:17,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:17,298 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675199584] [2021-06-05 13:30:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:17,356 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:30:17,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:17,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675199584] [2021-06-05 13:30:17,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675199584] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:17,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:17,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:17,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499309179] [2021-06-05 13:30:17,357 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:17,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:17,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:17,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:17,358 INFO L87 Difference]: Start difference. First operand 556 states and 1888 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:17,407 INFO L93 Difference]: Finished difference Result 1182 states and 3766 transitions. [2021-06-05 13:30:17,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:17,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:17,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:17,410 INFO L225 Difference]: With dead ends: 1182 [2021-06-05 13:30:17,410 INFO L226 Difference]: Without dead ends: 1079 [2021-06-05 13:30:17,411 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-06-05 13:30:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 576. [2021-06-05 13:30:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 3.3878260869565215) internal successors, (1948), 575 states have internal predecessors, (1948), 0 states have call successors, (0), 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:30:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1948 transitions. [2021-06-05 13:30:17,423 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1948 transitions. Word has length 21 [2021-06-05 13:30:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:17,423 INFO L482 AbstractCegarLoop]: Abstraction has 576 states and 1948 transitions. [2021-06-05 13:30:17,423 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1948 transitions. [2021-06-05 13:30:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:17,424 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:17,424 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:17,424 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 13:30:17,424 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:17,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:17,425 INFO L82 PathProgramCache]: Analyzing trace with hash 537500988, now seen corresponding path program 28 times [2021-06-05 13:30:17,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:17,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934406552] [2021-06-05 13:30:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:17,481 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:30:17,481 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:17,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934406552] [2021-06-05 13:30:17,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934406552] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:17,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:17,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:17,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320767470] [2021-06-05 13:30:17,482 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:17,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:17,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:17,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:17,482 INFO L87 Difference]: Start difference. First operand 576 states and 1948 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:17,512 INFO L93 Difference]: Finished difference Result 1213 states and 3853 transitions. [2021-06-05 13:30:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:17,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:17,515 INFO L225 Difference]: With dead ends: 1213 [2021-06-05 13:30:17,515 INFO L226 Difference]: Without dead ends: 1059 [2021-06-05 13:30:17,515 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 52.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2021-06-05 13:30:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 556. [2021-06-05 13:30:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.383783783783784) internal successors, (1878), 555 states have internal predecessors, (1878), 0 states have call successors, (0), 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:30:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1878 transitions. [2021-06-05 13:30:17,527 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1878 transitions. Word has length 21 [2021-06-05 13:30:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:17,527 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1878 transitions. [2021-06-05 13:30:17,527 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1878 transitions. [2021-06-05 13:30:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:17,528 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:17,528 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:17,528 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 13:30:17,528 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:17,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:17,529 INFO L82 PathProgramCache]: Analyzing trace with hash -315771494, now seen corresponding path program 29 times [2021-06-05 13:30:17,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:17,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153397775] [2021-06-05 13:30:17,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:17,577 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:30:17,577 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:17,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153397775] [2021-06-05 13:30:17,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153397775] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:17,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:17,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:17,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534853621] [2021-06-05 13:30:17,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:17,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:17,578 INFO L87 Difference]: Start difference. First operand 556 states and 1878 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:17,617 INFO L93 Difference]: Finished difference Result 1157 states and 3678 transitions. [2021-06-05 13:30:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:17,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:17,620 INFO L225 Difference]: With dead ends: 1157 [2021-06-05 13:30:17,620 INFO L226 Difference]: Without dead ends: 1054 [2021-06-05 13:30:17,620 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 55.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-06-05 13:30:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 568. [2021-06-05 13:30:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 3.368606701940035) internal successors, (1910), 567 states have internal predecessors, (1910), 0 states have call successors, (0), 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:30:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1910 transitions. [2021-06-05 13:30:17,633 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1910 transitions. Word has length 21 [2021-06-05 13:30:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:17,633 INFO L482 AbstractCegarLoop]: Abstraction has 568 states and 1910 transitions. [2021-06-05 13:30:17,633 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1910 transitions. [2021-06-05 13:30:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:17,634 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:17,634 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:17,634 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 13:30:17,634 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:17,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1248886886, now seen corresponding path program 30 times [2021-06-05 13:30:17,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:17,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451264395] [2021-06-05 13:30:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:17,680 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:30:17,680 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:17,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451264395] [2021-06-05 13:30:17,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451264395] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:17,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:17,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:17,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535134289] [2021-06-05 13:30:17,681 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:17,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:17,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:17,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:17,681 INFO L87 Difference]: Start difference. First operand 568 states and 1910 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:17,722 INFO L93 Difference]: Finished difference Result 1171 states and 3715 transitions. [2021-06-05 13:30:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:17,724 INFO L225 Difference]: With dead ends: 1171 [2021-06-05 13:30:17,725 INFO L226 Difference]: Without dead ends: 1028 [2021-06-05 13:30:17,725 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-06-05 13:30:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 542. [2021-06-05 13:30:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 3.406654343807763) internal successors, (1843), 541 states have internal predecessors, (1843), 0 states have call successors, (0), 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:30:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1843 transitions. [2021-06-05 13:30:17,737 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1843 transitions. Word has length 21 [2021-06-05 13:30:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:17,737 INFO L482 AbstractCegarLoop]: Abstraction has 542 states and 1843 transitions. [2021-06-05 13:30:17,737 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1843 transitions. [2021-06-05 13:30:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:17,738 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:17,738 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:17,738 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 13:30:17,738 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:17,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2039974810, now seen corresponding path program 31 times [2021-06-05 13:30:17,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:17,738 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146237963] [2021-06-05 13:30:17,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:17,831 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:30:17,831 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:17,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146237963] [2021-06-05 13:30:17,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146237963] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:17,831 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:17,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:17,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606214155] [2021-06-05 13:30:17,832 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:17,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:17,832 INFO L87 Difference]: Start difference. First operand 542 states and 1843 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:17,869 INFO L93 Difference]: Finished difference Result 1207 states and 3850 transitions. [2021-06-05 13:30:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:17,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:17,872 INFO L225 Difference]: With dead ends: 1207 [2021-06-05 13:30:17,872 INFO L226 Difference]: Without dead ends: 1073 [2021-06-05 13:30:17,872 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-06-05 13:30:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 591. [2021-06-05 13:30:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 3.371186440677966) internal successors, (1989), 590 states have internal predecessors, (1989), 0 states have call successors, (0), 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:30:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1989 transitions. [2021-06-05 13:30:17,887 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1989 transitions. Word has length 21 [2021-06-05 13:30:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:17,887 INFO L482 AbstractCegarLoop]: Abstraction has 591 states and 1989 transitions. [2021-06-05 13:30:17,887 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1989 transitions. [2021-06-05 13:30:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:17,888 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:17,888 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:17,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 13:30:17,888 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1203074086, now seen corresponding path program 32 times [2021-06-05 13:30:17,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:17,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046910053] [2021-06-05 13:30:17,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:17,949 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:30:17,949 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:17,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046910053] [2021-06-05 13:30:17,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046910053] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:17,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:17,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:17,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457387783] [2021-06-05 13:30:17,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:17,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:17,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:17,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:17,950 INFO L87 Difference]: Start difference. First operand 591 states and 1989 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:17,999 INFO L93 Difference]: Finished difference Result 1190 states and 3773 transitions. [2021-06-05 13:30:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:17,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:18,002 INFO L225 Difference]: With dead ends: 1190 [2021-06-05 13:30:18,002 INFO L226 Difference]: Without dead ends: 1038 [2021-06-05 13:30:18,002 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-06-05 13:30:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 556. [2021-06-05 13:30:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.390990990990991) internal successors, (1882), 555 states have internal predecessors, (1882), 0 states have call successors, (0), 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:30:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1882 transitions. [2021-06-05 13:30:18,017 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1882 transitions. Word has length 21 [2021-06-05 13:30:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:18,017 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1882 transitions. [2021-06-05 13:30:18,017 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1882 transitions. [2021-06-05 13:30:18,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:18,018 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:18,018 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:18,018 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 13:30:18,018 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:18,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:18,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1641198536, now seen corresponding path program 1 times [2021-06-05 13:30:18,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:18,019 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301336023] [2021-06-05 13:30:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:18,025 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:30:18,025 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:18,025 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301336023] [2021-06-05 13:30:18,025 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301336023] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:18,025 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:18,025 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 13:30:18,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866570348] [2021-06-05 13:30:18,026 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 13:30:18,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 13:30:18,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 13:30:18,026 INFO L87 Difference]: Start difference. First operand 556 states and 1882 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:18,029 INFO L93 Difference]: Finished difference Result 473 states and 1551 transitions. [2021-06-05 13:30:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 13:30:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:18,030 INFO L225 Difference]: With dead ends: 473 [2021-06-05 13:30:18,030 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 13:30:18,030 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 13:30:18,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 13:30:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2021-06-05 13:30:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2860169491525424) internal successors, (1551), 472 states have internal predecessors, (1551), 0 states have call successors, (0), 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:30:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1551 transitions. [2021-06-05 13:30:18,039 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1551 transitions. Word has length 21 [2021-06-05 13:30:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:18,040 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1551 transitions. [2021-06-05 13:30:18,040 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1551 transitions. [2021-06-05 13:30:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:18,041 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:18,041 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:18,041 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 13:30:18,041 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:18,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:18,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1800136862, now seen corresponding path program 33 times [2021-06-05 13:30:18,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:18,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174737715] [2021-06-05 13:30:18,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:18,100 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:30:18,101 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:18,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174737715] [2021-06-05 13:30:18,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174737715] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:18,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:18,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:18,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87930989] [2021-06-05 13:30:18,101 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:18,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:18,101 INFO L87 Difference]: Start difference. First operand 473 states and 1551 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:18,130 INFO L93 Difference]: Finished difference Result 940 states and 2857 transitions. [2021-06-05 13:30:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:18,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:18,132 INFO L225 Difference]: With dead ends: 940 [2021-06-05 13:30:18,132 INFO L226 Difference]: Without dead ends: 861 [2021-06-05 13:30:18,132 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-06-05 13:30:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 489. [2021-06-05 13:30:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 3.276639344262295) internal successors, (1599), 488 states have internal predecessors, (1599), 0 states have call successors, (0), 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:30:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1599 transitions. [2021-06-05 13:30:18,141 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1599 transitions. Word has length 21 [2021-06-05 13:30:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:18,142 INFO L482 AbstractCegarLoop]: Abstraction has 489 states and 1599 transitions. [2021-06-05 13:30:18,142 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1599 transitions. [2021-06-05 13:30:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:18,142 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:18,143 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:18,143 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 13:30:18,143 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:18,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1471753980, now seen corresponding path program 34 times [2021-06-05 13:30:18,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:18,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7317106] [2021-06-05 13:30:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:18,203 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:30:18,203 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:18,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7317106] [2021-06-05 13:30:18,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7317106] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:18,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:18,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:18,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290666366] [2021-06-05 13:30:18,203 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:18,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:18,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:18,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:18,204 INFO L87 Difference]: Start difference. First operand 489 states and 1599 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:18,232 INFO L93 Difference]: Finished difference Result 924 states and 2801 transitions. [2021-06-05 13:30:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:18,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:18,234 INFO L225 Difference]: With dead ends: 924 [2021-06-05 13:30:18,234 INFO L226 Difference]: Without dead ends: 798 [2021-06-05 13:30:18,234 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:18,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-06-05 13:30:18,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 473. [2021-06-05 13:30:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2690677966101696) internal successors, (1543), 472 states have internal predecessors, (1543), 0 states have call successors, (0), 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:30:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1543 transitions. [2021-06-05 13:30:18,244 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1543 transitions. Word has length 21 [2021-06-05 13:30:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:18,244 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1543 transitions. [2021-06-05 13:30:18,244 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1543 transitions. [2021-06-05 13:30:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:18,245 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:18,245 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:18,245 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 13:30:18,245 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash -243200132, now seen corresponding path program 35 times [2021-06-05 13:30:18,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:18,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010287411] [2021-06-05 13:30:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:18,307 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:30:18,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:18,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010287411] [2021-06-05 13:30:18,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010287411] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:18,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:18,308 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:18,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351164298] [2021-06-05 13:30:18,308 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:18,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:18,308 INFO L87 Difference]: Start difference. First operand 473 states and 1543 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:18,337 INFO L93 Difference]: Finished difference Result 915 states and 2771 transitions. [2021-06-05 13:30:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:18,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:18,340 INFO L225 Difference]: With dead ends: 915 [2021-06-05 13:30:18,340 INFO L226 Difference]: Without dead ends: 836 [2021-06-05 13:30:18,340 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 59.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:18,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-06-05 13:30:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 481. [2021-06-05 13:30:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 3.25625) internal successors, (1563), 480 states have internal predecessors, (1563), 0 states have call successors, (0), 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:30:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1563 transitions. [2021-06-05 13:30:18,349 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1563 transitions. Word has length 21 [2021-06-05 13:30:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:18,349 INFO L482 AbstractCegarLoop]: Abstraction has 481 states and 1563 transitions. [2021-06-05 13:30:18,349 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1563 transitions. [2021-06-05 13:30:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:18,350 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:18,350 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:18,350 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 13:30:18,350 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:18,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:18,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1734695044, now seen corresponding path program 36 times [2021-06-05 13:30:18,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:18,351 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256895863] [2021-06-05 13:30:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:18,409 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:30:18,409 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:18,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256895863] [2021-06-05 13:30:18,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256895863] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:18,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:18,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:18,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949181960] [2021-06-05 13:30:18,410 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:18,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:18,410 INFO L87 Difference]: Start difference. First operand 481 states and 1563 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:18,451 INFO L93 Difference]: Finished difference Result 899 states and 2715 transitions. [2021-06-05 13:30:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:18,453 INFO L225 Difference]: With dead ends: 899 [2021-06-05 13:30:18,453 INFO L226 Difference]: Without dead ends: 786 [2021-06-05 13:30:18,454 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 69.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2021-06-05 13:30:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 461. [2021-06-05 13:30:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 3.2891304347826087) internal successors, (1513), 460 states have internal predecessors, (1513), 0 states have call successors, (0), 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:30:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1513 transitions. [2021-06-05 13:30:18,462 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1513 transitions. Word has length 21 [2021-06-05 13:30:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:18,462 INFO L482 AbstractCegarLoop]: Abstraction has 461 states and 1513 transitions. [2021-06-05 13:30:18,463 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1513 transitions. [2021-06-05 13:30:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:18,463 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:18,463 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:18,463 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 13:30:18,464 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash 749113148, now seen corresponding path program 37 times [2021-06-05 13:30:18,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:18,464 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404335768] [2021-06-05 13:30:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:18,538 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:30:18,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:18,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404335768] [2021-06-05 13:30:18,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404335768] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:18,539 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:18,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:18,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534574020] [2021-06-05 13:30:18,539 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:18,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:18,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:18,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:18,540 INFO L87 Difference]: Start difference. First operand 461 states and 1513 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:18,595 INFO L93 Difference]: Finished difference Result 927 states and 2839 transitions. [2021-06-05 13:30:18,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:18,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:18,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:18,598 INFO L225 Difference]: With dead ends: 927 [2021-06-05 13:30:18,598 INFO L226 Difference]: Without dead ends: 840 [2021-06-05 13:30:18,598 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-06-05 13:30:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 477. [2021-06-05 13:30:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.28781512605042) internal successors, (1565), 476 states have internal predecessors, (1565), 0 states have call successors, (0), 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:30:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1565 transitions. [2021-06-05 13:30:18,607 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1565 transitions. Word has length 21 [2021-06-05 13:30:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:18,607 INFO L482 AbstractCegarLoop]: Abstraction has 477 states and 1565 transitions. [2021-06-05 13:30:18,607 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1565 transitions. [2021-06-05 13:30:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:18,608 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:18,608 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:18,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 13:30:18,608 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:18,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:18,608 INFO L82 PathProgramCache]: Analyzing trace with hash 997222278, now seen corresponding path program 38 times [2021-06-05 13:30:18,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:18,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368541508] [2021-06-05 13:30:18,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:18,669 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:30:18,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:18,669 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368541508] [2021-06-05 13:30:18,669 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368541508] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:18,669 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:18,669 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:18,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295336010] [2021-06-05 13:30:18,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:18,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:18,670 INFO L87 Difference]: Start difference. First operand 477 states and 1565 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:18,698 INFO L93 Difference]: Finished difference Result 919 states and 2803 transitions. [2021-06-05 13:30:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:18,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:18,700 INFO L225 Difference]: With dead ends: 919 [2021-06-05 13:30:18,700 INFO L226 Difference]: Without dead ends: 832 [2021-06-05 13:30:18,701 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-06-05 13:30:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 469. [2021-06-05 13:30:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.2927350427350426) internal successors, (1541), 468 states have internal predecessors, (1541), 0 states have call successors, (0), 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:30:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1541 transitions. [2021-06-05 13:30:18,709 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1541 transitions. Word has length 21 [2021-06-05 13:30:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:18,709 INFO L482 AbstractCegarLoop]: Abstraction has 469 states and 1541 transitions. [2021-06-05 13:30:18,709 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1541 transitions. [2021-06-05 13:30:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:18,710 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:18,710 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:18,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 13:30:18,710 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1294223846, now seen corresponding path program 39 times [2021-06-05 13:30:18,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:18,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025447802] [2021-06-05 13:30:18,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:18,766 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:30:18,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:18,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025447802] [2021-06-05 13:30:18,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025447802] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:18,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:18,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:18,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269920284] [2021-06-05 13:30:18,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:18,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:18,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:18,767 INFO L87 Difference]: Start difference. First operand 469 states and 1541 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:18,802 INFO L93 Difference]: Finished difference Result 950 states and 2902 transitions. [2021-06-05 13:30:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:18,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:18,804 INFO L225 Difference]: With dead ends: 950 [2021-06-05 13:30:18,804 INFO L226 Difference]: Without dead ends: 863 [2021-06-05 13:30:18,804 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 63.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2021-06-05 13:30:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 489. [2021-06-05 13:30:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 3.2807377049180326) internal successors, (1601), 488 states have internal predecessors, (1601), 0 states have call successors, (0), 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:30:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1601 transitions. [2021-06-05 13:30:18,813 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1601 transitions. Word has length 21 [2021-06-05 13:30:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:18,813 INFO L482 AbstractCegarLoop]: Abstraction has 489 states and 1601 transitions. [2021-06-05 13:30:18,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1601 transitions. [2021-06-05 13:30:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:18,814 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:18,814 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:18,814 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 13:30:18,814 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2141739260, now seen corresponding path program 40 times [2021-06-05 13:30:18,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:18,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527816803] [2021-06-05 13:30:18,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:18,874 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:30:18,874 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:18,874 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527816803] [2021-06-05 13:30:18,874 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527816803] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:18,874 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:18,874 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:18,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886951122] [2021-06-05 13:30:18,874 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:18,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:18,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:18,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:18,875 INFO L87 Difference]: Start difference. First operand 489 states and 1601 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:18,908 INFO L93 Difference]: Finished difference Result 973 states and 2957 transitions. [2021-06-05 13:30:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:18,910 INFO L225 Difference]: With dead ends: 973 [2021-06-05 13:30:18,910 INFO L226 Difference]: Without dead ends: 843 [2021-06-05 13:30:18,910 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 57.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-06-05 13:30:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 469. [2021-06-05 13:30:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.2756410256410255) internal successors, (1533), 468 states have internal predecessors, (1533), 0 states have call successors, (0), 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:30:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1533 transitions. [2021-06-05 13:30:18,919 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1533 transitions. Word has length 21 [2021-06-05 13:30:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:18,919 INFO L482 AbstractCegarLoop]: Abstraction has 469 states and 1533 transitions. [2021-06-05 13:30:18,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1533 transitions. [2021-06-05 13:30:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:18,920 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:18,920 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:18,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 13:30:18,920 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:18,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:18,920 INFO L82 PathProgramCache]: Analyzing trace with hash 644082788, now seen corresponding path program 41 times [2021-06-05 13:30:18,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:18,920 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777432820] [2021-06-05 13:30:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:18,997 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:30:18,997 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:18,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777432820] [2021-06-05 13:30:18,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777432820] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:18,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:18,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:18,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543215873] [2021-06-05 13:30:18,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:18,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:18,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:18,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:18,998 INFO L87 Difference]: Start difference. First operand 469 states and 1533 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:19,030 INFO L93 Difference]: Finished difference Result 930 states and 2822 transitions. [2021-06-05 13:30:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:19,032 INFO L225 Difference]: With dead ends: 930 [2021-06-05 13:30:19,032 INFO L226 Difference]: Without dead ends: 851 [2021-06-05 13:30:19,033 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2021-06-05 13:30:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 485. [2021-06-05 13:30:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 3.2665289256198347) internal successors, (1581), 484 states have internal predecessors, (1581), 0 states have call successors, (0), 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:30:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1581 transitions. [2021-06-05 13:30:19,042 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1581 transitions. Word has length 21 [2021-06-05 13:30:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:19,042 INFO L482 AbstractCegarLoop]: Abstraction has 485 states and 1581 transitions. [2021-06-05 13:30:19,042 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1581 transitions. [2021-06-05 13:30:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:19,043 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:19,043 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:19,043 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 13:30:19,043 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:19,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:19,043 INFO L82 PathProgramCache]: Analyzing trace with hash -945851962, now seen corresponding path program 42 times [2021-06-05 13:30:19,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:19,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934610344] [2021-06-05 13:30:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:19,101 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:30:19,101 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:19,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934610344] [2021-06-05 13:30:19,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934610344] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:19,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:19,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:19,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770468938] [2021-06-05 13:30:19,101 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:19,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:19,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:19,102 INFO L87 Difference]: Start difference. First operand 485 states and 1581 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:19,132 INFO L93 Difference]: Finished difference Result 914 states and 2766 transitions. [2021-06-05 13:30:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:19,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:19,133 INFO L225 Difference]: With dead ends: 914 [2021-06-05 13:30:19,133 INFO L226 Difference]: Without dead ends: 780 [2021-06-05 13:30:19,133 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 57.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-06-05 13:30:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 461. [2021-06-05 13:30:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 3.2804347826086957) internal successors, (1509), 460 states have internal predecessors, (1509), 0 states have call successors, (0), 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:30:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1509 transitions. [2021-06-05 13:30:19,142 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1509 transitions. Word has length 21 [2021-06-05 13:30:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:19,142 INFO L482 AbstractCegarLoop]: Abstraction has 461 states and 1509 transitions. [2021-06-05 13:30:19,142 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1509 transitions. [2021-06-05 13:30:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:19,143 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:19,143 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:19,143 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 13:30:19,143 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -97683814, now seen corresponding path program 43 times [2021-06-05 13:30:19,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:19,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737221679] [2021-06-05 13:30:19,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:19,190 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:30:19,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:19,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737221679] [2021-06-05 13:30:19,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737221679] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:19,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:19,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:19,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901610550] [2021-06-05 13:30:19,191 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:19,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:19,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:19,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:19,191 INFO L87 Difference]: Start difference. First operand 461 states and 1509 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:19,228 INFO L93 Difference]: Finished difference Result 890 states and 2713 transitions. [2021-06-05 13:30:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:19,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:19,230 INFO L225 Difference]: With dead ends: 890 [2021-06-05 13:30:19,230 INFO L226 Difference]: Without dead ends: 803 [2021-06-05 13:30:19,230 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 54.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2021-06-05 13:30:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 473. [2021-06-05 13:30:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2733050847457625) internal successors, (1545), 472 states have internal predecessors, (1545), 0 states have call successors, (0), 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:30:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1545 transitions. [2021-06-05 13:30:19,238 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1545 transitions. Word has length 21 [2021-06-05 13:30:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:19,238 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1545 transitions. [2021-06-05 13:30:19,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1545 transitions. [2021-06-05 13:30:19,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:19,239 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:19,239 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:19,239 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 13:30:19,239 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:19,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:19,240 INFO L82 PathProgramCache]: Analyzing trace with hash 150425316, now seen corresponding path program 44 times [2021-06-05 13:30:19,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:19,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358277560] [2021-06-05 13:30:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:19,286 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:30:19,286 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:19,286 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358277560] [2021-06-05 13:30:19,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358277560] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:19,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:19,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:19,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953885824] [2021-06-05 13:30:19,286 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:19,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:19,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:19,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:19,287 INFO L87 Difference]: Start difference. First operand 473 states and 1545 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:19,314 INFO L93 Difference]: Finished difference Result 882 states and 2677 transitions. [2021-06-05 13:30:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:19,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:19,316 INFO L225 Difference]: With dead ends: 882 [2021-06-05 13:30:19,316 INFO L226 Difference]: Without dead ends: 795 [2021-06-05 13:30:19,317 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-06-05 13:30:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 465. [2021-06-05 13:30:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 3.2780172413793105) internal successors, (1521), 464 states have internal predecessors, (1521), 0 states have call successors, (0), 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:30:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1521 transitions. [2021-06-05 13:30:19,325 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1521 transitions. Word has length 21 [2021-06-05 13:30:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:19,325 INFO L482 AbstractCegarLoop]: Abstraction has 465 states and 1521 transitions. [2021-06-05 13:30:19,325 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1521 transitions. [2021-06-05 13:30:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:19,326 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:19,326 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:19,326 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 13:30:19,326 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:19,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1094782618, now seen corresponding path program 45 times [2021-06-05 13:30:19,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:19,327 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875214889] [2021-06-05 13:30:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:19,378 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:30:19,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:19,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875214889] [2021-06-05 13:30:19,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875214889] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:19,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:19,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:19,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179044155] [2021-06-05 13:30:19,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:19,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:19,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:19,379 INFO L87 Difference]: Start difference. First operand 465 states and 1521 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:19,433 INFO L93 Difference]: Finished difference Result 896 states and 2726 transitions. [2021-06-05 13:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:19,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:19,434 INFO L225 Difference]: With dead ends: 896 [2021-06-05 13:30:19,434 INFO L226 Difference]: Without dead ends: 809 [2021-06-05 13:30:19,435 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-06-05 13:30:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 477. [2021-06-05 13:30:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.2626050420168067) internal successors, (1553), 476 states have internal predecessors, (1553), 0 states have call successors, (0), 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:30:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1553 transitions. [2021-06-05 13:30:19,478 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1553 transitions. Word has length 21 [2021-06-05 13:30:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:19,478 INFO L482 AbstractCegarLoop]: Abstraction has 477 states and 1553 transitions. [2021-06-05 13:30:19,478 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1553 transitions. [2021-06-05 13:30:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:19,479 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:19,479 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:19,479 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 13:30:19,480 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:19,480 INFO L82 PathProgramCache]: Analyzing trace with hash -421844740, now seen corresponding path program 46 times [2021-06-05 13:30:19,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:19,480 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765788422] [2021-06-05 13:30:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:19,533 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:30:19,533 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:19,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765788422] [2021-06-05 13:30:19,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765788422] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:19,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:19,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:19,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544679367] [2021-06-05 13:30:19,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:19,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:19,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:19,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:19,534 INFO L87 Difference]: Start difference. First operand 477 states and 1553 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:19,586 INFO L93 Difference]: Finished difference Result 902 states and 2731 transitions. [2021-06-05 13:30:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:19,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:19,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:19,587 INFO L225 Difference]: With dead ends: 902 [2021-06-05 13:30:19,587 INFO L226 Difference]: Without dead ends: 797 [2021-06-05 13:30:19,587 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-06-05 13:30:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 465. [2021-06-05 13:30:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 3.269396551724138) internal successors, (1517), 464 states have internal predecessors, (1517), 0 states have call successors, (0), 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:30:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1517 transitions. [2021-06-05 13:30:19,596 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1517 transitions. Word has length 21 [2021-06-05 13:30:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:19,596 INFO L482 AbstractCegarLoop]: Abstraction has 465 states and 1517 transitions. [2021-06-05 13:30:19,596 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1517 transitions. [2021-06-05 13:30:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:19,597 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:19,597 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:19,597 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 13:30:19,597 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:19,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:19,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1261878044, now seen corresponding path program 47 times [2021-06-05 13:30:19,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:19,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384300169] [2021-06-05 13:30:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:19,651 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:30:19,652 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:19,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384300169] [2021-06-05 13:30:19,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384300169] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:19,652 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:19,652 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:19,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47757450] [2021-06-05 13:30:19,652 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:19,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:19,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:19,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:19,652 INFO L87 Difference]: Start difference. First operand 465 states and 1517 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:19,681 INFO L93 Difference]: Finished difference Result 876 states and 2650 transitions. [2021-06-05 13:30:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:19,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:19,683 INFO L225 Difference]: With dead ends: 876 [2021-06-05 13:30:19,683 INFO L226 Difference]: Without dead ends: 797 [2021-06-05 13:30:19,683 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 51.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-06-05 13:30:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 473. [2021-06-05 13:30:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2563559322033897) internal successors, (1537), 472 states have internal predecessors, (1537), 0 states have call successors, (0), 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:30:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1537 transitions. [2021-06-05 13:30:19,692 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1537 transitions. Word has length 21 [2021-06-05 13:30:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:19,692 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1537 transitions. [2021-06-05 13:30:19,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1537 transitions. [2021-06-05 13:30:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:19,693 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:19,693 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:19,693 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 13:30:19,693 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:19,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1464160710, now seen corresponding path program 48 times [2021-06-05 13:30:19,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:19,693 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048967768] [2021-06-05 13:30:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:19,742 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:30:19,742 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:19,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048967768] [2021-06-05 13:30:19,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048967768] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:19,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:19,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:19,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797956289] [2021-06-05 13:30:19,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:19,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:19,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:19,743 INFO L87 Difference]: Start difference. First operand 473 states and 1537 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:19,782 INFO L93 Difference]: Finished difference Result 860 states and 2594 transitions. [2021-06-05 13:30:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:19,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:19,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:19,783 INFO L225 Difference]: With dead ends: 860 [2021-06-05 13:30:19,783 INFO L226 Difference]: Without dead ends: 749 [2021-06-05 13:30:19,783 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 60.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-06-05 13:30:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 455. [2021-06-05 13:30:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.297356828193833) internal successors, (1497), 454 states have internal predecessors, (1497), 0 states have call successors, (0), 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:30:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1497 transitions. [2021-06-05 13:30:19,791 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1497 transitions. Word has length 21 [2021-06-05 13:30:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:19,791 INFO L482 AbstractCegarLoop]: Abstraction has 455 states and 1497 transitions. [2021-06-05 13:30:19,792 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1497 transitions. [2021-06-05 13:30:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:19,792 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:19,792 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:19,792 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 13:30:19,793 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:19,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1149207288, now seen corresponding path program 49 times [2021-06-05 13:30:19,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:19,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30936946] [2021-06-05 13:30:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:19,844 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:30:19,844 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:19,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30936946] [2021-06-05 13:30:19,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30936946] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:19,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:19,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:19,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264891000] [2021-06-05 13:30:19,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:19,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:19,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:19,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:19,845 INFO L87 Difference]: Start difference. First operand 455 states and 1497 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:19,872 INFO L93 Difference]: Finished difference Result 982 states and 2989 transitions. [2021-06-05 13:30:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:19,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:19,874 INFO L225 Difference]: With dead ends: 982 [2021-06-05 13:30:19,874 INFO L226 Difference]: Without dead ends: 872 [2021-06-05 13:30:19,874 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 50.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-06-05 13:30:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 486. [2021-06-05 13:30:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 3.2494845360824742) internal successors, (1576), 485 states have internal predecessors, (1576), 0 states have call successors, (0), 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:30:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1576 transitions. [2021-06-05 13:30:19,883 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1576 transitions. Word has length 21 [2021-06-05 13:30:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:19,883 INFO L482 AbstractCegarLoop]: Abstraction has 486 states and 1576 transitions. [2021-06-05 13:30:19,883 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1576 transitions. [2021-06-05 13:30:19,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:19,884 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:19,884 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:19,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-05 13:30:19,884 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:19,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2093841608, now seen corresponding path program 50 times [2021-06-05 13:30:19,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:19,884 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249963909] [2021-06-05 13:30:19,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:19,934 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:30:19,934 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:19,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249963909] [2021-06-05 13:30:19,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249963909] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:19,934 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:19,934 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:19,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50290767] [2021-06-05 13:30:19,934 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:19,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:19,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:19,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:19,935 INFO L87 Difference]: Start difference. First operand 486 states and 1576 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:19,974 INFO L93 Difference]: Finished difference Result 965 states and 2916 transitions. [2021-06-05 13:30:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:19,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:19,976 INFO L225 Difference]: With dead ends: 965 [2021-06-05 13:30:19,976 INFO L226 Difference]: Without dead ends: 841 [2021-06-05 13:30:19,976 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:19,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2021-06-05 13:30:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 455. [2021-06-05 13:30:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.2709251101321586) internal successors, (1485), 454 states have internal predecessors, (1485), 0 states have call successors, (0), 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:30:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1485 transitions. [2021-06-05 13:30:19,984 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1485 transitions. Word has length 21 [2021-06-05 13:30:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:19,984 INFO L482 AbstractCegarLoop]: Abstraction has 455 states and 1485 transitions. [2021-06-05 13:30:19,984 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1485 transitions. [2021-06-05 13:30:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:19,985 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:19,985 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:19,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 13:30:19,985 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:19,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:19,985 INFO L82 PathProgramCache]: Analyzing trace with hash 909369340, now seen corresponding path program 51 times [2021-06-05 13:30:19,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:19,985 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598279388] [2021-06-05 13:30:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:20,047 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:30:20,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:20,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598279388] [2021-06-05 13:30:20,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598279388] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:20,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:20,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:20,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82160222] [2021-06-05 13:30:20,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:20,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:20,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:20,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:20,049 INFO L87 Difference]: Start difference. First operand 455 states and 1485 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:20,076 INFO L93 Difference]: Finished difference Result 922 states and 2791 transitions. [2021-06-05 13:30:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:20,077 INFO L225 Difference]: With dead ends: 922 [2021-06-05 13:30:20,078 INFO L226 Difference]: Without dead ends: 843 [2021-06-05 13:30:20,078 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-06-05 13:30:20,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 471. [2021-06-05 13:30:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 3.2617021276595746) internal successors, (1533), 470 states have internal predecessors, (1533), 0 states have call successors, (0), 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:30:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1533 transitions. [2021-06-05 13:30:20,086 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1533 transitions. Word has length 21 [2021-06-05 13:30:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:20,087 INFO L482 AbstractCegarLoop]: Abstraction has 471 states and 1533 transitions. [2021-06-05 13:30:20,087 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1533 transitions. [2021-06-05 13:30:20,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:20,087 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:20,087 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:20,087 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 13:30:20,088 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:20,088 INFO L82 PathProgramCache]: Analyzing trace with hash 580986458, now seen corresponding path program 52 times [2021-06-05 13:30:20,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:20,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313768907] [2021-06-05 13:30:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:20,145 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:30:20,145 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:20,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313768907] [2021-06-05 13:30:20,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313768907] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:20,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:20,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:20,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889742116] [2021-06-05 13:30:20,145 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:20,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:20,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:20,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:20,146 INFO L87 Difference]: Start difference. First operand 471 states and 1533 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:20,173 INFO L93 Difference]: Finished difference Result 953 states and 2878 transitions. [2021-06-05 13:30:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:20,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:20,174 INFO L225 Difference]: With dead ends: 953 [2021-06-05 13:30:20,174 INFO L226 Difference]: Without dead ends: 827 [2021-06-05 13:30:20,175 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 57.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-06-05 13:30:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 455. [2021-06-05 13:30:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.253303964757709) internal successors, (1477), 454 states have internal predecessors, (1477), 0 states have call successors, (0), 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:30:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1477 transitions. [2021-06-05 13:30:20,183 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1477 transitions. Word has length 21 [2021-06-05 13:30:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:20,183 INFO L482 AbstractCegarLoop]: Abstraction has 455 states and 1477 transitions. [2021-06-05 13:30:20,183 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1477 transitions. [2021-06-05 13:30:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:20,184 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:20,184 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:20,184 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-05 13:30:20,184 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:20,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1133967654, now seen corresponding path program 53 times [2021-06-05 13:30:20,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:20,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155023186] [2021-06-05 13:30:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:20,262 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:30:20,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:20,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155023186] [2021-06-05 13:30:20,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155023186] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:20,262 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:20,262 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:20,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594650426] [2021-06-05 13:30:20,263 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:20,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:20,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:20,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:20,263 INFO L87 Difference]: Start difference. First operand 455 states and 1477 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:20,291 INFO L93 Difference]: Finished difference Result 897 states and 2705 transitions. [2021-06-05 13:30:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:20,293 INFO L225 Difference]: With dead ends: 897 [2021-06-05 13:30:20,293 INFO L226 Difference]: Without dead ends: 818 [2021-06-05 13:30:20,293 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2021-06-05 13:30:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 463. [2021-06-05 13:30:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 3.24025974025974) internal successors, (1497), 462 states have internal predecessors, (1497), 0 states have call successors, (0), 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:30:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1497 transitions. [2021-06-05 13:30:20,301 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1497 transitions. Word has length 21 [2021-06-05 13:30:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:20,301 INFO L482 AbstractCegarLoop]: Abstraction has 463 states and 1497 transitions. [2021-06-05 13:30:20,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1497 transitions. [2021-06-05 13:30:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:20,302 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:20,302 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:20,302 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-05 13:30:20,302 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:20,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:20,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1669504730, now seen corresponding path program 54 times [2021-06-05 13:30:20,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:20,303 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427895376] [2021-06-05 13:30:20,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:20,359 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:30:20,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:20,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427895376] [2021-06-05 13:30:20,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427895376] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:20,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:20,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:20,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348724926] [2021-06-05 13:30:20,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:20,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:20,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:20,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:20,360 INFO L87 Difference]: Start difference. First operand 463 states and 1497 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:20,401 INFO L93 Difference]: Finished difference Result 911 states and 2742 transitions. [2021-06-05 13:30:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:20,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:20,403 INFO L225 Difference]: With dead ends: 911 [2021-06-05 13:30:20,403 INFO L226 Difference]: Without dead ends: 798 [2021-06-05 13:30:20,403 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-06-05 13:30:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 443. [2021-06-05 13:30:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.273755656108597) internal successors, (1447), 442 states have internal predecessors, (1447), 0 states have call successors, (0), 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:30:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1447 transitions. [2021-06-05 13:30:20,411 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1447 transitions. Word has length 21 [2021-06-05 13:30:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:20,411 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1447 transitions. [2021-06-05 13:30:20,411 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1447 transitions. [2021-06-05 13:30:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:20,412 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:20,412 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:20,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-05 13:30:20,412 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2053126694, now seen corresponding path program 55 times [2021-06-05 13:30:20,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:20,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190564619] [2021-06-05 13:30:20,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:20,459 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:30:20,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:20,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190564619] [2021-06-05 13:30:20,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190564619] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:20,459 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:20,459 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:20,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798543950] [2021-06-05 13:30:20,460 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:20,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:20,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:20,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:20,460 INFO L87 Difference]: Start difference. First operand 443 states and 1447 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:20,487 INFO L93 Difference]: Finished difference Result 963 states and 2923 transitions. [2021-06-05 13:30:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:20,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:20,488 INFO L225 Difference]: With dead ends: 963 [2021-06-05 13:30:20,488 INFO L226 Difference]: Without dead ends: 853 [2021-06-05 13:30:20,488 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 46.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2021-06-05 13:30:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 443. [2021-06-05 13:30:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.2217194570135748) internal successors, (1424), 442 states have internal predecessors, (1424), 0 states have call successors, (0), 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:30:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1424 transitions. [2021-06-05 13:30:20,497 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1424 transitions. Word has length 21 [2021-06-05 13:30:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:20,497 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1424 transitions. [2021-06-05 13:30:20,497 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1424 transitions. [2021-06-05 13:30:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:20,498 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:20,498 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:20,498 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-05 13:30:20,498 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:20,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1001208294, now seen corresponding path program 56 times [2021-06-05 13:30:20,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:20,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773896975] [2021-06-05 13:30:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:20,558 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:30:20,558 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:20,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773896975] [2021-06-05 13:30:20,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773896975] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:20,558 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:20,558 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:20,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134137735] [2021-06-05 13:30:20,559 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:20,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:20,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:20,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:20,559 INFO L87 Difference]: Start difference. First operand 443 states and 1424 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:20,600 INFO L93 Difference]: Finished difference Result 946 states and 2850 transitions. [2021-06-05 13:30:20,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:20,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:20,610 INFO L225 Difference]: With dead ends: 946 [2021-06-05 13:30:20,610 INFO L226 Difference]: Without dead ends: 822 [2021-06-05 13:30:20,610 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 64.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-06-05 13:30:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 412. [2021-06-05 13:30:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 3.236009732360097) internal successors, (1330), 411 states have internal predecessors, (1330), 0 states have call successors, (0), 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:30:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1330 transitions. [2021-06-05 13:30:20,618 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1330 transitions. Word has length 21 [2021-06-05 13:30:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:20,619 INFO L482 AbstractCegarLoop]: Abstraction has 412 states and 1330 transitions. [2021-06-05 13:30:20,619 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1330 transitions. [2021-06-05 13:30:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:20,619 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:20,619 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:20,619 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-05 13:30:20,620 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1785983304, now seen corresponding path program 57 times [2021-06-05 13:30:20,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:20,620 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162792520] [2021-06-05 13:30:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:20,671 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:30:20,672 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:20,672 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162792520] [2021-06-05 13:30:20,672 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162792520] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:20,672 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:20,672 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:20,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001230633] [2021-06-05 13:30:20,672 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:20,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:20,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:20,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:20,672 INFO L87 Difference]: Start difference. First operand 412 states and 1330 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:20,704 INFO L93 Difference]: Finished difference Result 905 states and 2737 transitions. [2021-06-05 13:30:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:20,706 INFO L225 Difference]: With dead ends: 905 [2021-06-05 13:30:20,706 INFO L226 Difference]: Without dead ends: 795 [2021-06-05 13:30:20,706 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 52.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-06-05 13:30:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 434. [2021-06-05 13:30:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.203233256351039) internal successors, (1387), 433 states have internal predecessors, (1387), 0 states have call successors, (0), 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:30:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1387 transitions. [2021-06-05 13:30:20,714 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1387 transitions. Word has length 21 [2021-06-05 13:30:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:20,714 INFO L482 AbstractCegarLoop]: Abstraction has 434 states and 1387 transitions. [2021-06-05 13:30:20,714 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1387 transitions. [2021-06-05 13:30:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:20,715 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:20,715 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:20,715 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-05 13:30:20,715 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:20,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:20,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1302841370, now seen corresponding path program 58 times [2021-06-05 13:30:20,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:20,715 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572077050] [2021-06-05 13:30:20,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:20,762 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:30:20,762 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:20,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572077050] [2021-06-05 13:30:20,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572077050] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:20,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:20,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:20,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776919557] [2021-06-05 13:30:20,763 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:20,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:20,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:20,763 INFO L87 Difference]: Start difference. First operand 434 states and 1387 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:20,801 INFO L93 Difference]: Finished difference Result 822 states and 2499 transitions. [2021-06-05 13:30:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:20,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:20,803 INFO L225 Difference]: With dead ends: 822 [2021-06-05 13:30:20,803 INFO L226 Difference]: Without dead ends: 709 [2021-06-05 13:30:20,803 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 55.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-06-05 13:30:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 412. [2021-06-05 13:30:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 3.2092457420924574) internal successors, (1319), 411 states have internal predecessors, (1319), 0 states have call successors, (0), 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:30:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1319 transitions. [2021-06-05 13:30:20,811 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1319 transitions. Word has length 21 [2021-06-05 13:30:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:20,811 INFO L482 AbstractCegarLoop]: Abstraction has 412 states and 1319 transitions. [2021-06-05 13:30:20,811 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1319 transitions. [2021-06-05 13:30:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:20,812 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:20,812 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:20,812 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-06-05 13:30:20,812 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:20,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:20,812 INFO L82 PathProgramCache]: Analyzing trace with hash -737228710, now seen corresponding path program 59 times [2021-06-05 13:30:20,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:20,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878715760] [2021-06-05 13:30:20,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:20,859 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:30:20,859 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:20,860 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878715760] [2021-06-05 13:30:20,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878715760] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:20,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:20,860 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:20,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423100519] [2021-06-05 13:30:20,860 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:20,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:20,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:20,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:20,860 INFO L87 Difference]: Start difference. First operand 412 states and 1319 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:20,899 INFO L93 Difference]: Finished difference Result 880 states and 2648 transitions. [2021-06-05 13:30:20,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:20,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:20,901 INFO L225 Difference]: With dead ends: 880 [2021-06-05 13:30:20,901 INFO L226 Difference]: Without dead ends: 787 [2021-06-05 13:30:20,901 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-06-05 13:30:20,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 426. [2021-06-05 13:30:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.1905882352941175) internal successors, (1356), 425 states have internal predecessors, (1356), 0 states have call successors, (0), 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:30:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1356 transitions. [2021-06-05 13:30:20,909 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1356 transitions. Word has length 21 [2021-06-05 13:30:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:20,909 INFO L482 AbstractCegarLoop]: Abstraction has 426 states and 1356 transitions. [2021-06-05 13:30:20,909 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1356 transitions. [2021-06-05 13:30:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:20,910 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:20,910 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:20,910 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-06-05 13:30:20,910 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:20,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1065611592, now seen corresponding path program 60 times [2021-06-05 13:30:20,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:20,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306252453] [2021-06-05 13:30:20,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:20,957 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:30:20,957 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:20,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306252453] [2021-06-05 13:30:20,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306252453] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:20,958 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:20,958 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:20,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554743677] [2021-06-05 13:30:20,958 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:20,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:20,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:20,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:20,958 INFO L87 Difference]: Start difference. First operand 426 states and 1356 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:20,994 INFO L93 Difference]: Finished difference Result 814 states and 2468 transitions. [2021-06-05 13:30:20,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:20,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:20,996 INFO L225 Difference]: With dead ends: 814 [2021-06-05 13:30:20,996 INFO L226 Difference]: Without dead ends: 690 [2021-06-05 13:30:20,996 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-06-05 13:30:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 393. [2021-06-05 13:30:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.2448979591836733) internal successors, (1272), 392 states have internal predecessors, (1272), 0 states have call successors, (0), 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:30:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1272 transitions. [2021-06-05 13:30:21,003 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1272 transitions. Word has length 21 [2021-06-05 13:30:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:21,003 INFO L482 AbstractCegarLoop]: Abstraction has 393 states and 1272 transitions. [2021-06-05 13:30:21,003 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1272 transitions. [2021-06-05 13:30:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:21,004 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:21,004 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:21,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-06-05 13:30:21,004 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:21,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash 910773180, now seen corresponding path program 61 times [2021-06-05 13:30:21,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:21,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807019595] [2021-06-05 13:30:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:21,081 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:30:21,081 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:21,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807019595] [2021-06-05 13:30:21,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807019595] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:21,082 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:21,082 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:21,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345264140] [2021-06-05 13:30:21,082 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:21,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:21,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:21,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:21,082 INFO L87 Difference]: Start difference. First operand 393 states and 1272 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:21,112 INFO L93 Difference]: Finished difference Result 825 states and 2485 transitions. [2021-06-05 13:30:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:21,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:21,113 INFO L225 Difference]: With dead ends: 825 [2021-06-05 13:30:21,114 INFO L226 Difference]: Without dead ends: 746 [2021-06-05 13:30:21,114 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 57.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-06-05 13:30:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 417. [2021-06-05 13:30:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.25) internal successors, (1352), 416 states have internal predecessors, (1352), 0 states have call successors, (0), 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:30:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1352 transitions. [2021-06-05 13:30:21,123 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1352 transitions. Word has length 21 [2021-06-05 13:30:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:21,123 INFO L482 AbstractCegarLoop]: Abstraction has 417 states and 1352 transitions. [2021-06-05 13:30:21,123 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1352 transitions. [2021-06-05 13:30:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:21,124 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:21,124 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:21,124 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-06-05 13:30:21,124 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash 582390298, now seen corresponding path program 62 times [2021-06-05 13:30:21,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:21,124 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285920180] [2021-06-05 13:30:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:21,185 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:30:21,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:21,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285920180] [2021-06-05 13:30:21,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285920180] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:21,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:21,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:21,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662959862] [2021-06-05 13:30:21,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:21,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:21,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:21,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:21,186 INFO L87 Difference]: Start difference. First operand 417 states and 1352 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:21,223 INFO L93 Difference]: Finished difference Result 856 states and 2572 transitions. [2021-06-05 13:30:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:21,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:21,225 INFO L225 Difference]: With dead ends: 856 [2021-06-05 13:30:21,225 INFO L226 Difference]: Without dead ends: 730 [2021-06-05 13:30:21,225 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:21,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-06-05 13:30:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 401. [2021-06-05 13:30:21,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 3.24) internal successors, (1296), 400 states have internal predecessors, (1296), 0 states have call successors, (0), 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:30:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1296 transitions. [2021-06-05 13:30:21,234 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1296 transitions. Word has length 21 [2021-06-05 13:30:21,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:21,234 INFO L482 AbstractCegarLoop]: Abstraction has 401 states and 1296 transitions. [2021-06-05 13:30:21,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1296 transitions. [2021-06-05 13:30:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:21,234 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:21,235 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:21,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-06-05 13:30:21,235 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:21,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2103239612, now seen corresponding path program 63 times [2021-06-05 13:30:21,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:21,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934223699] [2021-06-05 13:30:21,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:21,306 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:30:21,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:21,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934223699] [2021-06-05 13:30:21,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934223699] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:21,307 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:21,307 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:21,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606404927] [2021-06-05 13:30:21,307 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:21,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:21,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:21,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:21,308 INFO L87 Difference]: Start difference. First operand 401 states and 1296 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:21,347 INFO L93 Difference]: Finished difference Result 829 states and 2489 transitions. [2021-06-05 13:30:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:21,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:21,349 INFO L225 Difference]: With dead ends: 829 [2021-06-05 13:30:21,349 INFO L226 Difference]: Without dead ends: 750 [2021-06-05 13:30:21,349 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:21,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-06-05 13:30:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 409. [2021-06-05 13:30:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 3.2254901960784315) internal successors, (1316), 408 states have internal predecessors, (1316), 0 states have call successors, (0), 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:30:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1316 transitions. [2021-06-05 13:30:21,357 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1316 transitions. Word has length 21 [2021-06-05 13:30:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:21,357 INFO L482 AbstractCegarLoop]: Abstraction has 409 states and 1316 transitions. [2021-06-05 13:30:21,357 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1316 transitions. [2021-06-05 13:30:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:21,358 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:21,358 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:21,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-06-05 13:30:21,358 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1049070524, now seen corresponding path program 64 times [2021-06-05 13:30:21,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:21,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891745009] [2021-06-05 13:30:21,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:21,401 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:30:21,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:21,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891745009] [2021-06-05 13:30:21,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891745009] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:21,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:21,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:21,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358389720] [2021-06-05 13:30:21,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:21,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:21,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:21,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:21,402 INFO L87 Difference]: Start difference. First operand 409 states and 1316 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:21,436 INFO L93 Difference]: Finished difference Result 777 states and 2360 transitions. [2021-06-05 13:30:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:21,438 INFO L225 Difference]: With dead ends: 777 [2021-06-05 13:30:21,438 INFO L226 Difference]: Without dead ends: 678 [2021-06-05 13:30:21,438 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 52.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-06-05 13:30:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 401. [2021-06-05 13:30:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 3.23) internal successors, (1292), 400 states have internal predecessors, (1292), 0 states have call successors, (0), 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:30:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1292 transitions. [2021-06-05 13:30:21,445 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1292 transitions. Word has length 21 [2021-06-05 13:30:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:21,445 INFO L482 AbstractCegarLoop]: Abstraction has 401 states and 1292 transitions. [2021-06-05 13:30:21,445 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1292 transitions. [2021-06-05 13:30:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:21,446 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:21,446 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:21,446 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-06-05 13:30:21,446 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1868918118, now seen corresponding path program 65 times [2021-06-05 13:30:21,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:21,447 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682510687] [2021-06-05 13:30:21,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:21,492 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:30:21,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:21,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682510687] [2021-06-05 13:30:21,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682510687] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:21,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:21,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:21,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010229706] [2021-06-05 13:30:21,493 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:21,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:21,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:21,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:21,493 INFO L87 Difference]: Start difference. First operand 401 states and 1292 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:21,520 INFO L93 Difference]: Finished difference Result 805 states and 2409 transitions. [2021-06-05 13:30:21,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:21,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:21,521 INFO L225 Difference]: With dead ends: 805 [2021-06-05 13:30:21,521 INFO L226 Difference]: Without dead ends: 695 [2021-06-05 13:30:21,521 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 46.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-06-05 13:30:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 423. [2021-06-05 13:30:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.1966824644549763) internal successors, (1349), 422 states have internal predecessors, (1349), 0 states have call successors, (0), 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:30:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1349 transitions. [2021-06-05 13:30:21,529 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1349 transitions. Word has length 21 [2021-06-05 13:30:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:21,529 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 1349 transitions. [2021-06-05 13:30:21,529 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1349 transitions. [2021-06-05 13:30:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:21,529 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:21,529 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:21,529 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-06-05 13:30:21,530 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:21,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash 857120636, now seen corresponding path program 66 times [2021-06-05 13:30:21,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:21,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748809242] [2021-06-05 13:30:21,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:21,574 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:30:21,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:21,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748809242] [2021-06-05 13:30:21,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748809242] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:21,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:21,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:21,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849473982] [2021-06-05 13:30:21,574 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:21,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:21,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:21,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:21,575 INFO L87 Difference]: Start difference. First operand 423 states and 1349 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:21,608 INFO L93 Difference]: Finished difference Result 722 states and 2171 transitions. [2021-06-05 13:30:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:21,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:21,610 INFO L225 Difference]: With dead ends: 722 [2021-06-05 13:30:21,610 INFO L226 Difference]: Without dead ends: 601 [2021-06-05 13:30:21,610 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 53.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-06-05 13:30:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 393. [2021-06-05 13:30:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.2346938775510203) internal successors, (1268), 392 states have internal predecessors, (1268), 0 states have call successors, (0), 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:30:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1268 transitions. [2021-06-05 13:30:21,616 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1268 transitions. Word has length 21 [2021-06-05 13:30:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:21,617 INFO L482 AbstractCegarLoop]: Abstraction has 393 states and 1268 transitions. [2021-06-05 13:30:21,617 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1268 transitions. [2021-06-05 13:30:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:21,619 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:21,619 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:21,619 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-06-05 13:30:21,619 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1893120794, now seen corresponding path program 67 times [2021-06-05 13:30:21,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:21,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210248202] [2021-06-05 13:30:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:21,678 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:30:21,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:21,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210248202] [2021-06-05 13:30:21,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210248202] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:21,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:21,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:21,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003069882] [2021-06-05 13:30:21,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:21,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:21,679 INFO L87 Difference]: Start difference. First operand 393 states and 1268 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:21,706 INFO L93 Difference]: Finished difference Result 788 states and 2359 transitions. [2021-06-05 13:30:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:21,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:21,707 INFO L225 Difference]: With dead ends: 788 [2021-06-05 13:30:21,707 INFO L226 Difference]: Without dead ends: 709 [2021-06-05 13:30:21,707 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-06-05 13:30:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 405. [2021-06-05 13:30:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.227722772277228) internal successors, (1304), 404 states have internal predecessors, (1304), 0 states have call successors, (0), 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:30:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1304 transitions. [2021-06-05 13:30:21,715 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1304 transitions. Word has length 21 [2021-06-05 13:30:21,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:21,715 INFO L482 AbstractCegarLoop]: Abstraction has 405 states and 1304 transitions. [2021-06-05 13:30:21,715 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1304 transitions. [2021-06-05 13:30:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:21,716 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:21,716 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:21,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-06-05 13:30:21,716 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:21,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:21,716 INFO L82 PathProgramCache]: Analyzing trace with hash 401625882, now seen corresponding path program 68 times [2021-06-05 13:30:21,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:21,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778105616] [2021-06-05 13:30:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:21,802 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:30:21,802 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:21,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778105616] [2021-06-05 13:30:21,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778105616] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:21,802 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:21,802 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:21,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990383711] [2021-06-05 13:30:21,802 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:21,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:21,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:21,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:21,803 INFO L87 Difference]: Start difference. First operand 405 states and 1304 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:21,846 INFO L93 Difference]: Finished difference Result 802 states and 2396 transitions. [2021-06-05 13:30:21,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:21,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:21,848 INFO L225 Difference]: With dead ends: 802 [2021-06-05 13:30:21,848 INFO L226 Difference]: Without dead ends: 701 [2021-06-05 13:30:21,848 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 67.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-06-05 13:30:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 397. [2021-06-05 13:30:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 3.2323232323232323) internal successors, (1280), 396 states have internal predecessors, (1280), 0 states have call successors, (0), 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:30:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1280 transitions. [2021-06-05 13:30:21,855 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1280 transitions. Word has length 21 [2021-06-05 13:30:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:21,855 INFO L482 AbstractCegarLoop]: Abstraction has 397 states and 1280 transitions. [2021-06-05 13:30:21,855 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1280 transitions. [2021-06-05 13:30:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:21,856 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:21,856 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:21,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-06-05 13:30:21,856 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:21,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:21,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1320783876, now seen corresponding path program 69 times [2021-06-05 13:30:21,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:21,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114721363] [2021-06-05 13:30:21,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:21,922 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:30:21,922 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:21,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114721363] [2021-06-05 13:30:21,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114721363] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:21,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:21,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:21,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082257635] [2021-06-05 13:30:21,923 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:21,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:21,923 INFO L87 Difference]: Start difference. First operand 397 states and 1280 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:21,948 INFO L93 Difference]: Finished difference Result 800 states and 2395 transitions. [2021-06-05 13:30:21,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:21,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:21,950 INFO L225 Difference]: With dead ends: 800 [2021-06-05 13:30:21,950 INFO L226 Difference]: Without dead ends: 721 [2021-06-05 13:30:21,950 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-06-05 13:30:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 405. [2021-06-05 13:30:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.217821782178218) internal successors, (1300), 404 states have internal predecessors, (1300), 0 states have call successors, (0), 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:30:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1300 transitions. [2021-06-05 13:30:21,957 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1300 transitions. Word has length 21 [2021-06-05 13:30:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:21,957 INFO L482 AbstractCegarLoop]: Abstraction has 405 states and 1300 transitions. [2021-06-05 13:30:21,957 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1300 transitions. [2021-06-05 13:30:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:21,958 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:21,958 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:21,958 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-06-05 13:30:21,958 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:21,959 INFO L82 PathProgramCache]: Analyzing trace with hash 202273562, now seen corresponding path program 70 times [2021-06-05 13:30:21,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:21,959 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470511974] [2021-06-05 13:30:21,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,013 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:30:22,013 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470511974] [2021-06-05 13:30:22,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470511974] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785730527] [2021-06-05 13:30:22,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,014 INFO L87 Difference]: Start difference. First operand 405 states and 1300 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:22,058 INFO L93 Difference]: Finished difference Result 748 states and 2266 transitions. [2021-06-05 13:30:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:22,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:22,059 INFO L225 Difference]: With dead ends: 748 [2021-06-05 13:30:22,060 INFO L226 Difference]: Without dead ends: 649 [2021-06-05 13:30:22,060 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 65.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-06-05 13:30:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 397. [2021-06-05 13:30:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 3.2222222222222223) internal successors, (1276), 396 states have internal predecessors, (1276), 0 states have call successors, (0), 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:30:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1276 transitions. [2021-06-05 13:30:22,074 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1276 transitions. Word has length 21 [2021-06-05 13:30:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:22,074 INFO L482 AbstractCegarLoop]: Abstraction has 397 states and 1276 transitions. [2021-06-05 13:30:22,074 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1276 transitions. [2021-06-05 13:30:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:22,075 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:22,075 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:22,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-06-05 13:30:22,075 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash 957414170, now seen corresponding path program 71 times [2021-06-05 13:30:22,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:22,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230799670] [2021-06-05 13:30:22,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,119 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:30:22,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230799670] [2021-06-05 13:30:22,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230799670] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732642436] [2021-06-05 13:30:22,120 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,120 INFO L87 Difference]: Start difference. First operand 397 states and 1276 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:22,159 INFO L93 Difference]: Finished difference Result 776 states and 2315 transitions. [2021-06-05 13:30:22,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:22,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:22,160 INFO L225 Difference]: With dead ends: 776 [2021-06-05 13:30:22,160 INFO L226 Difference]: Without dead ends: 683 [2021-06-05 13:30:22,160 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2021-06-05 13:30:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 411. [2021-06-05 13:30:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.202439024390244) internal successors, (1313), 410 states have internal predecessors, (1313), 0 states have call successors, (0), 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:30:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1313 transitions. [2021-06-05 13:30:22,167 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1313 transitions. Word has length 21 [2021-06-05 13:30:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:22,167 INFO L482 AbstractCegarLoop]: Abstraction has 411 states and 1313 transitions. [2021-06-05 13:30:22,167 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1313 transitions. [2021-06-05 13:30:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:22,168 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:22,168 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:22,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-06-05 13:30:22,168 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash -632520580, now seen corresponding path program 72 times [2021-06-05 13:30:22,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:22,168 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902721241] [2021-06-05 13:30:22,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,214 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:30:22,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902721241] [2021-06-05 13:30:22,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902721241] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,215 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850563434] [2021-06-05 13:30:22,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,215 INFO L87 Difference]: Start difference. First operand 411 states and 1313 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:22,252 INFO L93 Difference]: Finished difference Result 710 states and 2135 transitions. [2021-06-05 13:30:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:22,253 INFO L225 Difference]: With dead ends: 710 [2021-06-05 13:30:22,253 INFO L226 Difference]: Without dead ends: 593 [2021-06-05 13:30:22,253 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 54.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-06-05 13:30:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 385. [2021-06-05 13:30:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.2604166666666665) internal successors, (1252), 384 states have internal predecessors, (1252), 0 states have call successors, (0), 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:30:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1252 transitions. [2021-06-05 13:30:22,260 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1252 transitions. Word has length 21 [2021-06-05 13:30:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:22,260 INFO L482 AbstractCegarLoop]: Abstraction has 385 states and 1252 transitions. [2021-06-05 13:30:22,260 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1252 transitions. [2021-06-05 13:30:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:22,261 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:22,261 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:22,261 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-06-05 13:30:22,261 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:22,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1845007066, now seen corresponding path program 73 times [2021-06-05 13:30:22,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:22,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73210542] [2021-06-05 13:30:22,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,312 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:30:22,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73210542] [2021-06-05 13:30:22,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73210542] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27920676] [2021-06-05 13:30:22,312 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,313 INFO L87 Difference]: Start difference. First operand 385 states and 1252 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:22,347 INFO L93 Difference]: Finished difference Result 760 states and 2275 transitions. [2021-06-05 13:30:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:22,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:22,348 INFO L225 Difference]: With dead ends: 760 [2021-06-05 13:30:22,349 INFO L226 Difference]: Without dead ends: 673 [2021-06-05 13:30:22,349 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 59.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-06-05 13:30:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 393. [2021-06-05 13:30:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.2448979591836733) internal successors, (1272), 392 states have internal predecessors, (1272), 0 states have call successors, (0), 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:30:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1272 transitions. [2021-06-05 13:30:22,355 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1272 transitions. Word has length 21 [2021-06-05 13:30:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:22,355 INFO L482 AbstractCegarLoop]: Abstraction has 393 states and 1272 transitions. [2021-06-05 13:30:22,356 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1272 transitions. [2021-06-05 13:30:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:22,356 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:22,356 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:22,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-06-05 13:30:22,356 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:22,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2093116196, now seen corresponding path program 74 times [2021-06-05 13:30:22,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:22,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348033771] [2021-06-05 13:30:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,409 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:30:22,409 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348033771] [2021-06-05 13:30:22,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348033771] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304504751] [2021-06-05 13:30:22,409 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,409 INFO L87 Difference]: Start difference. First operand 393 states and 1272 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:22,438 INFO L93 Difference]: Finished difference Result 752 states and 2239 transitions. [2021-06-05 13:30:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:22,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:22,439 INFO L225 Difference]: With dead ends: 752 [2021-06-05 13:30:22,439 INFO L226 Difference]: Without dead ends: 665 [2021-06-05 13:30:22,439 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 52.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-06-05 13:30:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 385. [2021-06-05 13:30:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.25) internal successors, (1248), 384 states have internal predecessors, (1248), 0 states have call successors, (0), 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:30:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1248 transitions. [2021-06-05 13:30:22,446 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1248 transitions. Word has length 21 [2021-06-05 13:30:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:22,446 INFO L482 AbstractCegarLoop]: Abstraction has 385 states and 1248 transitions. [2021-06-05 13:30:22,446 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1248 transitions. [2021-06-05 13:30:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:22,449 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:22,449 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:22,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-06-05 13:30:22,449 INFO L430 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:22,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash -198329928, now seen corresponding path program 75 times [2021-06-05 13:30:22,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:22,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819164251] [2021-06-05 13:30:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,506 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:30:22,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819164251] [2021-06-05 13:30:22,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819164251] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300963194] [2021-06-05 13:30:22,507 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,507 INFO L87 Difference]: Start difference. First operand 385 states and 1248 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:22,541 INFO L93 Difference]: Finished difference Result 803 states and 2410 transitions. [2021-06-05 13:30:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:22,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:22,542 INFO L225 Difference]: With dead ends: 803 [2021-06-05 13:30:22,542 INFO L226 Difference]: Without dead ends: 716 [2021-06-05 13:30:22,542 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-06-05 13:30:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 405. [2021-06-05 13:30:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.237623762376238) internal successors, (1308), 404 states have internal predecessors, (1308), 0 states have call successors, (0), 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:30:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1308 transitions. [2021-06-05 13:30:22,549 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1308 transitions. Word has length 21 [2021-06-05 13:30:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:22,549 INFO L482 AbstractCegarLoop]: Abstraction has 405 states and 1308 transitions. [2021-06-05 13:30:22,549 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1308 transitions. [2021-06-05 13:30:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:22,550 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:22,550 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:22,550 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-06-05 13:30:22,551 INFO L430 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:22,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:22,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1057334118, now seen corresponding path program 76 times [2021-06-05 13:30:22,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:22,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083428645] [2021-06-05 13:30:22,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,610 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:30:22,611 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083428645] [2021-06-05 13:30:22,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083428645] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534955924] [2021-06-05 13:30:22,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,612 INFO L87 Difference]: Start difference. First operand 405 states and 1308 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:22,638 INFO L93 Difference]: Finished difference Result 826 states and 2465 transitions. [2021-06-05 13:30:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:22,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:22,640 INFO L225 Difference]: With dead ends: 826 [2021-06-05 13:30:22,640 INFO L226 Difference]: Without dead ends: 696 [2021-06-05 13:30:22,640 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-06-05 13:30:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 385. [2021-06-05 13:30:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.2291666666666665) internal successors, (1240), 384 states have internal predecessors, (1240), 0 states have call successors, (0), 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:30:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1240 transitions. [2021-06-05 13:30:22,647 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1240 transitions. Word has length 21 [2021-06-05 13:30:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:22,647 INFO L482 AbstractCegarLoop]: Abstraction has 385 states and 1240 transitions. [2021-06-05 13:30:22,647 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1240 transitions. [2021-06-05 13:30:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:22,647 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:22,647 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:22,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-06-05 13:30:22,648 INFO L430 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:22,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:22,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1739976706, now seen corresponding path program 77 times [2021-06-05 13:30:22,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:22,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67935192] [2021-06-05 13:30:22,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,704 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:30:22,704 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,704 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67935192] [2021-06-05 13:30:22,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67935192] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,704 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,704 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012741292] [2021-06-05 13:30:22,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,705 INFO L87 Difference]: Start difference. First operand 385 states and 1240 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:22,729 INFO L93 Difference]: Finished difference Result 783 states and 2330 transitions. [2021-06-05 13:30:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:22,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:22,731 INFO L225 Difference]: With dead ends: 783 [2021-06-05 13:30:22,731 INFO L226 Difference]: Without dead ends: 704 [2021-06-05 13:30:22,731 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-06-05 13:30:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 401. [2021-06-05 13:30:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 3.22) internal successors, (1288), 400 states have internal predecessors, (1288), 0 states have call successors, (0), 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:30:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1288 transitions. [2021-06-05 13:30:22,738 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1288 transitions. Word has length 21 [2021-06-05 13:30:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:22,738 INFO L482 AbstractCegarLoop]: Abstraction has 401 states and 1288 transitions. [2021-06-05 13:30:22,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1288 transitions. [2021-06-05 13:30:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:22,739 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:22,739 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:22,739 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-06-05 13:30:22,739 INFO L430 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:22,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:22,739 INFO L82 PathProgramCache]: Analyzing trace with hash 150041956, now seen corresponding path program 78 times [2021-06-05 13:30:22,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:22,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940939170] [2021-06-05 13:30:22,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,794 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:30:22,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940939170] [2021-06-05 13:30:22,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940939170] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471896504] [2021-06-05 13:30:22,795 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,795 INFO L87 Difference]: Start difference. First operand 401 states and 1288 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:22,823 INFO L93 Difference]: Finished difference Result 814 states and 2417 transitions. [2021-06-05 13:30:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:22,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:22,825 INFO L225 Difference]: With dead ends: 814 [2021-06-05 13:30:22,825 INFO L226 Difference]: Without dead ends: 680 [2021-06-05 13:30:22,825 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 55.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-06-05 13:30:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 377. [2021-06-05 13:30:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.234042553191489) internal successors, (1216), 376 states have internal predecessors, (1216), 0 states have call successors, (0), 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:30:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1216 transitions. [2021-06-05 13:30:22,831 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1216 transitions. Word has length 21 [2021-06-05 13:30:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:22,831 INFO L482 AbstractCegarLoop]: Abstraction has 377 states and 1216 transitions. [2021-06-05 13:30:22,831 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1216 transitions. [2021-06-05 13:30:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:22,832 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:22,832 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:22,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-06-05 13:30:22,832 INFO L430 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:22,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1048980186, now seen corresponding path program 79 times [2021-06-05 13:30:22,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:22,832 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707852680] [2021-06-05 13:30:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,881 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:30:22,882 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,882 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707852680] [2021-06-05 13:30:22,882 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707852680] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,882 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352398673] [2021-06-05 13:30:22,882 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,882 INFO L87 Difference]: Start difference. First operand 377 states and 1216 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:22,918 INFO L93 Difference]: Finished difference Result 796 states and 2387 transitions. [2021-06-05 13:30:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:22,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:22,919 INFO L225 Difference]: With dead ends: 796 [2021-06-05 13:30:22,919 INFO L226 Difference]: Without dead ends: 709 [2021-06-05 13:30:22,919 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 55.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:22,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-06-05 13:30:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 389. [2021-06-05 13:30:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 3.2268041237113403) internal successors, (1252), 388 states have internal predecessors, (1252), 0 states have call successors, (0), 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:30:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1252 transitions. [2021-06-05 13:30:22,926 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1252 transitions. Word has length 21 [2021-06-05 13:30:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:22,926 INFO L482 AbstractCegarLoop]: Abstraction has 389 states and 1252 transitions. [2021-06-05 13:30:22,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1252 transitions. [2021-06-05 13:30:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:22,927 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:22,927 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:22,927 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-06-05 13:30:22,927 INFO L430 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:22,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1297089316, now seen corresponding path program 80 times [2021-06-05 13:30:22,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:22,928 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701345703] [2021-06-05 13:30:22,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:22,987 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:30:22,987 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:22,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701345703] [2021-06-05 13:30:22,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701345703] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:22,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:22,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:22,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220602788] [2021-06-05 13:30:22,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:22,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:22,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:22,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:22,988 INFO L87 Difference]: Start difference. First operand 389 states and 1252 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:23,015 INFO L93 Difference]: Finished difference Result 788 states and 2351 transitions. [2021-06-05 13:30:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:23,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:23,017 INFO L225 Difference]: With dead ends: 788 [2021-06-05 13:30:23,017 INFO L226 Difference]: Without dead ends: 701 [2021-06-05 13:30:23,017 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-06-05 13:30:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 381. [2021-06-05 13:30:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.231578947368421) internal successors, (1228), 380 states have internal predecessors, (1228), 0 states have call successors, (0), 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:30:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1228 transitions. [2021-06-05 13:30:23,023 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1228 transitions. Word has length 21 [2021-06-05 13:30:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:23,023 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1228 transitions. [2021-06-05 13:30:23,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1228 transitions. [2021-06-05 13:30:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:23,024 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:23,024 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:23,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-06-05 13:30:23,025 INFO L430 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:23,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1604768474, now seen corresponding path program 81 times [2021-06-05 13:30:23,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:23,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222851997] [2021-06-05 13:30:23,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:23,076 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:30:23,076 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:23,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222851997] [2021-06-05 13:30:23,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222851997] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:23,076 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:23,076 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:23,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848404105] [2021-06-05 13:30:23,077 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:23,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:23,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:23,077 INFO L87 Difference]: Start difference. First operand 381 states and 1228 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:23,115 INFO L93 Difference]: Finished difference Result 788 states and 2363 transitions. [2021-06-05 13:30:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:23,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:23,116 INFO L225 Difference]: With dead ends: 788 [2021-06-05 13:30:23,116 INFO L226 Difference]: Without dead ends: 701 [2021-06-05 13:30:23,116 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-06-05 13:30:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 393. [2021-06-05 13:30:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.2142857142857144) internal successors, (1260), 392 states have internal predecessors, (1260), 0 states have call successors, (0), 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:30:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1260 transitions. [2021-06-05 13:30:23,124 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1260 transitions. Word has length 21 [2021-06-05 13:30:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:23,124 INFO L482 AbstractCegarLoop]: Abstraction has 393 states and 1260 transitions. [2021-06-05 13:30:23,124 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1260 transitions. [2021-06-05 13:30:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:23,125 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:23,125 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:23,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-06-05 13:30:23,125 INFO L430 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:23,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:23,125 INFO L82 PathProgramCache]: Analyzing trace with hash -569482052, now seen corresponding path program 82 times [2021-06-05 13:30:23,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:23,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497724135] [2021-06-05 13:30:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:23,173 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:30:23,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:23,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497724135] [2021-06-05 13:30:23,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497724135] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:23,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:23,173 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:23,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155364459] [2021-06-05 13:30:23,173 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:23,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:23,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:23,174 INFO L87 Difference]: Start difference. First operand 393 states and 1260 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:23,227 INFO L93 Difference]: Finished difference Result 728 states and 2202 transitions. [2021-06-05 13:30:23,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:23,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:23,229 INFO L225 Difference]: With dead ends: 728 [2021-06-05 13:30:23,229 INFO L226 Difference]: Without dead ends: 625 [2021-06-05 13:30:23,229 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 71.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-06-05 13:30:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 381. [2021-06-05 13:30:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.221052631578947) internal successors, (1224), 380 states have internal predecessors, (1224), 0 states have call successors, (0), 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:30:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1224 transitions. [2021-06-05 13:30:23,237 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1224 transitions. Word has length 21 [2021-06-05 13:30:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:23,237 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1224 transitions. [2021-06-05 13:30:23,237 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1224 transitions. [2021-06-05 13:30:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:23,238 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:23,238 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:23,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-06-05 13:30:23,238 INFO L430 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:23,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:23,238 INFO L82 PathProgramCache]: Analyzing trace with hash -751892188, now seen corresponding path program 83 times [2021-06-05 13:30:23,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:23,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488948629] [2021-06-05 13:30:23,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:23,288 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:30:23,289 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:23,289 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488948629] [2021-06-05 13:30:23,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488948629] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:23,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:23,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:23,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2393431] [2021-06-05 13:30:23,289 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:23,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:23,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:23,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:23,289 INFO L87 Difference]: Start difference. First operand 381 states and 1224 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:23,318 INFO L93 Difference]: Finished difference Result 776 states and 2315 transitions. [2021-06-05 13:30:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:23,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:23,319 INFO L225 Difference]: With dead ends: 776 [2021-06-05 13:30:23,320 INFO L226 Difference]: Without dead ends: 697 [2021-06-05 13:30:23,320 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 51.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:23,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-06-05 13:30:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 389. [2021-06-05 13:30:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 3.2061855670103094) internal successors, (1244), 388 states have internal predecessors, (1244), 0 states have call successors, (0), 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:30:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1244 transitions. [2021-06-05 13:30:23,326 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1244 transitions. Word has length 21 [2021-06-05 13:30:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:23,327 INFO L482 AbstractCegarLoop]: Abstraction has 389 states and 1244 transitions. [2021-06-05 13:30:23,327 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1244 transitions. [2021-06-05 13:30:23,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:23,327 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:23,327 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:23,327 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-06-05 13:30:23,327 INFO L430 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:23,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1995152774, now seen corresponding path program 84 times [2021-06-05 13:30:23,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:23,328 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885326424] [2021-06-05 13:30:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:23,375 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:30:23,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:23,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885326424] [2021-06-05 13:30:23,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885326424] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:23,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:23,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:23,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069179743] [2021-06-05 13:30:23,376 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:23,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:23,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:23,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:23,376 INFO L87 Difference]: Start difference. First operand 389 states and 1244 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:23,417 INFO L93 Difference]: Finished difference Result 724 states and 2186 transitions. [2021-06-05 13:30:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:23,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:23,419 INFO L225 Difference]: With dead ends: 724 [2021-06-05 13:30:23,419 INFO L226 Difference]: Without dead ends: 621 [2021-06-05 13:30:23,419 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 62.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-06-05 13:30:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 377. [2021-06-05 13:30:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.228723404255319) internal successors, (1214), 376 states have internal predecessors, (1214), 0 states have call successors, (0), 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:30:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1214 transitions. [2021-06-05 13:30:23,425 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1214 transitions. Word has length 21 [2021-06-05 13:30:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:23,425 INFO L482 AbstractCegarLoop]: Abstraction has 377 states and 1214 transitions. [2021-06-05 13:30:23,425 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1214 transitions. [2021-06-05 13:30:23,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:23,426 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:23,426 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:23,426 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-06-05 13:30:23,426 INFO L430 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:23,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2031327800, now seen corresponding path program 85 times [2021-06-05 13:30:23,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:23,427 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231330201] [2021-06-05 13:30:23,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:23,488 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:30:23,488 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:23,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231330201] [2021-06-05 13:30:23,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231330201] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:23,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:23,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:23,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617167862] [2021-06-05 13:30:23,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:23,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:23,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:23,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:23,489 INFO L87 Difference]: Start difference. First operand 377 states and 1214 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:23,528 INFO L93 Difference]: Finished difference Result 791 states and 2360 transitions. [2021-06-05 13:30:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:23,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:23,529 INFO L225 Difference]: With dead ends: 791 [2021-06-05 13:30:23,529 INFO L226 Difference]: Without dead ends: 704 [2021-06-05 13:30:23,530 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-06-05 13:30:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 377. [2021-06-05 13:30:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.1968085106382977) internal successors, (1202), 376 states have internal predecessors, (1202), 0 states have call successors, (0), 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:30:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1202 transitions. [2021-06-05 13:30:23,536 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1202 transitions. Word has length 21 [2021-06-05 13:30:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:23,536 INFO L482 AbstractCegarLoop]: Abstraction has 377 states and 1202 transitions. [2021-06-05 13:30:23,536 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1202 transitions. [2021-06-05 13:30:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:23,537 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:23,537 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:23,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-06-05 13:30:23,537 INFO L430 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:23,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1172323610, now seen corresponding path program 86 times [2021-06-05 13:30:23,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:23,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510765868] [2021-06-05 13:30:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:23,595 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:30:23,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:23,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510765868] [2021-06-05 13:30:23,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510765868] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:23,595 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:23,595 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:23,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737145621] [2021-06-05 13:30:23,595 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:23,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:23,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:23,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:23,596 INFO L87 Difference]: Start difference. First operand 377 states and 1202 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:23,625 INFO L93 Difference]: Finished difference Result 814 states and 2415 transitions. [2021-06-05 13:30:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:23,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:23,626 INFO L225 Difference]: With dead ends: 814 [2021-06-05 13:30:23,626 INFO L226 Difference]: Without dead ends: 684 [2021-06-05 13:30:23,627 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-06-05 13:30:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 357. [2021-06-05 13:30:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.1797752808988764) internal successors, (1132), 356 states have internal predecessors, (1132), 0 states have call successors, (0), 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:30:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1132 transitions. [2021-06-05 13:30:23,633 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1132 transitions. Word has length 21 [2021-06-05 13:30:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:23,633 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 1132 transitions. [2021-06-05 13:30:23,633 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1132 transitions. [2021-06-05 13:30:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:23,633 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:23,634 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:23,634 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-06-05 13:30:23,634 INFO L430 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:23,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:23,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1824519834, now seen corresponding path program 87 times [2021-06-05 13:30:23,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:23,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372893255] [2021-06-05 13:30:23,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:23,682 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:30:23,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:23,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372893255] [2021-06-05 13:30:23,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372893255] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:23,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:23,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:23,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800549642] [2021-06-05 13:30:23,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:23,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:23,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:23,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:23,683 INFO L87 Difference]: Start difference. First operand 357 states and 1132 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:23,725 INFO L93 Difference]: Finished difference Result 740 states and 2191 transitions. [2021-06-05 13:30:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:23,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:23,726 INFO L225 Difference]: With dead ends: 740 [2021-06-05 13:30:23,726 INFO L226 Difference]: Without dead ends: 653 [2021-06-05 13:30:23,727 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 64.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-06-05 13:30:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 369. [2021-06-05 13:30:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 3.1630434782608696) internal successors, (1164), 368 states have internal predecessors, (1164), 0 states have call successors, (0), 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:30:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1164 transitions. [2021-06-05 13:30:23,733 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1164 transitions. Word has length 21 [2021-06-05 13:30:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:23,733 INFO L482 AbstractCegarLoop]: Abstraction has 369 states and 1164 transitions. [2021-06-05 13:30:23,733 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1164 transitions. [2021-06-05 13:30:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:23,733 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:23,733 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:23,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-06-05 13:30:23,733 INFO L430 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1416279014, now seen corresponding path program 88 times [2021-06-05 13:30:23,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:23,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973065468] [2021-06-05 13:30:23,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:23,780 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:30:23,780 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:23,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973065468] [2021-06-05 13:30:23,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973065468] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:23,781 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:23,781 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:23,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888063683] [2021-06-05 13:30:23,781 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:23,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:23,781 INFO L87 Difference]: Start difference. First operand 369 states and 1164 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:23,821 INFO L93 Difference]: Finished difference Result 680 states and 2030 transitions. [2021-06-05 13:30:23,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:23,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:23,822 INFO L225 Difference]: With dead ends: 680 [2021-06-05 13:30:23,822 INFO L226 Difference]: Without dead ends: 577 [2021-06-05 13:30:23,822 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 60.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-06-05 13:30:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 357. [2021-06-05 13:30:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.162921348314607) internal successors, (1126), 356 states have internal predecessors, (1126), 0 states have call successors, (0), 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:30:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1126 transitions. [2021-06-05 13:30:23,828 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1126 transitions. Word has length 21 [2021-06-05 13:30:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:23,828 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 1126 transitions. [2021-06-05 13:30:23,828 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1126 transitions. [2021-06-05 13:30:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:23,828 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:23,828 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:23,828 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-06-05 13:30:23,828 INFO L430 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:23,829 INFO L82 PathProgramCache]: Analyzing trace with hash -928326020, now seen corresponding path program 89 times [2021-06-05 13:30:23,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:23,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311554609] [2021-06-05 13:30:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:23,876 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:30:23,876 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:23,876 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311554609] [2021-06-05 13:30:23,876 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311554609] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:23,876 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:23,876 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:23,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372943119] [2021-06-05 13:30:23,876 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:23,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:23,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:23,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:23,877 INFO L87 Difference]: Start difference. First operand 357 states and 1126 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:23,909 INFO L93 Difference]: Finished difference Result 773 states and 2287 transitions. [2021-06-05 13:30:23,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:23,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:23,910 INFO L225 Difference]: With dead ends: 773 [2021-06-05 13:30:23,910 INFO L226 Difference]: Without dead ends: 663 [2021-06-05 13:30:23,910 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 51.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-06-05 13:30:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 379. [2021-06-05 13:30:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.1296296296296298) internal successors, (1183), 378 states have internal predecessors, (1183), 0 states have call successors, (0), 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:30:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1183 transitions. [2021-06-05 13:30:23,916 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1183 transitions. Word has length 21 [2021-06-05 13:30:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:23,916 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1183 transitions. [2021-06-05 13:30:23,916 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1183 transitions. [2021-06-05 13:30:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:23,917 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:23,917 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:23,917 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-06-05 13:30:23,917 INFO L430 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:23,917 INFO L82 PathProgramCache]: Analyzing trace with hash -840389286, now seen corresponding path program 90 times [2021-06-05 13:30:23,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:23,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340026885] [2021-06-05 13:30:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:23,972 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:30:23,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:23,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340026885] [2021-06-05 13:30:23,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340026885] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:23,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:23,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:23,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657810768] [2021-06-05 13:30:23,972 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:23,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:23,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:23,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:23,973 INFO L87 Difference]: Start difference. First operand 379 states and 1183 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,014 INFO L93 Difference]: Finished difference Result 690 states and 2049 transitions. [2021-06-05 13:30:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,015 INFO L225 Difference]: With dead ends: 690 [2021-06-05 13:30:24,015 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 13:30:24,015 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 13:30:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 347. [2021-06-05 13:30:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 3.1705202312138727) internal successors, (1097), 346 states have internal predecessors, (1097), 0 states have call successors, (0), 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:30:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1097 transitions. [2021-06-05 13:30:24,021 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1097 transitions. Word has length 21 [2021-06-05 13:30:24,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,021 INFO L482 AbstractCegarLoop]: Abstraction has 347 states and 1097 transitions. [2021-06-05 13:30:24,021 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1097 transitions. [2021-06-05 13:30:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,021 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,021 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,021 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-06-05 13:30:24,022 INFO L430 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash 456830594, now seen corresponding path program 91 times [2021-06-05 13:30:24,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254374908] [2021-06-05 13:30:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:24,075 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:30:24,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:24,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254374908] [2021-06-05 13:30:24,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254374908] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:24,075 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:24,075 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:24,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150482500] [2021-06-05 13:30:24,075 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:24,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:24,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:24,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:24,076 INFO L87 Difference]: Start difference. First operand 347 states and 1097 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,105 INFO L93 Difference]: Finished difference Result 686 states and 2000 transitions. [2021-06-05 13:30:24,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,106 INFO L225 Difference]: With dead ends: 686 [2021-06-05 13:30:24,106 INFO L226 Difference]: Without dead ends: 607 [2021-06-05 13:30:24,107 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2021-06-05 13:30:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 347. [2021-06-05 13:30:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 3.147398843930636) internal successors, (1089), 346 states have internal predecessors, (1089), 0 states have call successors, (0), 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:30:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1089 transitions. [2021-06-05 13:30:24,112 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1089 transitions. Word has length 21 [2021-06-05 13:30:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,112 INFO L482 AbstractCegarLoop]: Abstraction has 347 states and 1089 transitions. [2021-06-05 13:30:24,112 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1089 transitions. [2021-06-05 13:30:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,113 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,113 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,113 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-06-05 13:30:24,113 INFO L430 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1133104156, now seen corresponding path program 92 times [2021-06-05 13:30:24,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,114 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359950218] [2021-06-05 13:30:24,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:24,173 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:30:24,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:24,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359950218] [2021-06-05 13:30:24,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359950218] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:24,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:24,174 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:24,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184465336] [2021-06-05 13:30:24,174 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:24,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:24,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:24,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:24,174 INFO L87 Difference]: Start difference. First operand 347 states and 1089 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,203 INFO L93 Difference]: Finished difference Result 717 states and 2087 transitions. [2021-06-05 13:30:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,204 INFO L225 Difference]: With dead ends: 717 [2021-06-05 13:30:24,204 INFO L226 Difference]: Without dead ends: 591 [2021-06-05 13:30:24,204 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-06-05 13:30:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 331. [2021-06-05 13:30:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 3.1303030303030304) internal successors, (1033), 330 states have internal predecessors, (1033), 0 states have call successors, (0), 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:30:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1033 transitions. [2021-06-05 13:30:24,210 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1033 transitions. Word has length 21 [2021-06-05 13:30:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,210 INFO L482 AbstractCegarLoop]: Abstraction has 331 states and 1033 transitions. [2021-06-05 13:30:24,210 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1033 transitions. [2021-06-05 13:30:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,211 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,211 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,211 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-06-05 13:30:24,211 INFO L430 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,211 INFO L82 PathProgramCache]: Analyzing trace with hash 250022628, now seen corresponding path program 93 times [2021-06-05 13:30:24,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,211 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201039988] [2021-06-05 13:30:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:24,259 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:30:24,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:24,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201039988] [2021-06-05 13:30:24,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201039988] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:24,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:24,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:24,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256072651] [2021-06-05 13:30:24,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:24,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:24,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:24,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:24,260 INFO L87 Difference]: Start difference. First operand 331 states and 1033 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,291 INFO L93 Difference]: Finished difference Result 690 states and 2004 transitions. [2021-06-05 13:30:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,292 INFO L225 Difference]: With dead ends: 690 [2021-06-05 13:30:24,292 INFO L226 Difference]: Without dead ends: 611 [2021-06-05 13:30:24,292 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 50.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-06-05 13:30:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 339. [2021-06-05 13:30:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 3.1153846153846154) internal successors, (1053), 338 states have internal predecessors, (1053), 0 states have call successors, (0), 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:30:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1053 transitions. [2021-06-05 13:30:24,298 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1053 transitions. Word has length 21 [2021-06-05 13:30:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,298 INFO L482 AbstractCegarLoop]: Abstraction has 339 states and 1053 transitions. [2021-06-05 13:30:24,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1053 transitions. [2021-06-05 13:30:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,298 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,298 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-06-05 13:30:24,299 INFO L430 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1930519268, now seen corresponding path program 94 times [2021-06-05 13:30:24,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297473021] [2021-06-05 13:30:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:24,346 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:30:24,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:24,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297473021] [2021-06-05 13:30:24,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297473021] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:24,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:24,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:24,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135464762] [2021-06-05 13:30:24,348 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:24,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:24,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:24,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:24,349 INFO L87 Difference]: Start difference. First operand 339 states and 1053 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,387 INFO L93 Difference]: Finished difference Result 638 states and 1875 transitions. [2021-06-05 13:30:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,388 INFO L225 Difference]: With dead ends: 638 [2021-06-05 13:30:24,388 INFO L226 Difference]: Without dead ends: 539 [2021-06-05 13:30:24,388 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 60.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-06-05 13:30:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 331. [2021-06-05 13:30:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 3.118181818181818) internal successors, (1029), 330 states have internal predecessors, (1029), 0 states have call successors, (0), 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:30:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1029 transitions. [2021-06-05 13:30:24,393 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1029 transitions. Word has length 21 [2021-06-05 13:30:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,394 INFO L482 AbstractCegarLoop]: Abstraction has 331 states and 1029 transitions. [2021-06-05 13:30:24,394 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1029 transitions. [2021-06-05 13:30:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,394 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,394 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-06-05 13:30:24,394 INFO L430 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1667184582, now seen corresponding path program 95 times [2021-06-05 13:30:24,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200430440] [2021-06-05 13:30:24,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:24,443 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:30:24,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:24,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200430440] [2021-06-05 13:30:24,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200430440] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:24,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:24,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:24,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615144800] [2021-06-05 13:30:24,444 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:24,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:24,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:24,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:24,444 INFO L87 Difference]: Start difference. First operand 331 states and 1029 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,472 INFO L93 Difference]: Finished difference Result 666 states and 1924 transitions. [2021-06-05 13:30:24,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,474 INFO L225 Difference]: With dead ends: 666 [2021-06-05 13:30:24,474 INFO L226 Difference]: Without dead ends: 556 [2021-06-05 13:30:24,474 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 51.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-06-05 13:30:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 284. [2021-06-05 13:30:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.0530035335689045) internal successors, (864), 283 states have internal predecessors, (864), 0 states have call successors, (0), 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:30:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 864 transitions. [2021-06-05 13:30:24,479 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 864 transitions. Word has length 21 [2021-06-05 13:30:24,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,479 INFO L482 AbstractCegarLoop]: Abstraction has 284 states and 864 transitions. [2021-06-05 13:30:24,479 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 864 transitions. [2021-06-05 13:30:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,479 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,479 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,480 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-06-05 13:30:24,480 INFO L430 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,480 INFO L82 PathProgramCache]: Analyzing trace with hash 275040036, now seen corresponding path program 96 times [2021-06-05 13:30:24,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,480 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901783084] [2021-06-05 13:30:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:24,524 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:30:24,524 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:24,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901783084] [2021-06-05 13:30:24,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901783084] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:24,524 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:24,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:24,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852483510] [2021-06-05 13:30:24,524 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:24,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:24,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:24,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:24,525 INFO L87 Difference]: Start difference. First operand 284 states and 864 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,561 INFO L93 Difference]: Finished difference Result 583 states and 1686 transitions. [2021-06-05 13:30:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,562 INFO L225 Difference]: With dead ends: 583 [2021-06-05 13:30:24,562 INFO L226 Difference]: Without dead ends: 458 [2021-06-05 13:30:24,563 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 57.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-06-05 13:30:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 250. [2021-06-05 13:30:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.1204819277108435) internal successors, (777), 249 states have internal predecessors, (777), 0 states have call successors, (0), 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:30:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 777 transitions. [2021-06-05 13:30:24,567 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 777 transitions. Word has length 21 [2021-06-05 13:30:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,567 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 777 transitions. [2021-06-05 13:30:24,567 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 777 transitions. [2021-06-05 13:30:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,567 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,567 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,567 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-06-05 13:30:24,568 INFO L430 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash 988259000, now seen corresponding path program 97 times [2021-06-05 13:30:24,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,568 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263781648] [2021-06-05 13:30:24,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:24,615 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:30:24,616 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:24,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263781648] [2021-06-05 13:30:24,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263781648] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:24,616 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:24,616 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:24,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317812613] [2021-06-05 13:30:24,616 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:24,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:24,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:24,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:24,616 INFO L87 Difference]: Start difference. First operand 250 states and 777 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,654 INFO L93 Difference]: Finished difference Result 513 states and 1487 transitions. [2021-06-05 13:30:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,655 INFO L225 Difference]: With dead ends: 513 [2021-06-05 13:30:24,655 INFO L226 Difference]: Without dead ends: 426 [2021-06-05 13:30:24,655 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-06-05 13:30:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 258. [2021-06-05 13:30:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 3.1011673151750974) internal successors, (797), 257 states have internal predecessors, (797), 0 states have call successors, (0), 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:30:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 797 transitions. [2021-06-05 13:30:24,670 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 797 transitions. Word has length 21 [2021-06-05 13:30:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,670 INFO L482 AbstractCegarLoop]: Abstraction has 258 states and 797 transitions. [2021-06-05 13:30:24,670 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 797 transitions. [2021-06-05 13:30:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,670 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,671 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,671 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-06-05 13:30:24,671 INFO L430 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1236368130, now seen corresponding path program 98 times [2021-06-05 13:30:24,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,671 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746693386] [2021-06-05 13:30:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:24,760 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:30:24,760 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:24,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746693386] [2021-06-05 13:30:24,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746693386] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:24,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:24,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:24,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297999896] [2021-06-05 13:30:24,761 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:24,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:24,761 INFO L87 Difference]: Start difference. First operand 258 states and 797 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,791 INFO L93 Difference]: Finished difference Result 505 states and 1451 transitions. [2021-06-05 13:30:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,792 INFO L225 Difference]: With dead ends: 505 [2021-06-05 13:30:24,792 INFO L226 Difference]: Without dead ends: 418 [2021-06-05 13:30:24,792 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 87.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-06-05 13:30:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 250. [2021-06-05 13:30:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.104417670682731) internal successors, (773), 249 states have internal predecessors, (773), 0 states have call successors, (0), 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:30:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 773 transitions. [2021-06-05 13:30:24,797 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 773 transitions. Word has length 21 [2021-06-05 13:30:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,797 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 773 transitions. [2021-06-05 13:30:24,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 773 transitions. [2021-06-05 13:30:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,798 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,798 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,798 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-06-05 13:30:24,798 INFO L430 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2114241864, now seen corresponding path program 99 times [2021-06-05 13:30:24,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24256836] [2021-06-05 13:30:24,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:24,852 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:30:24,852 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:24,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24256836] [2021-06-05 13:30:24,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24256836] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:24,853 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:24,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:24,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848439947] [2021-06-05 13:30:24,853 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:24,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:24,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:24,853 INFO L87 Difference]: Start difference. First operand 250 states and 773 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,888 INFO L93 Difference]: Finished difference Result 531 states and 1544 transitions. [2021-06-05 13:30:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,889 INFO L225 Difference]: With dead ends: 531 [2021-06-05 13:30:24,889 INFO L226 Difference]: Without dead ends: 444 [2021-06-05 13:30:24,889 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 60.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-06-05 13:30:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 262. [2021-06-05 13:30:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 3.0842911877394634) internal successors, (805), 261 states have internal predecessors, (805), 0 states have call successors, (0), 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:30:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 805 transitions. [2021-06-05 13:30:24,895 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 805 transitions. Word has length 21 [2021-06-05 13:30:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,895 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 805 transitions. [2021-06-05 13:30:24,895 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 805 transitions. [2021-06-05 13:30:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,895 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,896 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-06-05 13:30:24,896 INFO L430 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash 664098074, now seen corresponding path program 100 times [2021-06-05 13:30:24,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002213106] [2021-06-05 13:30:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:24,939 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:30:24,939 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:24,939 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002213106] [2021-06-05 13:30:24,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002213106] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:24,940 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:24,940 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:24,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162187705] [2021-06-05 13:30:24,940 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:24,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:24,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:24,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:24,940 INFO L87 Difference]: Start difference. First operand 262 states and 805 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:24,975 INFO L93 Difference]: Finished difference Result 537 states and 1549 transitions. [2021-06-05 13:30:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:24,976 INFO L225 Difference]: With dead ends: 537 [2021-06-05 13:30:24,976 INFO L226 Difference]: Without dead ends: 432 [2021-06-05 13:30:24,976 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-06-05 13:30:24,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 250. [2021-06-05 13:30:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.0883534136546187) internal successors, (769), 249 states have internal predecessors, (769), 0 states have call successors, (0), 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:30:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 769 transitions. [2021-06-05 13:30:24,981 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 769 transitions. Word has length 21 [2021-06-05 13:30:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:24,981 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 769 transitions. [2021-06-05 13:30:24,981 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 769 transitions. [2021-06-05 13:30:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:24,981 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:24,981 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:24,981 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-06-05 13:30:24,981 INFO L430 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:24,982 INFO L82 PathProgramCache]: Analyzing trace with hash -175935230, now seen corresponding path program 101 times [2021-06-05 13:30:24,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:24,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313167974] [2021-06-05 13:30:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,040 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:30:25,040 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313167974] [2021-06-05 13:30:25,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313167974] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994788877] [2021-06-05 13:30:25,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,041 INFO L87 Difference]: Start difference. First operand 250 states and 769 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,065 INFO L93 Difference]: Finished difference Result 511 states and 1468 transitions. [2021-06-05 13:30:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,066 INFO L225 Difference]: With dead ends: 511 [2021-06-05 13:30:25,066 INFO L226 Difference]: Without dead ends: 432 [2021-06-05 13:30:25,066 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 59.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-06-05 13:30:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 258. [2021-06-05 13:30:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 3.0700389105058368) internal successors, (789), 257 states have internal predecessors, (789), 0 states have call successors, (0), 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:30:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 789 transitions. [2021-06-05 13:30:25,070 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 789 transitions. Word has length 21 [2021-06-05 13:30:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,070 INFO L482 AbstractCegarLoop]: Abstraction has 258 states and 789 transitions. [2021-06-05 13:30:25,070 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 789 transitions. [2021-06-05 13:30:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,071 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,071 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-06-05 13:30:25,071 INFO L430 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1744863772, now seen corresponding path program 102 times [2021-06-05 13:30:25,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279166832] [2021-06-05 13:30:25,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,121 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:30:25,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279166832] [2021-06-05 13:30:25,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279166832] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24828411] [2021-06-05 13:30:25,122 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,122 INFO L87 Difference]: Start difference. First operand 258 states and 789 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,165 INFO L93 Difference]: Finished difference Result 525 states and 1505 transitions. [2021-06-05 13:30:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,166 INFO L225 Difference]: With dead ends: 525 [2021-06-05 13:30:25,166 INFO L226 Difference]: Without dead ends: 420 [2021-06-05 13:30:25,166 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 65.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-06-05 13:30:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 246. [2021-06-05 13:30:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.0979591836734692) internal successors, (759), 245 states have internal predecessors, (759), 0 states have call successors, (0), 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:30:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 759 transitions. [2021-06-05 13:30:25,170 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 759 transitions. Word has length 21 [2021-06-05 13:30:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,170 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 759 transitions. [2021-06-05 13:30:25,170 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 759 transitions. [2021-06-05 13:30:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,170 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,170 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,170 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-06-05 13:30:25,170 INFO L430 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash 507356954, now seen corresponding path program 103 times [2021-06-05 13:30:25,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643743536] [2021-06-05 13:30:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,220 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:30:25,220 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643743536] [2021-06-05 13:30:25,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643743536] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232768508] [2021-06-05 13:30:25,221 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,221 INFO L87 Difference]: Start difference. First operand 246 states and 759 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,259 INFO L93 Difference]: Finished difference Result 501 states and 1441 transitions. [2021-06-05 13:30:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,260 INFO L225 Difference]: With dead ends: 501 [2021-06-05 13:30:25,260 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 13:30:25,260 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 62.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 13:30:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 246. [2021-06-05 13:30:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.0653061224489795) internal successors, (751), 245 states have internal predecessors, (751), 0 states have call successors, (0), 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:30:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 751 transitions. [2021-06-05 13:30:25,264 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 751 transitions. Word has length 21 [2021-06-05 13:30:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,264 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 751 transitions. [2021-06-05 13:30:25,264 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 751 transitions. [2021-06-05 13:30:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,265 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,265 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-06-05 13:30:25,265 INFO L430 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash 755466084, now seen corresponding path program 104 times [2021-06-05 13:30:25,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,266 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838959756] [2021-06-05 13:30:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,315 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:30:25,315 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838959756] [2021-06-05 13:30:25,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838959756] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,315 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,315 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052548274] [2021-06-05 13:30:25,315 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,316 INFO L87 Difference]: Start difference. First operand 246 states and 751 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,344 INFO L93 Difference]: Finished difference Result 493 states and 1405 transitions. [2021-06-05 13:30:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,345 INFO L225 Difference]: With dead ends: 493 [2021-06-05 13:30:25,345 INFO L226 Difference]: Without dead ends: 406 [2021-06-05 13:30:25,345 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 52.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-06-05 13:30:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 238. [2021-06-05 13:30:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 3.067510548523207) internal successors, (727), 237 states have internal predecessors, (727), 0 states have call successors, (0), 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:30:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 727 transitions. [2021-06-05 13:30:25,349 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 727 transitions. Word has length 21 [2021-06-05 13:30:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,349 INFO L482 AbstractCegarLoop]: Abstraction has 238 states and 727 transitions. [2021-06-05 13:30:25,349 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 727 transitions. [2021-06-05 13:30:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,349 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,349 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,349 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-06-05 13:30:25,349 INFO L430 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash -418293064, now seen corresponding path program 105 times [2021-06-05 13:30:25,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,350 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767478425] [2021-06-05 13:30:25,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,411 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:30:25,411 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767478425] [2021-06-05 13:30:25,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767478425] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640004245] [2021-06-05 13:30:25,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,412 INFO L87 Difference]: Start difference. First operand 238 states and 727 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,451 INFO L93 Difference]: Finished difference Result 493 states and 1417 transitions. [2021-06-05 13:30:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,452 INFO L225 Difference]: With dead ends: 493 [2021-06-05 13:30:25,452 INFO L226 Difference]: Without dead ends: 406 [2021-06-05 13:30:25,452 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-06-05 13:30:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 250. [2021-06-05 13:30:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.0481927710843375) internal successors, (759), 249 states have internal predecessors, (759), 0 states have call successors, (0), 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:30:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 759 transitions. [2021-06-05 13:30:25,456 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 759 transitions. Word has length 21 [2021-06-05 13:30:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,456 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 759 transitions. [2021-06-05 13:30:25,456 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 759 transitions. [2021-06-05 13:30:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,457 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,457 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,457 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-06-05 13:30:25,457 INFO L430 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1702423706, now seen corresponding path program 106 times [2021-06-05 13:30:25,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30716510] [2021-06-05 13:30:25,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,505 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:30:25,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30716510] [2021-06-05 13:30:25,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30716510] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593902505] [2021-06-05 13:30:25,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,506 INFO L87 Difference]: Start difference. First operand 250 states and 759 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,540 INFO L93 Difference]: Finished difference Result 433 states and 1256 transitions. [2021-06-05 13:30:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,541 INFO L225 Difference]: With dead ends: 433 [2021-06-05 13:30:25,541 INFO L226 Difference]: Without dead ends: 330 [2021-06-05 13:30:25,541 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-06-05 13:30:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 238. [2021-06-05 13:30:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 3.050632911392405) internal successors, (723), 237 states have internal predecessors, (723), 0 states have call successors, (0), 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:30:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 723 transitions. [2021-06-05 13:30:25,545 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 723 transitions. Word has length 21 [2021-06-05 13:30:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,545 INFO L482 AbstractCegarLoop]: Abstraction has 238 states and 723 transitions. [2021-06-05 13:30:25,545 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 723 transitions. [2021-06-05 13:30:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,545 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,545 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-06-05 13:30:25,545 INFO L430 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1520013570, now seen corresponding path program 107 times [2021-06-05 13:30:25,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698312060] [2021-06-05 13:30:25,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,598 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:30:25,599 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698312060] [2021-06-05 13:30:25,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698312060] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166889709] [2021-06-05 13:30:25,599 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,600 INFO L87 Difference]: Start difference. First operand 238 states and 723 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,622 INFO L93 Difference]: Finished difference Result 481 states and 1369 transitions. [2021-06-05 13:30:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,623 INFO L225 Difference]: With dead ends: 481 [2021-06-05 13:30:25,623 INFO L226 Difference]: Without dead ends: 402 [2021-06-05 13:30:25,623 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-06-05 13:30:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 246. [2021-06-05 13:30:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.0326530612244897) internal successors, (743), 245 states have internal predecessors, (743), 0 states have call successors, (0), 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:30:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 743 transitions. [2021-06-05 13:30:25,626 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 743 transitions. Word has length 21 [2021-06-05 13:30:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,627 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 743 transitions. [2021-06-05 13:30:25,627 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 743 transitions. [2021-06-05 13:30:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,627 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,627 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,627 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-06-05 13:30:25,627 INFO L430 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash -27908764, now seen corresponding path program 108 times [2021-06-05 13:30:25,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690873195] [2021-06-05 13:30:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,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:30:25,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690873195] [2021-06-05 13:30:25,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690873195] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,673 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,673 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432539585] [2021-06-05 13:30:25,673 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,673 INFO L87 Difference]: Start difference. First operand 246 states and 743 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,706 INFO L93 Difference]: Finished difference Result 429 states and 1240 transitions. [2021-06-05 13:30:25,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,707 INFO L225 Difference]: With dead ends: 429 [2021-06-05 13:30:25,707 INFO L226 Difference]: Without dead ends: 326 [2021-06-05 13:30:25,707 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 52.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-06-05 13:30:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 234. [2021-06-05 13:30:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 3.060085836909871) internal successors, (713), 233 states have internal predecessors, (713), 0 states have call successors, (0), 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:30:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 713 transitions. [2021-06-05 13:30:25,710 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 713 transitions. Word has length 21 [2021-06-05 13:30:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,710 INFO L482 AbstractCegarLoop]: Abstraction has 234 states and 713 transitions. [2021-06-05 13:30:25,710 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 713 transitions. [2021-06-05 13:30:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,711 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,711 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,711 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-06-05 13:30:25,711 INFO L430 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash -577641800, now seen corresponding path program 109 times [2021-06-05 13:30:25,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884301192] [2021-06-05 13:30:25,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,755 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:30:25,755 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884301192] [2021-06-05 13:30:25,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884301192] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244753686] [2021-06-05 13:30:25,755 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,756 INFO L87 Difference]: Start difference. First operand 234 states and 713 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,787 INFO L93 Difference]: Finished difference Result 479 states and 1364 transitions. [2021-06-05 13:30:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,788 INFO L225 Difference]: With dead ends: 479 [2021-06-05 13:30:25,788 INFO L226 Difference]: Without dead ends: 392 [2021-06-05 13:30:25,788 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 54.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-06-05 13:30:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 234. [2021-06-05 13:30:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 3.0085836909871246) internal successors, (701), 233 states have internal predecessors, (701), 0 states have call successors, (0), 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:30:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 701 transitions. [2021-06-05 13:30:25,791 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 701 transitions. Word has length 21 [2021-06-05 13:30:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,791 INFO L482 AbstractCegarLoop]: Abstraction has 234 states and 701 transitions. [2021-06-05 13:30:25,791 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 701 transitions. [2021-06-05 13:30:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,792 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,792 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,792 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-06-05 13:30:25,792 INFO L430 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash -2094269158, now seen corresponding path program 110 times [2021-06-05 13:30:25,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,792 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131280048] [2021-06-05 13:30:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,845 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:30:25,845 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131280048] [2021-06-05 13:30:25,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131280048] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432193774] [2021-06-05 13:30:25,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,846 INFO L87 Difference]: Start difference. First operand 234 states and 701 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,880 INFO L93 Difference]: Finished difference Result 485 states and 1369 transitions. [2021-06-05 13:30:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,881 INFO L225 Difference]: With dead ends: 485 [2021-06-05 13:30:25,881 INFO L226 Difference]: Without dead ends: 380 [2021-06-05 13:30:25,881 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-06-05 13:30:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 222. [2021-06-05 13:30:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 3.0) internal successors, (663), 221 states have internal predecessors, (663), 0 states have call successors, (0), 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:30:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 663 transitions. [2021-06-05 13:30:25,885 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 663 transitions. Word has length 21 [2021-06-05 13:30:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,885 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 663 transitions. [2021-06-05 13:30:25,885 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 663 transitions. [2021-06-05 13:30:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,885 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,885 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-06-05 13:30:25,885 INFO L430 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,886 INFO L82 PathProgramCache]: Analyzing trace with hash 503420826, now seen corresponding path program 111 times [2021-06-05 13:30:25,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,886 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410827565] [2021-06-05 13:30:25,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:25,929 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:30:25,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:25,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410827565] [2021-06-05 13:30:25,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410827565] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:25,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:25,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:25,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253452454] [2021-06-05 13:30:25,930 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:25,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:25,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:25,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:25,930 INFO L87 Difference]: Start difference. First operand 222 states and 663 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:25,965 INFO L93 Difference]: Finished difference Result 441 states and 1233 transitions. [2021-06-05 13:30:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:25,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:25,966 INFO L225 Difference]: With dead ends: 441 [2021-06-05 13:30:25,966 INFO L226 Difference]: Without dead ends: 354 [2021-06-05 13:30:25,966 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 55.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-06-05 13:30:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 198. [2021-06-05 13:30:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.918781725888325) internal successors, (575), 197 states have internal predecessors, (575), 0 states have call successors, (0), 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:30:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 575 transitions. [2021-06-05 13:30:25,969 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 575 transitions. Word has length 21 [2021-06-05 13:30:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:25,969 INFO L482 AbstractCegarLoop]: Abstraction has 198 states and 575 transitions. [2021-06-05 13:30:25,969 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 575 transitions. [2021-06-05 13:30:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:25,969 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:25,969 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:25,969 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-06-05 13:30:25,969 INFO L430 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:25,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash 906396826, now seen corresponding path program 112 times [2021-06-05 13:30:25,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:25,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115165076] [2021-06-05 13:30:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:26,033 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:30:26,034 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:26,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115165076] [2021-06-05 13:30:26,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115165076] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:26,034 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:26,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:26,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667203431] [2021-06-05 13:30:26,034 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:26,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:26,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:26,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:26,034 INFO L87 Difference]: Start difference. First operand 198 states and 575 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:26,071 INFO L93 Difference]: Finished difference Result 381 states and 1072 transitions. [2021-06-05 13:30:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:26,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:26,071 INFO L225 Difference]: With dead ends: 381 [2021-06-05 13:30:26,071 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 13:30:26,072 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 13:30:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 186. [2021-06-05 13:30:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.902702702702703) internal successors, (537), 185 states have internal predecessors, (537), 0 states have call successors, (0), 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:30:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 537 transitions. [2021-06-05 13:30:26,074 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 537 transitions. Word has length 21 [2021-06-05 13:30:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:26,074 INFO L482 AbstractCegarLoop]: Abstraction has 186 states and 537 transitions. [2021-06-05 13:30:26,074 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 537 transitions. [2021-06-05 13:30:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:26,075 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:26,075 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:26,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-06-05 13:30:26,075 INFO L430 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:26,075 INFO L82 PathProgramCache]: Analyzing trace with hash 100048508, now seen corresponding path program 113 times [2021-06-05 13:30:26,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:26,075 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127244782] [2021-06-05 13:30:26,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:26,122 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:30:26,122 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:26,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127244782] [2021-06-05 13:30:26,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127244782] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:26,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:26,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:26,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520266874] [2021-06-05 13:30:26,122 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:26,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:26,123 INFO L87 Difference]: Start difference. First operand 186 states and 537 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:26,165 INFO L93 Difference]: Finished difference Result 385 states and 1090 transitions. [2021-06-05 13:30:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:26,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:26,165 INFO L225 Difference]: With dead ends: 385 [2021-06-05 13:30:26,165 INFO L226 Difference]: Without dead ends: 292 [2021-06-05 13:30:26,165 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 65.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-06-05 13:30:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 200. [2021-06-05 13:30:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.8844221105527637) internal successors, (574), 199 states have internal predecessors, (574), 0 states have call successors, (0), 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:30:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 574 transitions. [2021-06-05 13:30:26,168 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 574 transitions. Word has length 21 [2021-06-05 13:30:26,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:26,168 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 574 transitions. [2021-06-05 13:30:26,168 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 574 transitions. [2021-06-05 13:30:26,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:26,169 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:26,169 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:26,169 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-06-05 13:30:26,169 INFO L430 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:26,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:26,169 INFO L82 PathProgramCache]: Analyzing trace with hash -228334374, now seen corresponding path program 114 times [2021-06-05 13:30:26,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:26,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027295187] [2021-06-05 13:30:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:26,216 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:30:26,216 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:26,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027295187] [2021-06-05 13:30:26,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027295187] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:26,216 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:26,216 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:26,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487467701] [2021-06-05 13:30:26,216 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:26,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:26,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:26,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:26,217 INFO L87 Difference]: Start difference. First operand 200 states and 574 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:26,254 INFO L93 Difference]: Finished difference Result 291 states and 822 transitions. [2021-06-05 13:30:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:26,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:26,255 INFO L225 Difference]: With dead ends: 291 [2021-06-05 13:30:26,255 INFO L226 Difference]: Without dead ends: 180 [2021-06-05 13:30:26,255 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-06-05 13:30:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2021-06-05 13:30:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.916201117318436) internal successors, (522), 179 states have internal predecessors, (522), 0 states have call successors, (0), 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:30:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 522 transitions. [2021-06-05 13:30:26,257 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 522 transitions. Word has length 21 [2021-06-05 13:30:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:26,257 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 522 transitions. [2021-06-05 13:30:26,257 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 522 transitions. [2021-06-05 13:30:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:26,258 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:26,258 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:26,258 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-06-05 13:30:26,258 INFO L430 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2142828290, now seen corresponding path program 115 times [2021-06-05 13:30:26,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:26,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502643287] [2021-06-05 13:30:26,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:26,313 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:30:26,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:26,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502643287] [2021-06-05 13:30:26,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502643287] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:26,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:26,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:26,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843667933] [2021-06-05 13:30:26,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:26,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:26,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:26,314 INFO L87 Difference]: Start difference. First operand 180 states and 522 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:26,338 INFO L93 Difference]: Finished difference Result 323 states and 891 transitions. [2021-06-05 13:30:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:26,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:26,339 INFO L225 Difference]: With dead ends: 323 [2021-06-05 13:30:26,339 INFO L226 Difference]: Without dead ends: 244 [2021-06-05 13:30:26,339 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 59.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-06-05 13:30:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 180. [2021-06-05 13:30:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.8715083798882683) internal successors, (514), 179 states have internal predecessors, (514), 0 states have call successors, (0), 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:30:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 514 transitions. [2021-06-05 13:30:26,342 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 514 transitions. Word has length 21 [2021-06-05 13:30:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:26,342 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 514 transitions. [2021-06-05 13:30:26,342 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 514 transitions. [2021-06-05 13:30:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:26,342 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:26,343 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:26,343 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-06-05 13:30:26,343 INFO L430 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash 573899748, now seen corresponding path program 116 times [2021-06-05 13:30:26,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:26,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565540751] [2021-06-05 13:30:26,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:26,397 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:30:26,397 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:26,397 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565540751] [2021-06-05 13:30:26,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565540751] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:26,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:26,397 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:26,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356870803] [2021-06-05 13:30:26,397 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:26,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:26,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:26,398 INFO L87 Difference]: Start difference. First operand 180 states and 514 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:26,438 INFO L93 Difference]: Finished difference Result 337 states and 928 transitions. [2021-06-05 13:30:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:26,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:26,439 INFO L225 Difference]: With dead ends: 337 [2021-06-05 13:30:26,439 INFO L226 Difference]: Without dead ends: 236 [2021-06-05 13:30:26,439 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-06-05 13:30:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 172. [2021-06-05 13:30:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.865497076023392) internal successors, (490), 171 states have internal predecessors, (490), 0 states have call successors, (0), 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:30:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 490 transitions. [2021-06-05 13:30:26,442 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 490 transitions. Word has length 21 [2021-06-05 13:30:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:26,442 INFO L482 AbstractCegarLoop]: Abstraction has 172 states and 490 transitions. [2021-06-05 13:30:26,442 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 490 transitions. [2021-06-05 13:30:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:26,444 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:26,444 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:26,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-06-05 13:30:26,445 INFO L430 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:26,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1071076380, now seen corresponding path program 117 times [2021-06-05 13:30:26,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:26,446 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757451458] [2021-06-05 13:30:26,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:26,514 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:30:26,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:26,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757451458] [2021-06-05 13:30:26,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757451458] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:26,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:26,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:26,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90967389] [2021-06-05 13:30:26,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:26,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:26,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:26,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:26,515 INFO L87 Difference]: Start difference. First operand 172 states and 490 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:26,536 INFO L93 Difference]: Finished difference Result 299 states and 811 transitions. [2021-06-05 13:30:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:26,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:26,537 INFO L225 Difference]: With dead ends: 299 [2021-06-05 13:30:26,537 INFO L226 Difference]: Without dead ends: 220 [2021-06-05 13:30:26,537 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-06-05 13:30:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 156. [2021-06-05 13:30:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.8) internal successors, (434), 155 states have internal predecessors, (434), 0 states have call successors, (0), 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:30:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 434 transitions. [2021-06-05 13:30:26,539 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 434 transitions. Word has length 21 [2021-06-05 13:30:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:26,539 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 434 transitions. [2021-06-05 13:30:26,540 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 434 transitions. [2021-06-05 13:30:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:26,540 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:26,540 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:26,540 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-06-05 13:30:26,540 INFO L430 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:26,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash -41772188, now seen corresponding path program 118 times [2021-06-05 13:30:26,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:26,540 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346135485] [2021-06-05 13:30:26,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:26,591 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:30:26,591 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:26,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346135485] [2021-06-05 13:30:26,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346135485] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:26,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:26,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:26,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669879781] [2021-06-05 13:30:26,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:26,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:26,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:26,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:26,592 INFO L87 Difference]: Start difference. First operand 156 states and 434 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:26,630 INFO L93 Difference]: Finished difference Result 247 states and 682 transitions. [2021-06-05 13:30:26,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:26,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:26,631 INFO L225 Difference]: With dead ends: 247 [2021-06-05 13:30:26,631 INFO L226 Difference]: Without dead ends: 148 [2021-06-05 13:30:26,631 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-06-05 13:30:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-06-05 13:30:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.7891156462585034) internal successors, (410), 147 states have internal predecessors, (410), 0 states have call successors, (0), 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:30:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 410 transitions. [2021-06-05 13:30:26,633 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 410 transitions. Word has length 21 [2021-06-05 13:30:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:26,633 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 410 transitions. [2021-06-05 13:30:26,633 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 410 transitions. [2021-06-05 13:30:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:26,633 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:26,633 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:26,633 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-06-05 13:30:26,633 INFO L430 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:26,634 INFO L82 PathProgramCache]: Analyzing trace with hash -920778810, now seen corresponding path program 119 times [2021-06-05 13:30:26,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:26,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875967138] [2021-06-05 13:30:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:26,692 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:30:26,693 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:26,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875967138] [2021-06-05 13:30:26,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875967138] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:26,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:26,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:26,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545385709] [2021-06-05 13:30:26,693 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:26,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:26,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:26,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:26,694 INFO L87 Difference]: Start difference. First operand 148 states and 410 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:26,733 INFO L93 Difference]: Finished difference Result 211 states and 570 transitions. [2021-06-05 13:30:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:26,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:26,733 INFO L225 Difference]: With dead ends: 211 [2021-06-05 13:30:26,733 INFO L226 Difference]: Without dead ends: 118 [2021-06-05 13:30:26,733 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-06-05 13:30:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-06-05 13:30:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.58974358974359) internal successors, (303), 117 states have internal predecessors, (303), 0 states have call successors, (0), 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:30:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 303 transitions. [2021-06-05 13:30:26,735 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 303 transitions. Word has length 21 [2021-06-05 13:30:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:26,735 INFO L482 AbstractCegarLoop]: Abstraction has 118 states and 303 transitions. [2021-06-05 13:30:26,735 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 303 transitions. [2021-06-05 13:30:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 13:30:26,735 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 13:30:26,735 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 13:30:26,735 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-06-05 13:30:26,735 INFO L430 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-05 13:30:26,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 13:30:26,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1330851492, now seen corresponding path program 120 times [2021-06-05 13:30:26,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 13:30:26,736 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435923772] [2021-06-05 13:30:26,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 13:30:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 13:30:26,779 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:30:26,779 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 13:30:26,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435923772] [2021-06-05 13:30:26,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435923772] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 13:30:26,780 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 13:30:26,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 13:30:26,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388426921] [2021-06-05 13:30:26,780 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 13:30:26,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 13:30:26,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 13:30:26,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 13:30:26,780 INFO L87 Difference]: Start difference. First operand 118 states and 303 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 13:30:26,809 INFO L93 Difference]: Finished difference Result 117 states and 302 transitions. [2021-06-05 13:30:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 13:30:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-06-05 13:30:26,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 13:30:26,809 INFO L225 Difference]: With dead ends: 117 [2021-06-05 13:30:26,809 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 13:30:26,810 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 57.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 13:30:26,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 13:30:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 13:30:26,810 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:30:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 13:30:26,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-06-05 13:30:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 13:30:26,810 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 13:30:26,810 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 13:30:26,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 13:30:26,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-06-05 13:30:26,812 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 13:30:26,813 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 01:30:26 BasicIcfg [2021-06-05 13:30:26,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 13:30:26,814 INFO L168 Benchmark]: Toolchain (without parser) took 14213.78 ms. Allocated memory was 352.3 MB in the beginning and 616.6 MB in the end (delta: 264.2 MB). Free memory was 331.9 MB in the beginning and 343.5 MB in the end (delta: -11.6 MB). Peak memory consumption was 254.6 MB. Max. memory is 16.0 GB. [2021-06-05 13:30:26,814 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 352.3 MB. Free memory was 332.9 MB in the beginning and 332.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 13:30:26,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.73 ms. Allocated memory is still 352.3 MB. Free memory was 331.8 MB in the beginning and 330.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 13:30:26,814 INFO L168 Benchmark]: Boogie Preprocessor took 10.56 ms. Allocated memory is still 352.3 MB. Free memory was 330.3 MB in the beginning and 329.4 MB in the end (delta: 897.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 13:30:26,814 INFO L168 Benchmark]: RCFGBuilder took 190.75 ms. Allocated memory is still 352.3 MB. Free memory was 329.3 MB in the beginning and 319.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. [2021-06-05 13:30:26,814 INFO L168 Benchmark]: TraceAbstraction took 13987.37 ms. Allocated memory was 352.3 MB in the beginning and 616.6 MB in the end (delta: 264.2 MB). Free memory was 319.0 MB in the beginning and 343.5 MB in the end (delta: -24.5 MB). Peak memory consumption was 239.9 MB. Max. memory is 16.0 GB. [2021-06-05 13:30:26,814 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 352.3 MB. Free memory was 332.9 MB in the beginning and 332.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 20.73 ms. Allocated memory is still 352.3 MB. Free memory was 331.8 MB in the beginning and 330.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 10.56 ms. Allocated memory is still 352.3 MB. Free memory was 330.3 MB in the beginning and 329.4 MB in the end (delta: 897.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 190.75 ms. Allocated memory is still 352.3 MB. Free memory was 329.3 MB in the beginning and 319.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13987.37 ms. Allocated memory was 352.3 MB in the beginning and 616.6 MB in the end (delta: 264.2 MB). Free memory was 319.0 MB in the beginning and 343.5 MB in the end (delta: -24.5 MB). Peak memory consumption was 239.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 49 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13842.7ms, OverallIterations: 124, TraceHistogramMax: 1, EmptinessCheckTime: 117.9ms, AutomataDifference: 4920.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 122.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7201 SDtfs, 9019 SDslu, 13152 SDs, 0 SdLazy, 2710 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1403.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 852 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 724 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 7377.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1148occurred in iteration=0, InterpolantAutomatonStates: 852, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1188.8ms AutomataMinimizationTime, 124 MinimizatonAttempts, 38456 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 66.8ms SsaConstructionTime, 106.5ms SatisfiabilityAnalysisTime, 6853.6ms InterpolantComputationTime, 2604 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 2480 ConstructedInterpolants, 0 QuantifiedInterpolants, 48111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 124 InterpolantComputations, 124 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...