/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.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 20:58:21,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 20:58:21,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 20:58:21,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 20:58:21,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 20:58:21,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 20:58:21,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 20:58:21,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 20:58:21,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 20:58:21,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 20:58:21,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 20:58:21,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 20:58:21,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 20:58:21,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 20:58:21,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 20:58:21,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 20:58:21,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 20:58:21,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 20:58:21,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 20:58:21,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 20:58:21,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 20:58:21,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 20:58:21,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 20:58:21,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 20:58:21,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 20:58:21,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 20:58:21,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 20:58:21,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 20:58:21,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 20:58:21,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 20:58:21,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 20:58:21,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 20:58:21,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 20:58:21,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 20:58:21,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 20:58:21,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 20:58:21,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 20:58:21,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 20:58:21,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 20:58:21,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 20:58:21,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 20:58:21,329 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.epf [2021-06-05 20:58:21,363 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 20:58:21,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 20:58:21,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 20:58:21,364 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 20:58:21,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 20:58:21,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 20:58:21,366 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 20:58:21,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 20:58:21,367 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 20:58:21,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 20:58:21,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 20:58:21,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 20:58:21,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 20:58:21,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 20:58:21,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 20:58:21,368 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 20:58:21,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 20:58:21,369 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 20:58:21,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 20:58:21,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 20:58:21,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 20:58:21,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 20:58:21,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 20:58:21,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 20:58:21,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 20:58:21,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 20:58:21,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 20:58:21,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 20:58:21,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 20:58:21,370 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 20:58:21,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 20:58:21,371 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 20:58:21,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 20:58:21,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 20:58:21,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 20:58:21,695 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 20:58:21,697 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 20:58:21,698 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 20:58:21,698 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl' [2021-06-05 20:58:21,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 20:58:21,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 20:58:21,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 20:58:21,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 20:58:21,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 20:58:21,752 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 08:58:21" (1/1) ... [2021-06-05 20:58:21,759 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 08:58:21" (1/1) ... [2021-06-05 20:58:21,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 20:58:21,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 20:58:21,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 20:58:21,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 20:58:21,776 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 08:58:21" (1/1) ... [2021-06-05 20:58:21,777 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 08:58:21" (1/1) ... [2021-06-05 20:58:21,777 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 08:58:21" (1/1) ... [2021-06-05 20:58:21,777 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 08:58:21" (1/1) ... [2021-06-05 20:58:21,780 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 08:58:21" (1/1) ... [2021-06-05 20:58:21,781 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 08:58:21" (1/1) ... [2021-06-05 20:58:21,782 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 08:58:21" (1/1) ... [2021-06-05 20:58:21,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 20:58:21,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 20:58:21,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 20:58:21,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 20:58:21,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:58:21" (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 20:58:21,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2021-06-05 20:58:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2021-06-05 20:58:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2021-06-05 20:58:21,845 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2021-06-05 20:58:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2021-06-05 20:58:21,846 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2021-06-05 20:58:21,846 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2021-06-05 20:58:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2021-06-05 20:58:21,846 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2021-06-05 20:58:21,846 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2021-06-05 20:58:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2021-06-05 20:58:21,848 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2021-06-05 20:58:21,848 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2021-06-05 20:58:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2021-06-05 20:58:21,848 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2021-06-05 20:58:21,849 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 20:58:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 20:58:21,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 20:58:21,850 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 20:58:21,973 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 20:58:21,973 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-05 20:58:21,974 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:58:21 BoogieIcfgContainer [2021-06-05 20:58:21,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 20:58:21,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 20:58:21,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 20:58:21,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 20:58:21,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:58:21" (1/2) ... [2021-06-05 20:58:21,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7575147d and model type example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:58:21, skipping insertion in model container [2021-06-05 20:58:21,979 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 08:58:21" (2/2) ... [2021-06-05 20:58:21,981 INFO L111 eAbstractionObserver]: Analyzing ICFG example_5.bpl [2021-06-05 20:58:21,985 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 20:58:21,985 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 20:58:21,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 20:58:21,986 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 20:58:22,070 INFO L149 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2021-06-05 20:58:22,088 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 20:58:22,140 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 20:58:22,140 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 20:58:22,140 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 20:58:22,140 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 20:58:22,140 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 20:58:22,141 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 20:58:22,141 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 20:58:22,141 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 20:58:22,151 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 48 transitions, 196 flow [2021-06-05 20:58:22,247 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 20:58:22,252 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 20:58:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:22,270 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:22,271 INFO L554 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 20:58:22,271 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 20:58:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash -794882208, now seen corresponding path program 1 times [2021-06-05 20:58:22,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:22,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740848534] [2021-06-05 20:58:22,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:22,421 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 20:58:22,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:22,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740848534] [2021-06-05 20:58:22,423 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740848534] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:22,423 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:22,424 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:58:22,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325078534] [2021-06-05 20:58:22,428 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:58:22,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:22,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:58:22,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:58:22,442 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 20:58:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:22,485 INFO L93 Difference]: Finished difference Result 959 states and 3411 transitions. [2021-06-05 20:58:22,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:58:22,486 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 20:58:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:22,510 INFO L225 Difference]: With dead ends: 959 [2021-06-05 20:58:22,510 INFO L226 Difference]: Without dead ends: 957 [2021-06-05 20:58:22,511 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:58:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-06-05 20:58:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2021-06-05 20:58:22,624 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 20:58:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 3409 transitions. [2021-06-05 20:58:22,631 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 3409 transitions. Word has length 21 [2021-06-05 20:58:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:22,633 INFO L482 AbstractCegarLoop]: Abstraction has 957 states and 3409 transitions. [2021-06-05 20:58:22,634 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 20:58:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 3409 transitions. [2021-06-05 20:58:22,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:22,639 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:22,639 INFO L554 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 20:58:22,640 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 20:58:22,640 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 20:58:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:22,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1132663268, now seen corresponding path program 1 times [2021-06-05 20:58:22,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:22,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702560398] [2021-06-05 20:58:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:22,684 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 20:58:22,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:22,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702560398] [2021-06-05 20:58:22,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702560398] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:22,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:22,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:58:22,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921612690] [2021-06-05 20:58:22,687 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:58:22,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:22,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:58:22,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:58:22,691 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 20:58:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:22,709 INFO L93 Difference]: Finished difference Result 741 states and 2572 transitions. [2021-06-05 20:58:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:58:22,709 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 20:58:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:22,715 INFO L225 Difference]: With dead ends: 741 [2021-06-05 20:58:22,715 INFO L226 Difference]: Without dead ends: 741 [2021-06-05 20:58:22,716 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:58:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2021-06-05 20:58:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2021-06-05 20:58:22,746 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 20:58:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2572 transitions. [2021-06-05 20:58:22,752 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2572 transitions. Word has length 21 [2021-06-05 20:58:22,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:22,752 INFO L482 AbstractCegarLoop]: Abstraction has 741 states and 2572 transitions. [2021-06-05 20:58:22,753 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 20:58:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2572 transitions. [2021-06-05 20:58:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:22,757 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:22,757 INFO L554 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 20:58:22,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 20:58:22,757 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 20:58:22,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:22,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1383419134, now seen corresponding path program 1 times [2021-06-05 20:58:22,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:22,759 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299984753] [2021-06-05 20:58:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:22,820 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 20:58:22,820 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:22,820 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299984753] [2021-06-05 20:58:22,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299984753] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:22,821 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:22,821 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:58:22,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082567932] [2021-06-05 20:58:22,821 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:58:22,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:22,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:58:22,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:58:22,822 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 20:58:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:22,841 INFO L93 Difference]: Finished difference Result 567 states and 1945 transitions. [2021-06-05 20:58:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:58:22,842 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 20:58:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:22,848 INFO L225 Difference]: With dead ends: 567 [2021-06-05 20:58:22,849 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 20:58:22,849 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:58:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 20:58:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2021-06-05 20:58:22,868 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 20:58:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1945 transitions. [2021-06-05 20:58:22,872 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1945 transitions. Word has length 21 [2021-06-05 20:58:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:22,872 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1945 transitions. [2021-06-05 20:58:22,872 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 20:58:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1945 transitions. [2021-06-05 20:58:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:22,874 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:22,874 INFO L554 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 20:58:22,874 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 20:58:22,875 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 20:58:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash 609363394, now seen corresponding path program 1 times [2021-06-05 20:58:22,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:22,876 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488453279] [2021-06-05 20:58:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:23,094 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 20:58:23,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:23,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488453279] [2021-06-05 20:58:23,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488453279] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:23,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:23,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:23,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085820145] [2021-06-05 20:58:23,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:23,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:23,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:23,096 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 20:58:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:23,174 INFO L93 Difference]: Finished difference Result 1267 states and 4072 transitions. [2021-06-05 20:58:23,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:23,174 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 20:58:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:23,182 INFO L225 Difference]: With dead ends: 1267 [2021-06-05 20:58:23,182 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 20:58:23,182 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 138.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:23,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 20:58:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 616. [2021-06-05 20:58:23,209 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 20:58:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 2091 transitions. [2021-06-05 20:58:23,213 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 2091 transitions. Word has length 21 [2021-06-05 20:58:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:23,213 INFO L482 AbstractCegarLoop]: Abstraction has 616 states and 2091 transitions. [2021-06-05 20:58:23,214 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 20:58:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 2091 transitions. [2021-06-05 20:58:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:23,216 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:23,216 INFO L554 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 20:58:23,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 20:58:23,216 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 20:58:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1140904574, now seen corresponding path program 2 times [2021-06-05 20:58:23,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:23,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333639012] [2021-06-05 20:58:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:23,425 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 20:58:23,425 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:23,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333639012] [2021-06-05 20:58:23,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333639012] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:23,426 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:23,426 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:23,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623657359] [2021-06-05 20:58:23,426 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:23,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:23,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:23,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:23,427 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 20:58:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:23,516 INFO L93 Difference]: Finished difference Result 1250 states and 3995 transitions. [2021-06-05 20:58:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:23,516 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 20:58:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:23,523 INFO L225 Difference]: With dead ends: 1250 [2021-06-05 20:58:23,523 INFO L226 Difference]: Without dead ends: 1098 [2021-06-05 20:58:23,524 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 136.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-06-05 20:58:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 581. [2021-06-05 20:58:23,548 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 20:58:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1984 transitions. [2021-06-05 20:58:23,551 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1984 transitions. Word has length 21 [2021-06-05 20:58:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:23,552 INFO L482 AbstractCegarLoop]: Abstraction has 581 states and 1984 transitions. [2021-06-05 20:58:23,552 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 20:58:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1984 transitions. [2021-06-05 20:58:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:23,553 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:23,554 INFO L554 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 20:58:23,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 20:58:23,554 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 20:58:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:23,554 INFO L82 PathProgramCache]: Analyzing trace with hash 213760410, now seen corresponding path program 3 times [2021-06-05 20:58:23,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:23,555 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548614520] [2021-06-05 20:58:23,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:23,712 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 20:58:23,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:23,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548614520] [2021-06-05 20:58:23,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548614520] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:23,712 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:23,712 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:23,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052191306] [2021-06-05 20:58:23,713 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:23,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:23,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:23,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:23,715 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 20:58:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:23,796 INFO L93 Difference]: Finished difference Result 1207 states and 3862 transitions. [2021-06-05 20:58:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:23,797 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 20:58:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:23,803 INFO L225 Difference]: With dead ends: 1207 [2021-06-05 20:58:23,804 INFO L226 Difference]: Without dead ends: 1104 [2021-06-05 20:58:23,805 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 100.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2021-06-05 20:58:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 601. [2021-06-05 20:58:23,835 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 20:58:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 2044 transitions. [2021-06-05 20:58:23,839 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 2044 transitions. Word has length 21 [2021-06-05 20:58:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:23,840 INFO L482 AbstractCegarLoop]: Abstraction has 601 states and 2044 transitions. [2021-06-05 20:58:23,840 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 20:58:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 2044 transitions. [2021-06-05 20:58:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:23,844 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:23,844 INFO L554 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 20:58:23,844 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 20:58:23,844 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 20:58:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1651666564, now seen corresponding path program 4 times [2021-06-05 20:58:23,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:23,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939392156] [2021-06-05 20:58:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:23,998 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 20:58:23,998 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:23,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939392156] [2021-06-05 20:58:23,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939392156] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:23,998 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:23,998 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:23,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180696531] [2021-06-05 20:58:23,999 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:23,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:24,000 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 20:58:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:24,050 INFO L93 Difference]: Finished difference Result 1238 states and 3949 transitions. [2021-06-05 20:58:24,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:24,050 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 20:58:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:24,056 INFO L225 Difference]: With dead ends: 1238 [2021-06-05 20:58:24,056 INFO L226 Difference]: Without dead ends: 1084 [2021-06-05 20:58:24,057 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-06-05 20:58:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 581. [2021-06-05 20:58:24,077 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 20:58:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1974 transitions. [2021-06-05 20:58:24,079 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1974 transitions. Word has length 21 [2021-06-05 20:58:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:24,079 INFO L482 AbstractCegarLoop]: Abstraction has 581 states and 1974 transitions. [2021-06-05 20:58:24,080 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 20:58:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1974 transitions. [2021-06-05 20:58:24,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:24,081 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:24,081 INFO L554 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 20:58:24,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 20:58:24,082 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 20:58:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1790028250, now seen corresponding path program 5 times [2021-06-05 20:58:24,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:24,082 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828969100] [2021-06-05 20:58:24,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:24,164 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 20:58:24,164 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:24,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828969100] [2021-06-05 20:58:24,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828969100] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:24,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:24,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:24,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353402178] [2021-06-05 20:58:24,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:24,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:24,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:24,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:24,166 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 20:58:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:24,228 INFO L93 Difference]: Finished difference Result 1182 states and 3774 transitions. [2021-06-05 20:58:24,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:24,229 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 20:58:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:24,234 INFO L225 Difference]: With dead ends: 1182 [2021-06-05 20:58:24,235 INFO L226 Difference]: Without dead ends: 1079 [2021-06-05 20:58:24,235 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-06-05 20:58:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 593. [2021-06-05 20:58:24,256 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 20:58:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 2006 transitions. [2021-06-05 20:58:24,259 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 2006 transitions. Word has length 21 [2021-06-05 20:58:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:24,259 INFO L482 AbstractCegarLoop]: Abstraction has 593 states and 2006 transitions. [2021-06-05 20:58:24,259 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 20:58:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 2006 transitions. [2021-06-05 20:58:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:24,262 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:24,262 INFO L554 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 20:58:24,262 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 20:58:24,262 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 20:58:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash 856912858, now seen corresponding path program 6 times [2021-06-05 20:58:24,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:24,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121314922] [2021-06-05 20:58:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:24,382 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 20:58:24,382 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:24,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121314922] [2021-06-05 20:58:24,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121314922] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:24,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:24,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:24,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168916717] [2021-06-05 20:58:24,383 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:24,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:24,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:24,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:24,384 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 20:58:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:24,444 INFO L93 Difference]: Finished difference Result 1196 states and 3811 transitions. [2021-06-05 20:58:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:24,445 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 20:58:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:24,450 INFO L225 Difference]: With dead ends: 1196 [2021-06-05 20:58:24,451 INFO L226 Difference]: Without dead ends: 1053 [2021-06-05 20:58:24,451 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:24,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-06-05 20:58:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 567. [2021-06-05 20:58:24,472 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 20:58:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1938 transitions. [2021-06-05 20:58:24,474 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1938 transitions. Word has length 21 [2021-06-05 20:58:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:24,475 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1938 transitions. [2021-06-05 20:58:24,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 20:58:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1938 transitions. [2021-06-05 20:58:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:24,481 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:24,481 INFO L554 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 20:58:24,482 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 20:58:24,482 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 20:58:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1393795936, now seen corresponding path program 7 times [2021-06-05 20:58:24,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:24,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946491604] [2021-06-05 20:58:24,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:24,593 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 20:58:24,594 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:24,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946491604] [2021-06-05 20:58:24,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946491604] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:24,594 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:24,594 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:24,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657638041] [2021-06-05 20:58:24,595 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:24,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:24,595 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 20:58:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:24,665 INFO L93 Difference]: Finished difference Result 1298 states and 4181 transitions. [2021-06-05 20:58:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:24,665 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 20:58:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:24,671 INFO L225 Difference]: With dead ends: 1298 [2021-06-05 20:58:24,672 INFO L226 Difference]: Without dead ends: 1164 [2021-06-05 20:58:24,672 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 85.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2021-06-05 20:58:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 623. [2021-06-05 20:58:24,694 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 20:58:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 2106 transitions. [2021-06-05 20:58:24,697 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 2106 transitions. Word has length 21 [2021-06-05 20:58:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:24,697 INFO L482 AbstractCegarLoop]: Abstraction has 623 states and 2106 transitions. [2021-06-05 20:58:24,697 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 20:58:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 2106 transitions. [2021-06-05 20:58:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:24,699 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:24,699 INFO L554 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 20:58:24,699 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 20:58:24,699 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 20:58:24,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:24,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1150903392, now seen corresponding path program 8 times [2021-06-05 20:58:24,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:24,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567806491] [2021-06-05 20:58:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:24,813 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 20:58:24,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:24,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567806491] [2021-06-05 20:58:24,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567806491] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:24,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:24,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:24,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314084651] [2021-06-05 20:58:24,813 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:24,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:24,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:24,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:24,814 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 20:58:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:24,870 INFO L93 Difference]: Finished difference Result 1281 states and 4104 transitions. [2021-06-05 20:58:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:24,870 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 20:58:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:24,876 INFO L225 Difference]: With dead ends: 1281 [2021-06-05 20:58:24,877 INFO L226 Difference]: Without dead ends: 1129 [2021-06-05 20:58:24,877 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-06-05 20:58:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 588. [2021-06-05 20:58:24,896 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 20:58:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1996 transitions. [2021-06-05 20:58:24,898 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1996 transitions. Word has length 21 [2021-06-05 20:58:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:24,898 INFO L482 AbstractCegarLoop]: Abstraction has 588 states and 1996 transitions. [2021-06-05 20:58:24,899 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 20:58:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1996 transitions. [2021-06-05 20:58:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:24,900 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:24,900 INFO L554 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 20:58:24,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 20:58:24,900 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 20:58:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:24,901 INFO L82 PathProgramCache]: Analyzing trace with hash -632541758, now seen corresponding path program 9 times [2021-06-05 20:58:24,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:24,901 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593326566] [2021-06-05 20:58:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:24,974 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 20:58:24,974 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:24,974 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593326566] [2021-06-05 20:58:24,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593326566] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:24,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:24,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:24,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921259801] [2021-06-05 20:58:24,975 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:24,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:24,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:24,976 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 20:58:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:25,015 INFO L93 Difference]: Finished difference Result 1287 states and 4136 transitions. [2021-06-05 20:58:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:25,016 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 20:58:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:25,022 INFO L225 Difference]: With dead ends: 1287 [2021-06-05 20:58:25,022 INFO L226 Difference]: Without dead ends: 1153 [2021-06-05 20:58:25,022 INFO L810 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 20:58:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-06-05 20:58:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 614. [2021-06-05 20:58:25,043 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 20:58:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 2067 transitions. [2021-06-05 20:58:25,045 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 2067 transitions. Word has length 21 [2021-06-05 20:58:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:25,045 INFO L482 AbstractCegarLoop]: Abstraction has 614 states and 2067 transitions. [2021-06-05 20:58:25,045 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 20:58:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 2067 transitions. [2021-06-05 20:58:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:25,047 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:25,047 INFO L554 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 20:58:25,047 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 20:58:25,047 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 20:58:25,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:25,047 INFO L82 PathProgramCache]: Analyzing trace with hash 631742624, now seen corresponding path program 10 times [2021-06-05 20:58:25,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:25,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390024647] [2021-06-05 20:58:25,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:25,156 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 20:58:25,157 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:25,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390024647] [2021-06-05 20:58:25,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390024647] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:25,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:25,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:25,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001520391] [2021-06-05 20:58:25,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:25,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:25,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:25,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:25,159 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 20:58:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:25,219 INFO L93 Difference]: Finished difference Result 1268 states and 4055 transitions. [2021-06-05 20:58:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:25,219 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 20:58:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:25,226 INFO L225 Difference]: With dead ends: 1268 [2021-06-05 20:58:25,226 INFO L226 Difference]: Without dead ends: 1127 [2021-06-05 20:58:25,227 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:25,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2021-06-05 20:58:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 588. [2021-06-05 20:58:25,247 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 20:58:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1983 transitions. [2021-06-05 20:58:25,249 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1983 transitions. Word has length 21 [2021-06-05 20:58:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:25,249 INFO L482 AbstractCegarLoop]: Abstraction has 588 states and 1983 transitions. [2021-06-05 20:58:25,250 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 20:58:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1983 transitions. [2021-06-05 20:58:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:25,251 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:25,251 INFO L554 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 20:58:25,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 20:58:25,251 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 20:58:25,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:25,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1814079584, now seen corresponding path program 11 times [2021-06-05 20:58:25,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:25,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404036675] [2021-06-05 20:58:25,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:25,335 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 20:58:25,335 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:25,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404036675] [2021-06-05 20:58:25,335 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404036675] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:25,335 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:25,335 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:25,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143700309] [2021-06-05 20:58:25,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:25,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:25,336 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 20:58:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:25,403 INFO L93 Difference]: Finished difference Result 1245 states and 3995 transitions. [2021-06-05 20:58:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:25,403 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 20:58:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:25,416 INFO L225 Difference]: With dead ends: 1245 [2021-06-05 20:58:25,416 INFO L226 Difference]: Without dead ends: 1128 [2021-06-05 20:58:25,417 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 88.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2021-06-05 20:58:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 606. [2021-06-05 20:58:25,440 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 20:58:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 2034 transitions. [2021-06-05 20:58:25,442 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 2034 transitions. Word has length 21 [2021-06-05 20:58:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:25,443 INFO L482 AbstractCegarLoop]: Abstraction has 606 states and 2034 transitions. [2021-06-05 20:58:25,443 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 20:58:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 2034 transitions. [2021-06-05 20:58:25,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:25,444 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:25,444 INFO L554 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 20:58:25,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 20:58:25,445 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 20:58:25,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:25,445 INFO L82 PathProgramCache]: Analyzing trace with hash 224144834, now seen corresponding path program 12 times [2021-06-05 20:58:25,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:25,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537116788] [2021-06-05 20:58:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:25,539 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 20:58:25,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:25,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537116788] [2021-06-05 20:58:25,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537116788] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:25,540 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:25,540 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:25,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921820013] [2021-06-05 20:58:25,540 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:25,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:25,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:25,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:25,541 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 20:58:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:25,599 INFO L93 Difference]: Finished difference Result 1243 states and 3972 transitions. [2021-06-05 20:58:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:25,600 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 20:58:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:25,604 INFO L225 Difference]: With dead ends: 1243 [2021-06-05 20:58:25,604 INFO L226 Difference]: Without dead ends: 1089 [2021-06-05 20:58:25,604 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 92.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-06-05 20:58:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 567. [2021-06-05 20:58:25,624 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 20:58:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1929 transitions. [2021-06-05 20:58:25,627 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1929 transitions. Word has length 21 [2021-06-05 20:58:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:25,627 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1929 transitions. [2021-06-05 20:58: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 20:58:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1929 transitions. [2021-06-05 20:58:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:25,629 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:25,629 INFO L554 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 20:58:25,629 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 20:58:25,629 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 20:58:25,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:25,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1957163848, now seen corresponding path program 13 times [2021-06-05 20:58:25,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:25,630 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3046959] [2021-06-05 20:58:25,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:25,717 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 20:58:25,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:25,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3046959] [2021-06-05 20:58:25,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3046959] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:25,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:25,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:25,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089410185] [2021-06-05 20:58:25,718 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:25,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:25,719 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 20:58:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:25,777 INFO L93 Difference]: Finished difference Result 1192 states and 3820 transitions. [2021-06-05 20:58:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:25,778 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 20:58:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:25,781 INFO L225 Difference]: With dead ends: 1192 [2021-06-05 20:58:25,781 INFO L226 Difference]: Without dead ends: 1089 [2021-06-05 20:58:25,782 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-06-05 20:58:25,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 597. [2021-06-05 20:58:25,802 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 20:58:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 2030 transitions. [2021-06-05 20:58:25,804 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 2030 transitions. Word has length 21 [2021-06-05 20:58:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:25,805 INFO L482 AbstractCegarLoop]: Abstraction has 597 states and 2030 transitions. [2021-06-05 20:58:25,805 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 20:58:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 2030 transitions. [2021-06-05 20:58:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:25,807 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:25,807 INFO L554 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 20:58:25,807 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 20:58:25,807 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 20:58:25,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:25,807 INFO L82 PathProgramCache]: Analyzing trace with hash 472376474, now seen corresponding path program 14 times [2021-06-05 20:58:25,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:25,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440000903] [2021-06-05 20:58:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:25,900 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 20:58:25,900 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:25,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440000903] [2021-06-05 20:58:25,900 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440000903] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:25,900 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:25,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:25,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581129891] [2021-06-05 20:58:25,901 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:25,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:25,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:25,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:25,902 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 20:58:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:25,948 INFO L93 Difference]: Finished difference Result 1223 states and 3907 transitions. [2021-06-05 20:58:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:25,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 20:58:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:25,952 INFO L225 Difference]: With dead ends: 1223 [2021-06-05 20:58:25,952 INFO L226 Difference]: Without dead ends: 1069 [2021-06-05 20:58:25,952 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-06-05 20:58:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 577. [2021-06-05 20:58:25,968 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 20:58:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1960 transitions. [2021-06-05 20:58:25,970 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1960 transitions. Word has length 21 [2021-06-05 20:58:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:25,971 INFO L482 AbstractCegarLoop]: Abstraction has 577 states and 1960 transitions. [2021-06-05 20:58:25,971 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 20:58:25,971 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1960 transitions. [2021-06-05 20:58:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:25,972 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:25,972 INFO L554 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 20:58:25,972 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 20:58:25,973 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 20:58:25,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:25,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1419053670, now seen corresponding path program 15 times [2021-06-05 20:58:25,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:25,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859497918] [2021-06-05 20:58:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:26,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 20:58:26,040 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:26,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859497918] [2021-06-05 20:58:26,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859497918] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:26,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:26,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:26,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568222161] [2021-06-05 20:58:26,041 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:26,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:26,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:26,042 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 20:58:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:26,104 INFO L93 Difference]: Finished difference Result 1165 states and 3727 transitions. [2021-06-05 20:58:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:26,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 20:58:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:26,108 INFO L225 Difference]: With dead ends: 1165 [2021-06-05 20:58:26,108 INFO L226 Difference]: Without dead ends: 1062 [2021-06-05 20:58:26,108 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2021-06-05 20:58:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 589. [2021-06-05 20:58:26,125 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 20:58:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1992 transitions. [2021-06-05 20:58:26,127 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1992 transitions. Word has length 21 [2021-06-05 20:58:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:26,128 INFO L482 AbstractCegarLoop]: Abstraction has 589 states and 1992 transitions. [2021-06-05 20:58:26,128 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 20:58:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1992 transitions. [2021-06-05 20:58:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:26,129 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:26,129 INFO L554 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 20:58:26,129 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 20:58:26,129 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 20:58:26,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:26,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1264168858, now seen corresponding path program 16 times [2021-06-05 20:58:26,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:26,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496723101] [2021-06-05 20:58:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:26,196 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 20:58:26,196 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:26,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496723101] [2021-06-05 20:58:26,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496723101] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:26,196 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:26,196 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:26,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451657043] [2021-06-05 20:58:26,197 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:26,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:26,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:26,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:26,197 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 20:58:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:26,249 INFO L93 Difference]: Finished difference Result 1177 states and 3759 transitions. [2021-06-05 20:58:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:26,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 20:58:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:26,252 INFO L225 Difference]: With dead ends: 1177 [2021-06-05 20:58:26,252 INFO L226 Difference]: Without dead ends: 1050 [2021-06-05 20:58:26,253 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-06-05 20:58:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 577. [2021-06-05 20:58:26,269 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 20:58:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1954 transitions. [2021-06-05 20:58:26,271 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1954 transitions. Word has length 21 [2021-06-05 20:58:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:26,271 INFO L482 AbstractCegarLoop]: Abstraction has 577 states and 1954 transitions. [2021-06-05 20:58:26,271 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 20:58:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1954 transitions. [2021-06-05 20:58:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:26,273 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:26,273 INFO L554 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 20:58:26,273 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 20:58:26,273 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 20:58:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash 947468028, now seen corresponding path program 17 times [2021-06-05 20:58:26,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:26,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187886305] [2021-06-05 20:58:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:26,344 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 20:58:26,344 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:26,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187886305] [2021-06-05 20:58:26,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187886305] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:26,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:26,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:26,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209501569] [2021-06-05 20:58:26,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:26,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:26,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:26,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:26,346 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 20:58:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:26,385 INFO L93 Difference]: Finished difference Result 1241 states and 3972 transitions. [2021-06-05 20:58:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:26,385 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 20:58:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:26,388 INFO L225 Difference]: With dead ends: 1241 [2021-06-05 20:58:26,388 INFO L226 Difference]: Without dead ends: 1107 [2021-06-05 20:58:26,389 INFO L810 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 20:58:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-06-05 20:58:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 603. [2021-06-05 20:58:26,406 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 20:58:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 2025 transitions. [2021-06-05 20:58:26,408 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 2025 transitions. Word has length 21 [2021-06-05 20:58:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:26,408 INFO L482 AbstractCegarLoop]: Abstraction has 603 states and 2025 transitions. [2021-06-05 20:58:26,408 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 20:58:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 2025 transitions. [2021-06-05 20:58:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:26,409 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:26,410 INFO L554 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 20:58:26,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 20:58:26,410 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 20:58:26,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:26,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1035404762, now seen corresponding path program 18 times [2021-06-05 20:58:26,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:26,410 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849303177] [2021-06-05 20:58:26,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:26,496 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 20:58:26,496 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:26,496 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849303177] [2021-06-05 20:58:26,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849303177] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:26,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:26,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:26,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154589929] [2021-06-05 20:58:26,497 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:26,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:26,498 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 20:58:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:26,548 INFO L93 Difference]: Finished difference Result 1222 states and 3891 transitions. [2021-06-05 20:58:26,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:26,548 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 20:58:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:26,551 INFO L225 Difference]: With dead ends: 1222 [2021-06-05 20:58:26,551 INFO L226 Difference]: Without dead ends: 1071 [2021-06-05 20:58:26,551 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2021-06-05 20:58:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 567. [2021-06-05 20:58:26,568 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 20:58:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1924 transitions. [2021-06-05 20:58:26,570 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1924 transitions. Word has length 21 [2021-06-05 20:58:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:26,570 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1924 transitions. [2021-06-05 20:58:26,570 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 20:58:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1924 transitions. [2021-06-05 20:58:26,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:26,572 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:26,572 INFO L554 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 20:58:26,573 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 20:58:26,573 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 20:58:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash 873653722, now seen corresponding path program 19 times [2021-06-05 20:58:26,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:26,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16720507] [2021-06-05 20:58:26,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:26,638 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 20:58:26,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:26,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16720507] [2021-06-05 20:58:26,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16720507] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:26,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:26,639 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:26,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715643363] [2021-06-05 20:58:26,639 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:26,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:26,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:26,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:26,640 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 20:58:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:26,698 INFO L93 Difference]: Finished difference Result 1130 states and 3615 transitions. [2021-06-05 20:58:26,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:26,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 20:58:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:26,701 INFO L225 Difference]: With dead ends: 1130 [2021-06-05 20:58:26,701 INFO L226 Difference]: Without dead ends: 1027 [2021-06-05 20:58:26,701 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:26,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2021-06-05 20:58:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 585. [2021-06-05 20:58:26,718 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 20:58:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1981 transitions. [2021-06-05 20:58:26,720 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1981 transitions. Word has length 21 [2021-06-05 20:58:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:26,720 INFO L482 AbstractCegarLoop]: Abstraction has 585 states and 1981 transitions. [2021-06-05 20:58:26,720 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 20:58:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1981 transitions. [2021-06-05 20:58:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:26,721 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:26,721 INFO L554 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 20:58:26,722 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 20:58:26,722 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 20:58:26,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:26,722 INFO L82 PathProgramCache]: Analyzing trace with hash -59461670, now seen corresponding path program 20 times [2021-06-05 20:58:26,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:26,722 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517418516] [2021-06-05 20:58:26,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:26,788 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 20:58:26,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:26,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517418516] [2021-06-05 20:58:26,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517418516] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:26,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:26,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:26,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743563328] [2021-06-05 20:58:26,789 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:26,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:26,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:26,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:26,790 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 20:58:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:26,844 INFO L93 Difference]: Finished difference Result 1144 states and 3652 transitions. [2021-06-05 20:58:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:26,844 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 20:58:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:26,847 INFO L225 Difference]: With dead ends: 1144 [2021-06-05 20:58:26,847 INFO L226 Difference]: Without dead ends: 1015 [2021-06-05 20:58:26,847 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-06-05 20:58:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 573. [2021-06-05 20:58:26,864 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 20:58:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1943 transitions. [2021-06-05 20:58:26,866 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1943 transitions. Word has length 21 [2021-06-05 20:58:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:26,866 INFO L482 AbstractCegarLoop]: Abstraction has 573 states and 1943 transitions. [2021-06-05 20:58:26,866 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 20:58:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1943 transitions. [2021-06-05 20:58:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:26,867 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:26,867 INFO L554 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 20:58:26,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 20:58:26,867 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 20:58:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:26,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1169683272, now seen corresponding path program 21 times [2021-06-05 20:58:26,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:26,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074181359] [2021-06-05 20:58:26,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:26,937 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 20:58:26,937 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:26,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074181359] [2021-06-05 20:58:26,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074181359] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:26,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:26,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:26,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968310781] [2021-06-05 20:58:26,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:26,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:26,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:26,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:26,938 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 20:58:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:26,992 INFO L93 Difference]: Finished difference Result 1128 states and 3604 transitions. [2021-06-05 20:58:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:26,992 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 20:58:26,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:26,995 INFO L225 Difference]: With dead ends: 1128 [2021-06-05 20:58:26,995 INFO L226 Difference]: Without dead ends: 1025 [2021-06-05 20:58:26,996 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 74.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2021-06-05 20:58:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 585. [2021-06-05 20:58:27,012 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 20:58:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1975 transitions. [2021-06-05 20:58:27,014 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1975 transitions. Word has length 21 [2021-06-05 20:58:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:27,014 INFO L482 AbstractCegarLoop]: Abstraction has 585 states and 1975 transitions. [2021-06-05 20:58:27,014 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 20:58:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1975 transitions. [2021-06-05 20:58:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:27,015 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:27,015 INFO L554 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 20:58:27,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 20:58:27,015 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 20:58:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:27,016 INFO L82 PathProgramCache]: Analyzing trace with hash -65892390, now seen corresponding path program 22 times [2021-06-05 20:58:27,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:27,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658081772] [2021-06-05 20:58:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:27,082 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 20:58:27,082 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:27,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658081772] [2021-06-05 20:58:27,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658081772] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:27,082 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:27,082 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:27,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363964093] [2021-06-05 20:58:27,082 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:27,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:27,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:27,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:27,083 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 20:58:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:27,134 INFO L93 Difference]: Finished difference Result 1140 states and 3636 transitions. [2021-06-05 20:58:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:27,134 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 20:58:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:27,137 INFO L225 Difference]: With dead ends: 1140 [2021-06-05 20:58:27,137 INFO L226 Difference]: Without dead ends: 1013 [2021-06-05 20:58:27,138 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 72.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2021-06-05 20:58:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 573. [2021-06-05 20:58:27,153 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 20:58:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1937 transitions. [2021-06-05 20:58:27,155 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1937 transitions. Word has length 21 [2021-06-05 20:58:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:27,155 INFO L482 AbstractCegarLoop]: Abstraction has 573 states and 1937 transitions. [2021-06-05 20:58:27,155 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 20:58:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1937 transitions. [2021-06-05 20:58:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:27,156 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:27,156 INFO L554 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 20:58:27,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 20:58:27,156 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 20:58:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1537010138, now seen corresponding path program 23 times [2021-06-05 20:58:27,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:27,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778356215] [2021-06-05 20:58:27,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:27,219 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 20:58:27,219 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:27,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778356215] [2021-06-05 20:58:27,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778356215] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:27,219 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:27,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:27,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943931498] [2021-06-05 20:58:27,220 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:27,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:27,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:27,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:27,220 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 20:58:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:27,272 INFO L93 Difference]: Finished difference Result 1162 states and 3721 transitions. [2021-06-05 20:58:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:27,272 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 20:58:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:27,275 INFO L225 Difference]: With dead ends: 1162 [2021-06-05 20:58:27,275 INFO L226 Difference]: Without dead ends: 1045 [2021-06-05 20:58:27,276 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 75.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-06-05 20:58:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 591. [2021-06-05 20:58:27,292 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 20:58:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1988 transitions. [2021-06-05 20:58:27,294 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1988 transitions. Word has length 21 [2021-06-05 20:58:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:27,294 INFO L482 AbstractCegarLoop]: Abstraction has 591 states and 1988 transitions. [2021-06-05 20:58:27,294 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 20:58:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1988 transitions. [2021-06-05 20:58:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:27,296 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:27,296 INFO L554 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 20:58:27,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 20:58:27,296 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 20:58:27,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1208627256, now seen corresponding path program 24 times [2021-06-05 20:58:27,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:27,296 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406091662] [2021-06-05 20:58:27,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:27,360 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 20:58:27,360 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:27,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406091662] [2021-06-05 20:58:27,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406091662] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:27,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:27,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:27,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230460646] [2021-06-05 20:58:27,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:27,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:27,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:27,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:27,378 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 20:58:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:27,445 INFO L93 Difference]: Finished difference Result 1160 states and 3698 transitions. [2021-06-05 20:58:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:27,446 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 20:58:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:27,449 INFO L225 Difference]: With dead ends: 1160 [2021-06-05 20:58:27,449 INFO L226 Difference]: Without dead ends: 1010 [2021-06-05 20:58:27,449 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-06-05 20:58:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 556. [2021-06-05 20:58:27,466 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 20:58:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1902 transitions. [2021-06-05 20:58:27,467 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1902 transitions. Word has length 21 [2021-06-05 20:58:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:27,468 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1902 transitions. [2021-06-05 20:58:27,468 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 20:58:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1902 transitions. [2021-06-05 20:58:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:27,469 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:27,469 INFO L554 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 20:58:27,469 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 20:58:27,469 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 20:58:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1496436350, now seen corresponding path program 25 times [2021-06-05 20:58:27,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:27,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27440651] [2021-06-05 20:58:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:27,546 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 20:58:27,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:27,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27440651] [2021-06-05 20:58:27,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27440651] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:27,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:27,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:27,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740988835] [2021-06-05 20:58:27,546 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:27,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:27,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:27,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:27,547 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 20:58:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:27,590 INFO L93 Difference]: Finished difference Result 1242 states and 3976 transitions. [2021-06-05 20:58:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:27,591 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 20:58:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:27,594 INFO L225 Difference]: With dead ends: 1242 [2021-06-05 20:58:27,594 INFO L226 Difference]: Without dead ends: 1108 [2021-06-05 20:58:27,594 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 71.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2021-06-05 20:58:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 591. [2021-06-05 20:58:27,611 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 20:58:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1995 transitions. [2021-06-05 20:58:27,613 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1995 transitions. Word has length 21 [2021-06-05 20:58:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:27,613 INFO L482 AbstractCegarLoop]: Abstraction has 591 states and 1995 transitions. [2021-06-05 20:58:27,613 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 20:58:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1995 transitions. [2021-06-05 20:58:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:27,614 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:27,615 INFO L554 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 20:58:27,615 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 20:58:27,615 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 20:58:27,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:27,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1048262978, now seen corresponding path program 26 times [2021-06-05 20:58:27,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:27,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221387434] [2021-06-05 20:58:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:27,690 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 20:58:27,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:27,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221387434] [2021-06-05 20:58:27,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221387434] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:27,690 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:27,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:27,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428016796] [2021-06-05 20:58:27,691 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:27,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:27,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:27,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:27,691 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 20:58:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:27,755 INFO L93 Difference]: Finished difference Result 1225 states and 3899 transitions. [2021-06-05 20:58:27,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:27,756 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 20:58:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:27,759 INFO L225 Difference]: With dead ends: 1225 [2021-06-05 20:58:27,759 INFO L226 Difference]: Without dead ends: 1073 [2021-06-05 20:58:27,759 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 89.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-06-05 20:58:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 556. [2021-06-05 20:58:27,775 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 20:58:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1888 transitions. [2021-06-05 20:58:27,777 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1888 transitions. Word has length 21 [2021-06-05 20:58:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:27,777 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1888 transitions. [2021-06-05 20:58:27,777 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 20:58:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1888 transitions. [2021-06-05 20:58:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:27,778 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:27,778 INFO L554 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 20:58:27,778 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 20:58:27,778 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 20:58:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:27,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1892039334, now seen corresponding path program 27 times [2021-06-05 20:58:27,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:27,779 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312007561] [2021-06-05 20:58:27,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:27,862 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 20:58:27,863 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:27,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312007561] [2021-06-05 20:58:27,863 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312007561] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:27,863 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:27,863 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:27,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106511322] [2021-06-05 20:58:27,863 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:27,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:27,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:27,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:27,864 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 20:58:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:27,922 INFO L93 Difference]: Finished difference Result 1182 states and 3766 transitions. [2021-06-05 20:58:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:27,923 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 20:58:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:27,926 INFO L225 Difference]: With dead ends: 1182 [2021-06-05 20:58:27,926 INFO L226 Difference]: Without dead ends: 1079 [2021-06-05 20:58:27,926 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 95.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-06-05 20:58:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 576. [2021-06-05 20:58:27,941 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 20:58:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1948 transitions. [2021-06-05 20:58:27,943 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1948 transitions. Word has length 21 [2021-06-05 20:58:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:27,943 INFO L482 AbstractCegarLoop]: Abstraction has 576 states and 1948 transitions. [2021-06-05 20:58:27,943 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 20:58:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1948 transitions. [2021-06-05 20:58:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:27,944 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:27,944 INFO L554 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 20:58:27,944 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 20:58:27,945 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 20:58:27,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:27,945 INFO L82 PathProgramCache]: Analyzing trace with hash 537500988, now seen corresponding path program 28 times [2021-06-05 20:58:27,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:27,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694048143] [2021-06-05 20:58:27,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:28,027 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 20:58:28,027 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:28,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694048143] [2021-06-05 20:58:28,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694048143] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:28,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:28,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:28,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512767075] [2021-06-05 20:58:28,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:28,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:28,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:28,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:28,028 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 20:58:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:28,071 INFO L93 Difference]: Finished difference Result 1213 states and 3853 transitions. [2021-06-05 20:58:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:28,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 20:58:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:28,074 INFO L225 Difference]: With dead ends: 1213 [2021-06-05 20:58:28,074 INFO L226 Difference]: Without dead ends: 1059 [2021-06-05 20:58:28,075 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2021-06-05 20:58:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 556. [2021-06-05 20:58:28,090 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 20:58:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1878 transitions. [2021-06-05 20:58:28,092 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1878 transitions. Word has length 21 [2021-06-05 20:58:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:28,092 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1878 transitions. [2021-06-05 20:58:28,092 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 20:58:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1878 transitions. [2021-06-05 20:58:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:28,093 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:28,093 INFO L554 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 20:58:28,094 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 20:58:28,094 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 20:58:28,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:28,094 INFO L82 PathProgramCache]: Analyzing trace with hash -315771494, now seen corresponding path program 29 times [2021-06-05 20:58:28,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:28,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92110600] [2021-06-05 20:58:28,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:28,158 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 20:58:28,159 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:28,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92110600] [2021-06-05 20:58:28,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92110600] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:28,159 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:28,159 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:28,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956625672] [2021-06-05 20:58:28,159 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:28,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:28,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:28,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:28,160 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 20:58:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:28,216 INFO L93 Difference]: Finished difference Result 1157 states and 3678 transitions. [2021-06-05 20:58:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:28,216 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 20:58:28,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:28,219 INFO L225 Difference]: With dead ends: 1157 [2021-06-05 20:58:28,219 INFO L226 Difference]: Without dead ends: 1054 [2021-06-05 20:58:28,219 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-06-05 20:58:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 568. [2021-06-05 20:58:28,234 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 20:58:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1910 transitions. [2021-06-05 20:58:28,236 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1910 transitions. Word has length 21 [2021-06-05 20:58:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:28,236 INFO L482 AbstractCegarLoop]: Abstraction has 568 states and 1910 transitions. [2021-06-05 20:58:28,236 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 20:58:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1910 transitions. [2021-06-05 20:58:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:28,237 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:28,237 INFO L554 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 20:58:28,237 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 20:58:28,237 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 20:58:28,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:28,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1248886886, now seen corresponding path program 30 times [2021-06-05 20:58:28,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:28,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130153092] [2021-06-05 20:58:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:28,302 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 20:58:28,302 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:28,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130153092] [2021-06-05 20:58:28,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130153092] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:28,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:28,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:28,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184780460] [2021-06-05 20:58:28,302 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:28,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:28,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:28,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:28,303 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 20:58:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:28,373 INFO L93 Difference]: Finished difference Result 1171 states and 3715 transitions. [2021-06-05 20:58:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:28,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 20:58:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:28,376 INFO L225 Difference]: With dead ends: 1171 [2021-06-05 20:58:28,376 INFO L226 Difference]: Without dead ends: 1028 [2021-06-05 20:58:28,377 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 91.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-06-05 20:58:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 542. [2021-06-05 20:58:28,391 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 20:58:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1843 transitions. [2021-06-05 20:58:28,392 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1843 transitions. Word has length 21 [2021-06-05 20:58:28,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:28,392 INFO L482 AbstractCegarLoop]: Abstraction has 542 states and 1843 transitions. [2021-06-05 20:58:28,393 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 20:58:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1843 transitions. [2021-06-05 20:58:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:28,394 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:28,394 INFO L554 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 20:58:28,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 20:58:28,394 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 20:58:28,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:28,394 INFO L82 PathProgramCache]: Analyzing trace with hash 825224928, now seen corresponding path program 31 times [2021-06-05 20:58:28,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:28,394 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353839631] [2021-06-05 20:58:28,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:28,476 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 20:58:28,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:28,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353839631] [2021-06-05 20:58:28,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353839631] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:28,477 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:28,477 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:28,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095373214] [2021-06-05 20:58:28,477 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:28,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:28,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:28,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:28,478 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 20:58:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:28,523 INFO L93 Difference]: Finished difference Result 1207 states and 3850 transitions. [2021-06-05 20:58:28,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:28,524 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 20:58:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:28,526 INFO L225 Difference]: With dead ends: 1207 [2021-06-05 20:58:28,527 INFO L226 Difference]: Without dead ends: 1073 [2021-06-05 20:58:28,527 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-06-05 20:58:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 591. [2021-06-05 20:58:28,542 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 20:58:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1989 transitions. [2021-06-05 20:58:28,544 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1989 transitions. Word has length 21 [2021-06-05 20:58:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:28,544 INFO L482 AbstractCegarLoop]: Abstraction has 591 states and 1989 transitions. [2021-06-05 20:58:28,544 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 20:58:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1989 transitions. [2021-06-05 20:58:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:28,545 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:28,545 INFO L554 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 20:58:28,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 20:58:28,545 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 20:58:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash -925043040, now seen corresponding path program 32 times [2021-06-05 20:58:28,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:28,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651170616] [2021-06-05 20:58:28,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:28,619 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 20:58:28,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:28,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651170616] [2021-06-05 20:58:28,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651170616] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:28,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:28,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:28,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68619539] [2021-06-05 20:58:28,620 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:28,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:28,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:28,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:28,620 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 20:58:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:28,681 INFO L93 Difference]: Finished difference Result 1190 states and 3773 transitions. [2021-06-05 20:58:28,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:28,681 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 20:58:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:28,684 INFO L225 Difference]: With dead ends: 1190 [2021-06-05 20:58:28,684 INFO L226 Difference]: Without dead ends: 1038 [2021-06-05 20:58:28,684 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 88.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-06-05 20:58:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 556. [2021-06-05 20:58:28,699 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 20:58:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1882 transitions. [2021-06-05 20:58:28,700 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1882 transitions. Word has length 21 [2021-06-05 20:58:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:28,701 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1882 transitions. [2021-06-05 20:58:28,701 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 20:58:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1882 transitions. [2021-06-05 20:58:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:28,702 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:28,702 INFO L554 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 20:58:28,702 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 20:58:28,702 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 20:58:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash -336502594, now seen corresponding path program 33 times [2021-06-05 20:58:28,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:28,703 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987543144] [2021-06-05 20:58:28,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:28,785 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 20:58:28,786 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:28,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987543144] [2021-06-05 20:58:28,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987543144] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:28,786 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:28,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:28,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569775688] [2021-06-05 20:58:28,786 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:28,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:28,787 INFO L87 Difference]: Start difference. First operand 556 states and 1882 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 20:58:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:28,831 INFO L93 Difference]: Finished difference Result 1147 states and 3640 transitions. [2021-06-05 20:58:28,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:28,832 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 20:58:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:28,835 INFO L225 Difference]: With dead ends: 1147 [2021-06-05 20:58:28,835 INFO L226 Difference]: Without dead ends: 1044 [2021-06-05 20:58:28,835 INFO L810 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 20:58:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2021-06-05 20:58:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 576. [2021-06-05 20:58:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 3.3773913043478263) internal successors, (1942), 575 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1942 transitions. [2021-06-05 20:58:28,852 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1942 transitions. Word has length 21 [2021-06-05 20:58:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:28,852 INFO L482 AbstractCegarLoop]: Abstraction has 576 states and 1942 transitions. [2021-06-05 20:58:28,852 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 20:58:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1942 transitions. [2021-06-05 20:58:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:28,853 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:28,853 INFO L554 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 20:58:28,854 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 20:58:28,854 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 20:58:28,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:28,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1926437344, now seen corresponding path program 34 times [2021-06-05 20:58:28,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:28,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832841792] [2021-06-05 20:58:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:28,948 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 20:58:28,948 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:28,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832841792] [2021-06-05 20:58:28,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832841792] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:28,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:28,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:28,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453608129] [2021-06-05 20:58:28,949 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:28,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:28,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:28,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:28,950 INFO L87 Difference]: Start difference. First operand 576 states and 1942 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 20:58:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:28,994 INFO L93 Difference]: Finished difference Result 1123 states and 3552 transitions. [2021-06-05 20:58:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:28,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 20:58:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:28,997 INFO L225 Difference]: With dead ends: 1123 [2021-06-05 20:58:28,997 INFO L226 Difference]: Without dead ends: 969 [2021-06-05 20:58:28,997 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2021-06-05 20:58:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 556. [2021-06-05 20:58:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.372972972972973) internal successors, (1872), 555 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1872 transitions. [2021-06-05 20:58:29,019 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1872 transitions. Word has length 21 [2021-06-05 20:58:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:29,019 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1872 transitions. [2021-06-05 20:58:29,019 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 20:58:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1872 transitions. [2021-06-05 20:58:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:29,020 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:29,020 INFO L554 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 20:58:29,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 20:58:29,021 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 20:58:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:29,021 INFO L82 PathProgramCache]: Analyzing trace with hash 744560032, now seen corresponding path program 35 times [2021-06-05 20:58:29,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:29,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477735033] [2021-06-05 20:58:29,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:29,102 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 20:58:29,103 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:29,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477735033] [2021-06-05 20:58:29,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477735033] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:29,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:29,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:29,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960078461] [2021-06-05 20:58:29,104 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:29,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:29,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:29,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:29,105 INFO L87 Difference]: Start difference. First operand 556 states and 1872 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 20:58:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:29,148 INFO L93 Difference]: Finished difference Result 1122 states and 3552 transitions. [2021-06-05 20:58:29,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:29,148 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 20:58:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:29,151 INFO L225 Difference]: With dead ends: 1122 [2021-06-05 20:58:29,151 INFO L226 Difference]: Without dead ends: 1019 [2021-06-05 20:58:29,151 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 79.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-06-05 20:58:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 568. [2021-06-05 20:58:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 3.3580246913580245) internal successors, (1904), 567 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1904 transitions. [2021-06-05 20:58:29,171 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1904 transitions. Word has length 21 [2021-06-05 20:58:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:29,171 INFO L482 AbstractCegarLoop]: Abstraction has 568 states and 1904 transitions. [2021-06-05 20:58:29,171 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 20:58:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1904 transitions. [2021-06-05 20:58:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:29,172 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:29,173 INFO L554 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 20:58:29,173 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 20:58:29,173 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 20:58:29,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:29,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1752858016, now seen corresponding path program 36 times [2021-06-05 20:58:29,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:29,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720513627] [2021-06-05 20:58:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:29,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 20:58:29,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:29,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720513627] [2021-06-05 20:58:29,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720513627] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:29,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:29,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:29,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722983738] [2021-06-05 20:58:29,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:29,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:29,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:29,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:29,260 INFO L87 Difference]: Start difference. First operand 568 states and 1904 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 20:58:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:29,334 INFO L93 Difference]: Finished difference Result 1098 states and 3464 transitions. [2021-06-05 20:58:29,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:29,334 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 20:58:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:29,337 INFO L225 Difference]: With dead ends: 1098 [2021-06-05 20:58:29,337 INFO L226 Difference]: Without dead ends: 955 [2021-06-05 20:58:29,337 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 99.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2021-06-05 20:58:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 542. [2021-06-05 20:58:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 3.3955637707948245) internal successors, (1837), 541 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1837 transitions. [2021-06-05 20:58:29,353 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1837 transitions. Word has length 21 [2021-06-05 20:58:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:29,353 INFO L482 AbstractCegarLoop]: Abstraction has 542 states and 1837 transitions. [2021-06-05 20:58:29,353 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 20:58:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1837 transitions. [2021-06-05 20:58:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:29,355 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:29,355 INFO L554 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 20:58:29,355 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 20:58:29,355 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 20:58:29,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:29,355 INFO L82 PathProgramCache]: Analyzing trace with hash 749113148, now seen corresponding path program 37 times [2021-06-05 20:58:29,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:29,356 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237881349] [2021-06-05 20:58:29,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:29,433 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 20:58:29,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:29,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237881349] [2021-06-05 20:58:29,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237881349] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:29,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:29,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:29,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345644754] [2021-06-05 20:58:29,434 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:29,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:29,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:29,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:29,435 INFO L87 Difference]: Start difference. First operand 542 states and 1837 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 20:58:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:29,492 INFO L93 Difference]: Finished difference Result 1100 states and 3491 transitions. [2021-06-05 20:58:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:29,493 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 20:58:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:29,496 INFO L225 Difference]: With dead ends: 1100 [2021-06-05 20:58:29,496 INFO L226 Difference]: Without dead ends: 997 [2021-06-05 20:58:29,496 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-06-05 20:58:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 558. [2021-06-05 20:58:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 3.391382405745063) internal successors, (1889), 557 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1889 transitions. [2021-06-05 20:58:29,514 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1889 transitions. Word has length 21 [2021-06-05 20:58:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:29,514 INFO L482 AbstractCegarLoop]: Abstraction has 558 states and 1889 transitions. [2021-06-05 20:58:29,514 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 20:58:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1889 transitions. [2021-06-05 20:58:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:29,515 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:29,515 INFO L554 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 20:58:29,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 20:58:29,515 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 20:58:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:29,516 INFO L82 PathProgramCache]: Analyzing trace with hash 997222278, now seen corresponding path program 38 times [2021-06-05 20:58:29,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:29,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684816152] [2021-06-05 20:58:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:29,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 20:58:29,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:29,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684816152] [2021-06-05 20:58:29,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684816152] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:29,596 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:29,596 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:29,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049749972] [2021-06-05 20:58:29,596 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:29,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:29,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:29,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:29,597 INFO L87 Difference]: Start difference. First operand 558 states and 1889 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 20:58:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:29,638 INFO L93 Difference]: Finished difference Result 1100 states and 3483 transitions. [2021-06-05 20:58:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:29,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 20:58:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:29,641 INFO L225 Difference]: With dead ends: 1100 [2021-06-05 20:58:29,641 INFO L226 Difference]: Without dead ends: 989 [2021-06-05 20:58:29,641 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:29,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-06-05 20:58:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 550. [2021-06-05 20:58:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.397085610200364) internal successors, (1865), 549 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1865 transitions. [2021-06-05 20:58:29,656 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1865 transitions. Word has length 21 [2021-06-05 20:58:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:29,656 INFO L482 AbstractCegarLoop]: Abstraction has 550 states and 1865 transitions. [2021-06-05 20:58:29,656 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 20:58:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1865 transitions. [2021-06-05 20:58:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:29,658 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:29,658 INFO L554 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 20:58:29,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 20:58:29,658 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 20:58:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1294223846, now seen corresponding path program 39 times [2021-06-05 20:58:29,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:29,658 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318265248] [2021-06-05 20:58:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:29,739 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 20:58:29,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:29,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318265248] [2021-06-05 20:58:29,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318265248] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:29,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:29,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:29,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571907559] [2021-06-05 20:58:29,740 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:29,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:29,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:29,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:29,741 INFO L87 Difference]: Start difference. First operand 550 states and 1865 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 20:58:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:29,798 INFO L93 Difference]: Finished difference Result 1123 states and 3558 transitions. [2021-06-05 20:58:29,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:29,798 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 20:58:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:29,800 INFO L225 Difference]: With dead ends: 1123 [2021-06-05 20:58:29,801 INFO L226 Difference]: Without dead ends: 1020 [2021-06-05 20:58:29,801 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 98.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2021-06-05 20:58:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 570. [2021-06-05 20:58:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 3.383128295254833) internal successors, (1925), 569 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1925 transitions. [2021-06-05 20:58:29,816 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1925 transitions. Word has length 21 [2021-06-05 20:58:29,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:29,816 INFO L482 AbstractCegarLoop]: Abstraction has 570 states and 1925 transitions. [2021-06-05 20:58:29,816 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 20:58:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1925 transitions. [2021-06-05 20:58:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:29,818 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:29,818 INFO L554 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 20:58:29,818 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 20:58:29,818 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 20:58:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:29,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2141739260, now seen corresponding path program 40 times [2021-06-05 20:58:29,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:29,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638726142] [2021-06-05 20:58:29,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:29,902 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 20:58:29,902 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:29,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638726142] [2021-06-05 20:58:29,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638726142] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:29,903 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:29,903 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:29,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95502939] [2021-06-05 20:58:29,903 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:29,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:29,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:29,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:29,904 INFO L87 Difference]: Start difference. First operand 570 states and 1925 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 20:58:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:29,947 INFO L93 Difference]: Finished difference Result 1154 states and 3645 transitions. [2021-06-05 20:58:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:29,948 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 20:58:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:29,951 INFO L225 Difference]: With dead ends: 1154 [2021-06-05 20:58:29,951 INFO L226 Difference]: Without dead ends: 1000 [2021-06-05 20:58:29,951 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 84.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2021-06-05 20:58:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 550. [2021-06-05 20:58:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.3825136612021858) internal successors, (1857), 549 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1857 transitions. [2021-06-05 20:58:29,966 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1857 transitions. Word has length 21 [2021-06-05 20:58:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:29,967 INFO L482 AbstractCegarLoop]: Abstraction has 550 states and 1857 transitions. [2021-06-05 20:58:29,967 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 20:58:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1857 transitions. [2021-06-05 20:58:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:29,968 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:29,968 INFO L554 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 20:58:29,969 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 20:58:29,969 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 20:58:29,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash 644082788, now seen corresponding path program 41 times [2021-06-05 20:58:29,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:29,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590777395] [2021-06-05 20:58:29,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:30,060 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 20:58:30,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:30,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590777395] [2021-06-05 20:58:30,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590777395] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:30,061 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:30,061 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:30,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682211510] [2021-06-05 20:58:30,061 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:30,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:30,062 INFO L87 Difference]: Start difference. First operand 550 states and 1857 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 20:58:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:30,102 INFO L93 Difference]: Finished difference Result 1123 states and 3550 transitions. [2021-06-05 20:58:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:30,103 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 20:58:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:30,105 INFO L225 Difference]: With dead ends: 1123 [2021-06-05 20:58:30,105 INFO L226 Difference]: Without dead ends: 1020 [2021-06-05 20:58:30,106 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2021-06-05 20:58:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 570. [2021-06-05 20:58:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 3.369068541300527) internal successors, (1917), 569 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1917 transitions. [2021-06-05 20:58:30,121 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1917 transitions. Word has length 21 [2021-06-05 20:58:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:30,121 INFO L482 AbstractCegarLoop]: Abstraction has 570 states and 1917 transitions. [2021-06-05 20:58:30,121 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 20:58:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1917 transitions. [2021-06-05 20:58:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:30,122 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:30,122 INFO L554 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 20:58:30,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 20:58:30,123 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 20:58:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:30,123 INFO L82 PathProgramCache]: Analyzing trace with hash -945851962, now seen corresponding path program 42 times [2021-06-05 20:58:30,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:30,123 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752347901] [2021-06-05 20:58:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:30,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 20:58:30,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:30,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752347901] [2021-06-05 20:58:30,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752347901] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:30,215 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:30,215 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:30,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310637208] [2021-06-05 20:58:30,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:30,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:30,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:30,215 INFO L87 Difference]: Start difference. First operand 570 states and 1917 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 20:58:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:30,258 INFO L93 Difference]: Finished difference Result 1099 states and 3462 transitions. [2021-06-05 20:58:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:30,258 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 20:58:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:30,260 INFO L225 Difference]: With dead ends: 1099 [2021-06-05 20:58:30,260 INFO L226 Difference]: Without dead ends: 937 [2021-06-05 20:58:30,261 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 88.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2021-06-05 20:58:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 542. [2021-06-05 20:58:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 3.388170055452865) internal successors, (1833), 541 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1833 transitions. [2021-06-05 20:58:30,274 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1833 transitions. Word has length 21 [2021-06-05 20:58:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:30,275 INFO L482 AbstractCegarLoop]: Abstraction has 542 states and 1833 transitions. [2021-06-05 20:58:30,275 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 20:58:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1833 transitions. [2021-06-05 20:58:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:30,276 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:30,276 INFO L554 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 20:58:30,276 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 20:58:30,276 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 20:58:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:30,276 INFO L82 PathProgramCache]: Analyzing trace with hash -97683814, now seen corresponding path program 43 times [2021-06-05 20:58:30,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:30,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771845985] [2021-06-05 20:58:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:30,344 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 20:58:30,344 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:30,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771845985] [2021-06-05 20:58:30,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771845985] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:30,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:30,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:30,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094700711] [2021-06-05 20:58:30,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:30,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:30,345 INFO L87 Difference]: Start difference. First operand 542 states and 1833 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 20:58:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:30,401 INFO L93 Difference]: Finished difference Result 1063 states and 3365 transitions. [2021-06-05 20:58:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:30,402 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 20:58:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:30,404 INFO L225 Difference]: With dead ends: 1063 [2021-06-05 20:58:30,404 INFO L226 Difference]: Without dead ends: 960 [2021-06-05 20:58:30,404 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 83.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-06-05 20:58:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 554. [2021-06-05 20:58:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 3.3797468354430378) internal successors, (1869), 553 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1869 transitions. [2021-06-05 20:58:30,418 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1869 transitions. Word has length 21 [2021-06-05 20:58:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:30,418 INFO L482 AbstractCegarLoop]: Abstraction has 554 states and 1869 transitions. [2021-06-05 20:58:30,418 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 20:58:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1869 transitions. [2021-06-05 20:58:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:30,419 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:30,420 INFO L554 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 20:58:30,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 20:58:30,420 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 20:58:30,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:30,420 INFO L82 PathProgramCache]: Analyzing trace with hash 150425316, now seen corresponding path program 44 times [2021-06-05 20:58:30,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:30,420 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725273109] [2021-06-05 20:58:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:30,496 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 20:58:30,496 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:30,496 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725273109] [2021-06-05 20:58:30,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725273109] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:30,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:30,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:30,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862444640] [2021-06-05 20:58:30,497 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:30,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:30,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:30,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:30,497 INFO L87 Difference]: Start difference. First operand 554 states and 1869 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 20:58:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:30,540 INFO L93 Difference]: Finished difference Result 1063 states and 3357 transitions. [2021-06-05 20:58:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:30,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 20:58:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:30,542 INFO L225 Difference]: With dead ends: 1063 [2021-06-05 20:58:30,543 INFO L226 Difference]: Without dead ends: 952 [2021-06-05 20:58:30,543 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 67.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2021-06-05 20:58:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 546. [2021-06-05 20:58:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 3.385321100917431) internal successors, (1845), 545 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1845 transitions. [2021-06-05 20:58:30,556 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1845 transitions. Word has length 21 [2021-06-05 20:58:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:30,557 INFO L482 AbstractCegarLoop]: Abstraction has 546 states and 1845 transitions. [2021-06-05 20:58:30,557 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 20:58:30,557 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1845 transitions. [2021-06-05 20:58:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:30,558 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:30,558 INFO L554 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 20:58:30,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 20:58:30,558 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 20:58:30,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:30,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1094782618, now seen corresponding path program 45 times [2021-06-05 20:58:30,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:30,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178332620] [2021-06-05 20:58:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:30,621 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 20:58:30,621 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:30,621 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178332620] [2021-06-05 20:58:30,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178332620] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:30,622 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:30,622 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:30,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889774694] [2021-06-05 20:58:30,622 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:30,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:30,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:30,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:30,623 INFO L87 Difference]: Start difference. First operand 546 states and 1845 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 20:58:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:30,681 INFO L93 Difference]: Finished difference Result 1069 states and 3382 transitions. [2021-06-05 20:58:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:30,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 20:58:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:30,684 INFO L225 Difference]: With dead ends: 1069 [2021-06-05 20:58:30,684 INFO L226 Difference]: Without dead ends: 966 [2021-06-05 20:58:30,684 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 75.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-06-05 20:58:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 558. [2021-06-05 20:58:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 3.36983842010772) internal successors, (1877), 557 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1877 transitions. [2021-06-05 20:58:30,698 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1877 transitions. Word has length 21 [2021-06-05 20:58:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:30,698 INFO L482 AbstractCegarLoop]: Abstraction has 558 states and 1877 transitions. [2021-06-05 20:58:30,698 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 20:58:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1877 transitions. [2021-06-05 20:58:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:30,700 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:30,700 INFO L554 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 20:58:30,700 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 20:58:30,700 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 20:58:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:30,700 INFO L82 PathProgramCache]: Analyzing trace with hash -421844740, now seen corresponding path program 46 times [2021-06-05 20:58:30,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:30,700 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130560334] [2021-06-05 20:58:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:30,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 20:58:30,762 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:30,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130560334] [2021-06-05 20:58:30,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130560334] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:30,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:30,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:30,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330714660] [2021-06-05 20:58:30,763 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:30,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:30,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:30,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:30,764 INFO L87 Difference]: Start difference. First operand 558 states and 1877 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 20:58:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:30,813 INFO L93 Difference]: Finished difference Result 1083 states and 3419 transitions. [2021-06-05 20:58:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:30,813 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 20:58:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:30,815 INFO L225 Difference]: With dead ends: 1083 [2021-06-05 20:58:30,815 INFO L226 Difference]: Without dead ends: 954 [2021-06-05 20:58:30,815 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 74.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2021-06-05 20:58:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 546. [2021-06-05 20:58:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 3.377981651376147) internal successors, (1841), 545 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1841 transitions. [2021-06-05 20:58:30,829 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1841 transitions. Word has length 21 [2021-06-05 20:58:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:30,829 INFO L482 AbstractCegarLoop]: Abstraction has 546 states and 1841 transitions. [2021-06-05 20:58:30,829 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 20:58:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1841 transitions. [2021-06-05 20:58:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:30,830 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:30,830 INFO L554 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 20:58:30,831 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 20:58:30,831 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 20:58:30,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:30,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1261878044, now seen corresponding path program 47 times [2021-06-05 20:58:30,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:30,831 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378677234] [2021-06-05 20:58:30,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:30,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 20:58:30,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:30,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378677234] [2021-06-05 20:58:30,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378677234] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:30,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:30,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:30,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341404824] [2021-06-05 20:58:30,898 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:30,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:30,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:30,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:30,898 INFO L87 Difference]: Start difference. First operand 546 states and 1841 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 20:58:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:30,933 INFO L93 Difference]: Finished difference Result 1069 states and 3378 transitions. [2021-06-05 20:58:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:30,934 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 20:58:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:30,935 INFO L225 Difference]: With dead ends: 1069 [2021-06-05 20:58:30,936 INFO L226 Difference]: Without dead ends: 966 [2021-06-05 20:58:30,936 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 64.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-06-05 20:58:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 558. [2021-06-05 20:58:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 3.362657091561939) internal successors, (1873), 557 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1873 transitions. [2021-06-05 20:58:30,950 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1873 transitions. Word has length 21 [2021-06-05 20:58:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:30,950 INFO L482 AbstractCegarLoop]: Abstraction has 558 states and 1873 transitions. [2021-06-05 20:58:30,950 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 20:58:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1873 transitions. [2021-06-05 20:58:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:30,951 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:30,952 INFO L554 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 20:58:30,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 20:58:30,952 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 20:58:30,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:30,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1464160710, now seen corresponding path program 48 times [2021-06-05 20:58:30,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:30,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870096330] [2021-06-05 20:58:30,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:31,032 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 20:58:31,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:31,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870096330] [2021-06-05 20:58:31,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870096330] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:31,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:31,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:31,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821459090] [2021-06-05 20:58:31,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:31,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:31,033 INFO L87 Difference]: Start difference. First operand 558 states and 1873 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 20:58:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:31,083 INFO L93 Difference]: Finished difference Result 1045 states and 3290 transitions. [2021-06-05 20:58:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:31,086 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 20:58:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:31,088 INFO L225 Difference]: With dead ends: 1045 [2021-06-05 20:58:31,088 INFO L226 Difference]: Without dead ends: 906 [2021-06-05 20:58:31,089 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-06-05 20:58:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 536. [2021-06-05 20:58:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 3.4037383177570093) internal successors, (1821), 535 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1821 transitions. [2021-06-05 20:58:31,099 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1821 transitions. Word has length 21 [2021-06-05 20:58:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:31,099 INFO L482 AbstractCegarLoop]: Abstraction has 536 states and 1821 transitions. [2021-06-05 20:58:31,099 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 20:58:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1821 transitions. [2021-06-05 20:58:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:31,100 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:31,100 INFO L554 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 20:58:31,100 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 20:58:31,100 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 20:58:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:31,100 INFO L82 PathProgramCache]: Analyzing trace with hash -65542594, now seen corresponding path program 49 times [2021-06-05 20:58:31,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:31,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193540958] [2021-06-05 20:58:31,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:31,169 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 20:58:31,170 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:31,170 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193540958] [2021-06-05 20:58:31,170 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193540958] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:31,170 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:31,170 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:31,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573258725] [2021-06-05 20:58:31,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:31,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:31,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:31,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:31,171 INFO L87 Difference]: Start difference. First operand 536 states and 1821 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 20:58:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:31,208 INFO L93 Difference]: Finished difference Result 1187 states and 3775 transitions. [2021-06-05 20:58:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:31,209 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 20:58:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:31,211 INFO L225 Difference]: With dead ends: 1187 [2021-06-05 20:58:31,211 INFO L226 Difference]: Without dead ends: 1053 [2021-06-05 20:58:31,211 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 67.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-06-05 20:58:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 571. [2021-06-05 20:58:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 3.357894736842105) internal successors, (1914), 570 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1914 transitions. [2021-06-05 20:58:31,226 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1914 transitions. Word has length 21 [2021-06-05 20:58:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:31,226 INFO L482 AbstractCegarLoop]: Abstraction has 571 states and 1914 transitions. [2021-06-05 20:58:31,226 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 20:58:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1914 transitions. [2021-06-05 20:58:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:31,227 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:31,227 INFO L554 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 20:58:31,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 20:58:31,227 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 20:58:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:31,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1815810562, now seen corresponding path program 50 times [2021-06-05 20:58:31,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:31,228 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388046462] [2021-06-05 20:58:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:31,296 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 20:58:31,296 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:31,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388046462] [2021-06-05 20:58:31,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388046462] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:31,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:31,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:31,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441180714] [2021-06-05 20:58:31,297 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:31,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:31,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:31,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:31,298 INFO L87 Difference]: Start difference. First operand 571 states and 1914 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 20:58:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:31,350 INFO L93 Difference]: Finished difference Result 1170 states and 3698 transitions. [2021-06-05 20:58:31,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:31,351 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 20:58:31,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:31,353 INFO L225 Difference]: With dead ends: 1170 [2021-06-05 20:58:31,353 INFO L226 Difference]: Without dead ends: 1018 [2021-06-05 20:58:31,353 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-06-05 20:58:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 536. [2021-06-05 20:58:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 3.377570093457944) internal successors, (1807), 535 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1807 transitions. [2021-06-05 20:58:31,367 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1807 transitions. Word has length 21 [2021-06-05 20:58:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:31,367 INFO L482 AbstractCegarLoop]: Abstraction has 536 states and 1807 transitions. [2021-06-05 20:58:31,367 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 20:58:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1807 transitions. [2021-06-05 20:58:31,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:31,369 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:31,369 INFO L554 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 20:58:31,369 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-05 20:58:31,369 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 20:58:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:31,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1227270116, now seen corresponding path program 51 times [2021-06-05 20:58:31,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:31,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147673329] [2021-06-05 20:58:31,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:31,447 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 20:58:31,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:31,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147673329] [2021-06-05 20:58:31,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147673329] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:31,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:31,447 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:31,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958754475] [2021-06-05 20:58:31,448 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:31,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:31,448 INFO L87 Difference]: Start difference. First operand 536 states and 1807 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 20:58:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:31,488 INFO L93 Difference]: Finished difference Result 1127 states and 3565 transitions. [2021-06-05 20:58:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:31,489 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 20:58:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:31,491 INFO L225 Difference]: With dead ends: 1127 [2021-06-05 20:58:31,491 INFO L226 Difference]: Without dead ends: 1024 [2021-06-05 20:58:31,491 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 74.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-06-05 20:58:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 556. [2021-06-05 20:58:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.363963963963964) internal successors, (1867), 555 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1867 transitions. [2021-06-05 20:58:31,516 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1867 transitions. Word has length 21 [2021-06-05 20:58:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:31,516 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1867 transitions. [2021-06-05 20:58:31,516 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 20:58:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1867 transitions. [2021-06-05 20:58:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:31,517 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:31,517 INFO L554 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 20:58:31,517 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 20:58:31,517 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 20:58:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1477762430, now seen corresponding path program 52 times [2021-06-05 20:58:31,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:31,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607452003] [2021-06-05 20:58:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:31,600 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 20:58:31,600 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:31,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607452003] [2021-06-05 20:58:31,600 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607452003] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:31,600 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:31,600 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:31,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023389772] [2021-06-05 20:58:31,601 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:31,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:31,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:31,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:31,601 INFO L87 Difference]: Start difference. First operand 556 states and 1867 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 20:58:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:31,645 INFO L93 Difference]: Finished difference Result 1158 states and 3652 transitions. [2021-06-05 20:58:31,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:31,645 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 20:58:31,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:31,647 INFO L225 Difference]: With dead ends: 1158 [2021-06-05 20:58:31,647 INFO L226 Difference]: Without dead ends: 1004 [2021-06-05 20:58:31,648 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2021-06-05 20:58:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 536. [2021-06-05 20:58:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 3.358878504672897) internal successors, (1797), 535 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1797 transitions. [2021-06-05 20:58:31,662 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1797 transitions. Word has length 21 [2021-06-05 20:58:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:31,663 INFO L482 AbstractCegarLoop]: Abstraction has 536 states and 1797 transitions. [2021-06-05 20:58:31,663 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 20:58:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1797 transitions. [2021-06-05 20:58:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:31,664 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:31,664 INFO L554 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 20:58:31,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 20:58:31,664 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 20:58:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash -146207490, now seen corresponding path program 53 times [2021-06-05 20:58:31,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:31,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329061573] [2021-06-05 20:58:31,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:31,740 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 20:58:31,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:31,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329061573] [2021-06-05 20:58:31,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329061573] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:31,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:31,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:31,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459322708] [2021-06-05 20:58:31,741 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:31,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:31,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:31,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:31,741 INFO L87 Difference]: Start difference. First operand 536 states and 1797 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 20:58:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:31,783 INFO L93 Difference]: Finished difference Result 1102 states and 3477 transitions. [2021-06-05 20:58:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:31,784 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 20:58:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:31,786 INFO L225 Difference]: With dead ends: 1102 [2021-06-05 20:58:31,786 INFO L226 Difference]: Without dead ends: 999 [2021-06-05 20:58:31,786 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2021-06-05 20:58:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 548. [2021-06-05 20:58:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 3.343692870201097) internal successors, (1829), 547 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1829 transitions. [2021-06-05 20:58:31,800 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1829 transitions. Word has length 21 [2021-06-05 20:58:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:31,800 INFO L482 AbstractCegarLoop]: Abstraction has 548 states and 1829 transitions. [2021-06-05 20:58:31,800 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 20:58:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1829 transitions. [2021-06-05 20:58:31,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:31,801 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:31,801 INFO L554 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 20:58:31,801 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-05 20:58:31,801 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 20:58:31,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:31,802 INFO L82 PathProgramCache]: Analyzing trace with hash 862090494, now seen corresponding path program 54 times [2021-06-05 20:58:31,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:31,802 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125261334] [2021-06-05 20:58:31,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:31,879 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 20:58:31,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:31,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125261334] [2021-06-05 20:58:31,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125261334] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:31,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:31,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:31,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304282996] [2021-06-05 20:58:31,880 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:31,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:31,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:31,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:31,881 INFO L87 Difference]: Start difference. First operand 548 states and 1829 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 20:58:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:31,934 INFO L93 Difference]: Finished difference Result 1116 states and 3514 transitions. [2021-06-05 20:58:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:31,934 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 20:58:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:31,936 INFO L225 Difference]: With dead ends: 1116 [2021-06-05 20:58:31,936 INFO L226 Difference]: Without dead ends: 973 [2021-06-05 20:58:31,937 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-06-05 20:58:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 522. [2021-06-05 20:58:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 3.380038387715931) internal successors, (1761), 521 states have internal predecessors, (1761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1761 transitions. [2021-06-05 20:58:31,950 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1761 transitions. Word has length 21 [2021-06-05 20:58:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:31,950 INFO L482 AbstractCegarLoop]: Abstraction has 522 states and 1761 transitions. [2021-06-05 20:58:31,950 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 20:58:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1761 transitions. [2021-06-05 20:58:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:31,951 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:31,951 INFO L554 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 20:58:31,951 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-05 20:58:31,951 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 20:58:31,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1027090720, now seen corresponding path program 55 times [2021-06-05 20:58:31,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:31,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778698477] [2021-06-05 20:58:31,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:32,014 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 20:58:32,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:32,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778698477] [2021-06-05 20:58:32,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778698477] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:32,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:32,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:32,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229475657] [2021-06-05 20:58:32,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:32,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:32,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:32,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:32,017 INFO L87 Difference]: Start difference. First operand 522 states and 1761 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 20:58:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:32,051 INFO L93 Difference]: Finished difference Result 1162 states and 3689 transitions. [2021-06-05 20:58:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:32,051 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 20:58:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:32,053 INFO L225 Difference]: With dead ends: 1162 [2021-06-05 20:58:32,053 INFO L226 Difference]: Without dead ends: 1028 [2021-06-05 20:58:32,054 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-06-05 20:58:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 522. [2021-06-05 20:58:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 3.328214971209213) internal successors, (1734), 521 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1734 transitions. [2021-06-05 20:58:32,067 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1734 transitions. Word has length 21 [2021-06-05 20:58:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:32,067 INFO L482 AbstractCegarLoop]: Abstraction has 522 states and 1734 transitions. [2021-06-05 20:58:32,067 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 20:58:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1734 transitions. [2021-06-05 20:58:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:32,068 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:32,068 INFO L554 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 20:58:32,068 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-05 20:58:32,068 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 20:58:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:32,069 INFO L82 PathProgramCache]: Analyzing trace with hash -723177248, now seen corresponding path program 56 times [2021-06-05 20:58:32,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:32,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59794246] [2021-06-05 20:58:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:58:32,130 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:32,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59794246] [2021-06-05 20:58:32,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59794246] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:32,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:32,130 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:32,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176535614] [2021-06-05 20:58:32,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:32,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:32,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:32,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:32,131 INFO L87 Difference]: Start difference. First operand 522 states and 1734 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 20:58:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:32,182 INFO L93 Difference]: Finished difference Result 1145 states and 3612 transitions. [2021-06-05 20:58:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:32,182 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 20:58:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:32,184 INFO L225 Difference]: With dead ends: 1145 [2021-06-05 20:58:32,184 INFO L226 Difference]: Without dead ends: 993 [2021-06-05 20:58:32,184 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 74.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-06-05 20:58:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 487. [2021-06-05 20:58:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 3.3415637860082303) internal successors, (1624), 486 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1624 transitions. [2021-06-05 20:58:32,196 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1624 transitions. Word has length 21 [2021-06-05 20:58:32,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:32,197 INFO L482 AbstractCegarLoop]: Abstraction has 487 states and 1624 transitions. [2021-06-05 20:58:32,197 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 20:58:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1624 transitions. [2021-06-05 20:58:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:32,198 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:32,198 INFO L554 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 20:58:32,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-05 20:58:32,198 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 20:58:32,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:32,198 INFO L82 PathProgramCache]: Analyzing trace with hash -259594400, now seen corresponding path program 57 times [2021-06-05 20:58:32,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:32,198 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614584342] [2021-06-05 20:58:32,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:32,258 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 20:58:32,258 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:32,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614584342] [2021-06-05 20:58:32,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614584342] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:32,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:32,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:32,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270212282] [2021-06-05 20:58:32,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:32,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:32,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:32,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:32,259 INFO L87 Difference]: Start difference. First operand 487 states and 1624 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 20:58:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:32,295 INFO L93 Difference]: Finished difference Result 1096 states and 3469 transitions. [2021-06-05 20:58:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:32,296 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 20:58:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:32,298 INFO L225 Difference]: With dead ends: 1096 [2021-06-05 20:58:32,298 INFO L226 Difference]: Without dead ends: 962 [2021-06-05 20:58:32,298 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 60.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-06-05 20:58:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 513. [2021-06-05 20:58:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 3.310546875) internal successors, (1695), 512 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1695 transitions. [2021-06-05 20:58:32,310 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1695 transitions. Word has length 21 [2021-06-05 20:58:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:32,310 INFO L482 AbstractCegarLoop]: Abstraction has 513 states and 1695 transitions. [2021-06-05 20:58:32,310 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 20:58:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1695 transitions. [2021-06-05 20:58:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:32,311 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:32,311 INFO L554 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 20:58:32,311 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-05 20:58:32,312 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 20:58:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1004689982, now seen corresponding path program 58 times [2021-06-05 20:58:32,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:32,312 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300798396] [2021-06-05 20:58:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:32,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 20:58:32,371 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:32,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300798396] [2021-06-05 20:58:32,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300798396] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:32,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:32,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:32,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642659870] [2021-06-05 20:58:32,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:32,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:32,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:32,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:32,372 INFO L87 Difference]: Start difference. First operand 513 states and 1695 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 20:58:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:32,421 INFO L93 Difference]: Finished difference Result 997 states and 3171 transitions. [2021-06-05 20:58:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:32,421 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 20:58:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:32,423 INFO L225 Difference]: With dead ends: 997 [2021-06-05 20:58:32,423 INFO L226 Difference]: Without dead ends: 856 [2021-06-05 20:58:32,423 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 69.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2021-06-05 20:58:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 487. [2021-06-05 20:58:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 3.314814814814815) internal successors, (1611), 486 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1611 transitions. [2021-06-05 20:58:32,435 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1611 transitions. Word has length 21 [2021-06-05 20:58:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:32,435 INFO L482 AbstractCegarLoop]: Abstraction has 487 states and 1611 transitions. [2021-06-05 20:58:32,435 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 20:58:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1611 transitions. [2021-06-05 20:58:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:32,436 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:32,436 INFO L554 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 20:58:32,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-05 20:58:32,436 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 20:58:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash -2107940354, now seen corresponding path program 59 times [2021-06-05 20:58:32,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:32,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357674604] [2021-06-05 20:58:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:32,521 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 20:58:32,521 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:32,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357674604] [2021-06-05 20:58:32,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357674604] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:32,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:32,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:32,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615352627] [2021-06-05 20:58:32,522 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:32,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:32,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:32,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:32,522 INFO L87 Difference]: Start difference. First operand 487 states and 1611 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 20:58:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:32,590 INFO L93 Difference]: Finished difference Result 1071 states and 3378 transitions. [2021-06-05 20:58:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:32,590 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 20:58:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:32,592 INFO L225 Difference]: With dead ends: 1071 [2021-06-05 20:58:32,592 INFO L226 Difference]: Without dead ends: 954 [2021-06-05 20:58:32,592 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 91.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2021-06-05 20:58:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 505. [2021-06-05 20:58:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.2976190476190474) internal successors, (1662), 504 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1662 transitions. [2021-06-05 20:58:32,607 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1662 transitions. Word has length 21 [2021-06-05 20:58:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:32,607 INFO L482 AbstractCegarLoop]: Abstraction has 505 states and 1662 transitions. [2021-06-05 20:58:32,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 20:58:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1662 transitions. [2021-06-05 20:58:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:32,608 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:32,608 INFO L554 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 20:58:32,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-06-05 20:58:32,608 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 20:58:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:32,609 INFO L82 PathProgramCache]: Analyzing trace with hash 597092192, now seen corresponding path program 60 times [2021-06-05 20:58:32,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:32,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791648404] [2021-06-05 20:58:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:32,676 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 20:58:32,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:32,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791648404] [2021-06-05 20:58:32,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791648404] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:32,677 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:32,677 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:32,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680210441] [2021-06-05 20:58:32,677 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:32,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:32,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:32,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:32,678 INFO L87 Difference]: Start difference. First operand 505 states and 1662 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 20:58:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:32,732 INFO L93 Difference]: Finished difference Result 989 states and 3138 transitions. [2021-06-05 20:58:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:32,732 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 20:58:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:32,734 INFO L225 Difference]: With dead ends: 989 [2021-06-05 20:58:32,734 INFO L226 Difference]: Without dead ends: 835 [2021-06-05 20:58:32,734 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2021-06-05 20:58:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 466. [2021-06-05 20:58:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.3483870967741933) internal successors, (1557), 465 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1557 transitions. [2021-06-05 20:58:32,746 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1557 transitions. Word has length 21 [2021-06-05 20:58:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:32,747 INFO L482 AbstractCegarLoop]: Abstraction has 466 states and 1557 transitions. [2021-06-05 20:58:32,747 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 20:58:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1557 transitions. [2021-06-05 20:58:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:32,748 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:32,748 INFO L554 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 20:58:32,748 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-06-05 20:58:32,748 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 20:58:32,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:32,749 INFO L82 PathProgramCache]: Analyzing trace with hash 193554622, now seen corresponding path program 61 times [2021-06-05 20:58:32,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:32,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283133272] [2021-06-05 20:58:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:32,825 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 20:58:32,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:32,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283133272] [2021-06-05 20:58:32,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283133272] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:32,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:32,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:32,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700433568] [2021-06-05 20:58:32,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:32,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:32,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:32,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:32,829 INFO L87 Difference]: Start difference. First operand 466 states and 1557 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 20:58:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:32,875 INFO L93 Difference]: Finished difference Result 1016 states and 3201 transitions. [2021-06-05 20:58:32,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:32,875 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 20:58:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:32,877 INFO L225 Difference]: With dead ends: 1016 [2021-06-05 20:58:32,877 INFO L226 Difference]: Without dead ends: 913 [2021-06-05 20:58:32,878 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:32,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2021-06-05 20:58:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 496. [2021-06-05 20:58:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 3.3494949494949493) internal successors, (1658), 495 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1658 transitions. [2021-06-05 20:58:32,892 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1658 transitions. Word has length 21 [2021-06-05 20:58:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:32,892 INFO L482 AbstractCegarLoop]: Abstraction has 496 states and 1658 transitions. [2021-06-05 20:58:32,892 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 20:58:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1658 transitions. [2021-06-05 20:58:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:32,893 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:32,894 INFO L554 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 20:58:32,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-06-05 20:58:32,894 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 20:58:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:32,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1396380128, now seen corresponding path program 62 times [2021-06-05 20:58:32,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:32,894 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300759167] [2021-06-05 20:58:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:32,969 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 20:58:32,970 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:32,970 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300759167] [2021-06-05 20:58:32,970 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300759167] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:32,970 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:32,970 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:32,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775255568] [2021-06-05 20:58:32,970 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:32,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:32,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:32,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:32,971 INFO L87 Difference]: Start difference. First operand 496 states and 1658 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 20:58:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:33,013 INFO L93 Difference]: Finished difference Result 1047 states and 3288 transitions. [2021-06-05 20:58:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:33,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 20:58:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:33,016 INFO L225 Difference]: With dead ends: 1047 [2021-06-05 20:58:33,016 INFO L226 Difference]: Without dead ends: 893 [2021-06-05 20:58:33,016 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2021-06-05 20:58:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 476. [2021-06-05 20:58:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 3.343157894736842) internal successors, (1588), 475 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1588 transitions. [2021-06-05 20:58:33,027 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1588 transitions. Word has length 21 [2021-06-05 20:58:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:33,028 INFO L482 AbstractCegarLoop]: Abstraction has 476 states and 1588 transitions. [2021-06-05 20:58:33,028 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 20:58:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1588 transitions. [2021-06-05 20:58:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:33,029 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:33,029 INFO L554 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 20:58:33,029 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-06-05 20:58:33,029 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 20:58:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:33,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1494691650, now seen corresponding path program 63 times [2021-06-05 20:58:33,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:33,029 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622707687] [2021-06-05 20:58:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:33,098 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 20:58:33,098 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:33,098 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622707687] [2021-06-05 20:58:33,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622707687] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:33,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:33,099 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:33,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492714938] [2021-06-05 20:58:33,099 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:33,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:33,099 INFO L87 Difference]: Start difference. First operand 476 states and 1588 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 20:58:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:33,142 INFO L93 Difference]: Finished difference Result 1020 states and 3207 transitions. [2021-06-05 20:58:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:33,142 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 20:58:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:33,144 INFO L225 Difference]: With dead ends: 1020 [2021-06-05 20:58:33,144 INFO L226 Difference]: Without dead ends: 917 [2021-06-05 20:58:33,144 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-06-05 20:58:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 488. [2021-06-05 20:58:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 3.326488706365503) internal successors, (1620), 487 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1620 transitions. [2021-06-05 20:58:33,157 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1620 transitions. Word has length 21 [2021-06-05 20:58:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:33,157 INFO L482 AbstractCegarLoop]: Abstraction has 488 states and 1620 transitions. [2021-06-05 20:58:33,157 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 20:58:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1620 transitions. [2021-06-05 20:58:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:33,158 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:33,158 INFO L554 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 20:58:33,158 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-06-05 20:58:33,158 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 20:58:33,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:33,158 INFO L82 PathProgramCache]: Analyzing trace with hash 185804990, now seen corresponding path program 64 times [2021-06-05 20:58:33,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:33,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589128001] [2021-06-05 20:58:33,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:33,225 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 20:58:33,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:33,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589128001] [2021-06-05 20:58:33,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589128001] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:33,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:33,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:33,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313913017] [2021-06-05 20:58:33,226 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:33,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:33,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:33,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:33,227 INFO L87 Difference]: Start difference. First operand 488 states and 1620 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 20:58:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:33,281 INFO L93 Difference]: Finished difference Result 952 states and 3022 transitions. [2021-06-05 20:58:33,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:33,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 20:58:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:33,283 INFO L225 Difference]: With dead ends: 952 [2021-06-05 20:58:33,283 INFO L226 Difference]: Without dead ends: 825 [2021-06-05 20:58:33,283 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 79.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:33,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-06-05 20:58:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 476. [2021-06-05 20:58:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 3.3305263157894736) internal successors, (1582), 475 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1582 transitions. [2021-06-05 20:58:33,291 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1582 transitions. Word has length 21 [2021-06-05 20:58:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:33,292 INFO L482 AbstractCegarLoop]: Abstraction has 476 states and 1582 transitions. [2021-06-05 20:58:33,292 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 20:58:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1582 transitions. [2021-06-05 20:58:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:33,292 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:33,292 INFO L554 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 20:58:33,293 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-06-05 20:58:33,293 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 20:58:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:33,293 INFO L82 PathProgramCache]: Analyzing trace with hash -77529696, now seen corresponding path program 65 times [2021-06-05 20:58:33,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:33,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626214190] [2021-06-05 20:58:33,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:33,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 20:58:33,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:33,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626214190] [2021-06-05 20:58:33,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626214190] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:33,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:33,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:33,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791606643] [2021-06-05 20:58:33,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:33,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:33,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:33,360 INFO L87 Difference]: Start difference. First operand 476 states and 1582 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 20:58:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:33,398 INFO L93 Difference]: Finished difference Result 984 states and 3081 transitions. [2021-06-05 20:58:33,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:33,398 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 20:58:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:33,400 INFO L225 Difference]: With dead ends: 984 [2021-06-05 20:58:33,400 INFO L226 Difference]: Without dead ends: 850 [2021-06-05 20:58:33,400 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2021-06-05 20:58:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 502. [2021-06-05 20:58:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.2994011976047903) internal successors, (1653), 501 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1653 transitions. [2021-06-05 20:58:33,412 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1653 transitions. Word has length 21 [2021-06-05 20:58:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:33,412 INFO L482 AbstractCegarLoop]: Abstraction has 502 states and 1653 transitions. [2021-06-05 20:58:33,412 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 20:58:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1653 transitions. [2021-06-05 20:58:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:33,413 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:33,413 INFO L554 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 20:58:33,414 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-06-05 20:58:33,414 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 20:58:33,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:33,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1469674242, now seen corresponding path program 66 times [2021-06-05 20:58:33,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:33,414 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741218238] [2021-06-05 20:58:33,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:33,485 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 20:58:33,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:33,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741218238] [2021-06-05 20:58:33,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741218238] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:33,486 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:33,486 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:33,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216486978] [2021-06-05 20:58:33,486 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:33,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:33,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:33,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:33,486 INFO L87 Difference]: Start difference. First operand 502 states and 1653 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 20:58:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:33,539 INFO L93 Difference]: Finished difference Result 885 states and 2783 transitions. [2021-06-05 20:58:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:33,539 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 20:58:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:33,541 INFO L225 Difference]: With dead ends: 885 [2021-06-05 20:58:33,541 INFO L226 Difference]: Without dead ends: 734 [2021-06-05 20:58:33,541 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-06-05 20:58:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 466. [2021-06-05 20:58:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.3376344086021503) internal successors, (1552), 465 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1552 transitions. [2021-06-05 20:58:33,555 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1552 transitions. Word has length 21 [2021-06-05 20:58:33,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:33,555 INFO L482 AbstractCegarLoop]: Abstraction has 466 states and 1552 transitions. [2021-06-05 20:58:33,555 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 20:58:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1552 transitions. [2021-06-05 20:58:33,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:33,556 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:33,556 INFO L554 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 20:58:33,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-06-05 20:58:33,556 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 20:58:33,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:33,557 INFO L82 PathProgramCache]: Analyzing trace with hash 581559584, now seen corresponding path program 67 times [2021-06-05 20:58:33,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:33,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975529430] [2021-06-05 20:58:33,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:33,638 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 20:58:33,639 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:33,639 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975529430] [2021-06-05 20:58:33,639 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975529430] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:33,639 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:33,639 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:33,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175412323] [2021-06-05 20:58:33,639 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:33,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:33,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:33,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:33,640 INFO L87 Difference]: Start difference. First operand 466 states and 1552 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 20:58:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:33,692 INFO L93 Difference]: Finished difference Result 979 states and 3074 transitions. [2021-06-05 20:58:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:33,693 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 20:58:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:33,695 INFO L225 Difference]: With dead ends: 979 [2021-06-05 20:58:33,695 INFO L226 Difference]: Without dead ends: 876 [2021-06-05 20:58:33,695 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-06-05 20:58:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 484. [2021-06-05 20:58:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 3.331262939958592) internal successors, (1609), 483 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1609 transitions. [2021-06-05 20:58:33,707 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1609 transitions. Word has length 21 [2021-06-05 20:58:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:33,707 INFO L482 AbstractCegarLoop]: Abstraction has 484 states and 1609 transitions. [2021-06-05 20:58:33,707 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 20:58:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1609 transitions. [2021-06-05 20:58:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:33,710 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:33,710 INFO L554 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 20:58:33,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-06-05 20:58:33,710 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 20:58:33,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:33,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1589857568, now seen corresponding path program 68 times [2021-06-05 20:58:33,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:33,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81638733] [2021-06-05 20:58:33,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:33,782 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 20:58:33,782 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:33,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81638733] [2021-06-05 20:58:33,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81638733] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:33,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:33,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:33,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458814334] [2021-06-05 20:58:33,783 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:33,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:33,783 INFO L87 Difference]: Start difference. First operand 484 states and 1609 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 20:58:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:33,843 INFO L93 Difference]: Finished difference Result 993 states and 3111 transitions. [2021-06-05 20:58:33,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:33,843 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 20:58:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:33,845 INFO L225 Difference]: With dead ends: 993 [2021-06-05 20:58:33,845 INFO L226 Difference]: Without dead ends: 864 [2021-06-05 20:58:33,845 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 92.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2021-06-05 20:58:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 472. [2021-06-05 20:58:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.335456475583864) internal successors, (1571), 471 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1571 transitions. [2021-06-05 20:58:33,857 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1571 transitions. Word has length 21 [2021-06-05 20:58:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:33,857 INFO L482 AbstractCegarLoop]: Abstraction has 472 states and 1571 transitions. [2021-06-05 20:58:33,857 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 20:58:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1571 transitions. [2021-06-05 20:58:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:33,858 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:33,858 INFO L554 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 20:58:33,858 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-06-05 20:58:33,858 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 20:58:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash -265237378, now seen corresponding path program 69 times [2021-06-05 20:58:33,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:33,859 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797030221] [2021-06-05 20:58:33,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:33,937 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 20:58:33,937 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:33,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797030221] [2021-06-05 20:58:33,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797030221] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:33,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:33,937 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:33,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451501926] [2021-06-05 20:58:33,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:33,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:33,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:33,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:33,938 INFO L87 Difference]: Start difference. First operand 472 states and 1571 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 20:58:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:33,980 INFO L93 Difference]: Finished difference Result 991 states and 3112 transitions. [2021-06-05 20:58:33,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:33,981 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 20:58:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:33,982 INFO L225 Difference]: With dead ends: 991 [2021-06-05 20:58:33,983 INFO L226 Difference]: Without dead ends: 888 [2021-06-05 20:58:33,983 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2021-06-05 20:58:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 484. [2021-06-05 20:58:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 3.318840579710145) internal successors, (1603), 483 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1603 transitions. [2021-06-05 20:58:33,995 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1603 transitions. Word has length 21 [2021-06-05 20:58:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:33,995 INFO L482 AbstractCegarLoop]: Abstraction has 484 states and 1603 transitions. [2021-06-05 20:58:33,995 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 20:58:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1603 transitions. [2021-06-05 20:58:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:33,996 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:33,996 INFO L554 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 20:58:33,996 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-06-05 20:58:33,996 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 20:58:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:33,996 INFO L82 PathProgramCache]: Analyzing trace with hash -295097056, now seen corresponding path program 70 times [2021-06-05 20:58:33,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:33,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382348299] [2021-06-05 20:58:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:34,058 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 20:58:34,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:34,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382348299] [2021-06-05 20:58:34,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382348299] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:34,058 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:34,058 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:34,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430345833] [2021-06-05 20:58:34,059 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:34,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:34,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:34,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:34,059 INFO L87 Difference]: Start difference. First operand 484 states and 1603 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 20:58:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:34,113 INFO L93 Difference]: Finished difference Result 923 states and 2927 transitions. [2021-06-05 20:58:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:34,114 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 20:58:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:34,115 INFO L225 Difference]: With dead ends: 923 [2021-06-05 20:58:34,115 INFO L226 Difference]: Without dead ends: 796 [2021-06-05 20:58:34,116 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2021-06-05 20:58:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 472. [2021-06-05 20:58:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.3227176220806793) internal successors, (1565), 471 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 20:58:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1565 transitions. [2021-06-05 20:58:34,127 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1565 transitions. Word has length 21 [2021-06-05 20:58:34,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:34,127 INFO L482 AbstractCegarLoop]: Abstraction has 472 states and 1565 transitions. [2021-06-05 20:58:34,127 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 20:58:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1565 transitions. [2021-06-05 20:58:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:34,128 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:34,128 INFO L554 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 20:58:34,128 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-06-05 20:58:34,128 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 20:58:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1639425312, now seen corresponding path program 71 times [2021-06-05 20:58:34,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:34,129 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438883541] [2021-06-05 20:58:34,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:34,191 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 20:58:34,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:34,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438883541] [2021-06-05 20:58:34,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438883541] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:34,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:34,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:34,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313408847] [2021-06-05 20:58:34,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:34,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:34,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:34,193 INFO L87 Difference]: Start difference. First operand 472 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 20:58:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:34,253 INFO L93 Difference]: Finished difference Result 955 states and 2986 transitions. [2021-06-05 20:58:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:34,253 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 20:58:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:34,255 INFO L225 Difference]: With dead ends: 955 [2021-06-05 20:58:34,255 INFO L226 Difference]: Without dead ends: 838 [2021-06-05 20:58:34,255 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 83.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-06-05 20:58:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 490. [2021-06-05 20:58:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.3047034764826178) internal successors, (1616), 489 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1616 transitions. [2021-06-05 20:58:34,267 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1616 transitions. Word has length 21 [2021-06-05 20:58:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:34,267 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 1616 transitions. [2021-06-05 20:58:34,267 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 20:58:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1616 transitions. [2021-06-05 20:58:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:34,268 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:34,268 INFO L554 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 20:58:34,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-06-05 20:58:34,268 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 20:58:34,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash -403911682, now seen corresponding path program 72 times [2021-06-05 20:58:34,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:34,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753774432] [2021-06-05 20:58:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:34,336 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 20:58:34,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:34,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753774432] [2021-06-05 20:58:34,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753774432] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:34,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:34,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:34,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063087723] [2021-06-05 20:58:34,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:34,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:34,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:34,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:34,337 INFO L87 Difference]: Start difference. First operand 490 states and 1616 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 20:58:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:34,396 INFO L93 Difference]: Finished difference Result 873 states and 2746 transitions. [2021-06-05 20:58:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:34,396 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 20:58:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:34,398 INFO L225 Difference]: With dead ends: 873 [2021-06-05 20:58:34,398 INFO L226 Difference]: Without dead ends: 725 [2021-06-05 20:58:34,398 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-06-05 20:58:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 457. [2021-06-05 20:58:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.3640350877192984) internal successors, (1534), 456 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1534 transitions. [2021-06-05 20:58:34,409 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1534 transitions. Word has length 21 [2021-06-05 20:58:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:34,409 INFO L482 AbstractCegarLoop]: Abstraction has 457 states and 1534 transitions. [2021-06-05 20:58:34,409 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 20:58:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1534 transitions. [2021-06-05 20:58:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:34,410 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:34,410 INFO L554 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 20:58:34,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-06-05 20:58:34,410 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 20:58:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1845007066, now seen corresponding path program 73 times [2021-06-05 20:58:34,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:34,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739867063] [2021-06-05 20:58:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:34,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 20:58:34,481 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:34,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739867063] [2021-06-05 20:58:34,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739867063] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:34,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:34,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:34,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885981053] [2021-06-05 20:58:34,481 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:34,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:34,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:34,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:34,482 INFO L87 Difference]: Start difference. First operand 457 states and 1534 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 20:58:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:34,539 INFO L93 Difference]: Finished difference Result 912 states and 2837 transitions. [2021-06-05 20:58:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:34,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 20:58:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:34,541 INFO L225 Difference]: With dead ends: 912 [2021-06-05 20:58:34,541 INFO L226 Difference]: Without dead ends: 809 [2021-06-05 20:58:34,541 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-06-05 20:58:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 465. [2021-06-05 20:58:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 3.3491379310344827) internal successors, (1554), 464 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1554 transitions. [2021-06-05 20:58:34,552 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1554 transitions. Word has length 21 [2021-06-05 20:58:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:34,552 INFO L482 AbstractCegarLoop]: Abstraction has 465 states and 1554 transitions. [2021-06-05 20:58:34,552 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 20:58:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1554 transitions. [2021-06-05 20:58:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:34,553 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:34,553 INFO L554 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 20:58:34,553 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-06-05 20:58:34,553 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 20:58:34,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:34,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2093116196, now seen corresponding path program 74 times [2021-06-05 20:58:34,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:34,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172267940] [2021-06-05 20:58:34,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:34,627 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 20:58:34,628 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:34,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172267940] [2021-06-05 20:58:34,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172267940] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:34,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:34,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:34,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834439813] [2021-06-05 20:58:34,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:34,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:34,629 INFO L87 Difference]: Start difference. First operand 465 states and 1554 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 20:58:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:34,669 INFO L93 Difference]: Finished difference Result 912 states and 2829 transitions. [2021-06-05 20:58:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:34,670 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 20:58:34,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:34,671 INFO L225 Difference]: With dead ends: 912 [2021-06-05 20:58:34,671 INFO L226 Difference]: Without dead ends: 801 [2021-06-05 20:58:34,672 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:34,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-06-05 20:58:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 457. [2021-06-05 20:58:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.3552631578947367) internal successors, (1530), 456 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1530 transitions. [2021-06-05 20:58:34,682 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1530 transitions. Word has length 21 [2021-06-05 20:58:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:34,683 INFO L482 AbstractCegarLoop]: Abstraction has 457 states and 1530 transitions. [2021-06-05 20:58:34,683 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 20:58:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1530 transitions. [2021-06-05 20:58:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:34,684 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:34,684 INFO L554 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 20:58:34,684 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-06-05 20:58:34,684 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 20:58:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash -198329928, now seen corresponding path program 75 times [2021-06-05 20:58:34,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:34,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503426510] [2021-06-05 20:58:34,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:34,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 20:58:34,762 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:34,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503426510] [2021-06-05 20:58:34,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503426510] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:34,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:34,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:34,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362397225] [2021-06-05 20:58:34,763 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:34,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:34,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:34,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:34,763 INFO L87 Difference]: Start difference. First operand 457 states and 1530 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 20:58:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:34,827 INFO L93 Difference]: Finished difference Result 955 states and 2976 transitions. [2021-06-05 20:58:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:34,828 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 20:58:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:34,829 INFO L225 Difference]: With dead ends: 955 [2021-06-05 20:58:34,830 INFO L226 Difference]: Without dead ends: 852 [2021-06-05 20:58:34,830 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 94.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-06-05 20:58:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 477. [2021-06-05 20:58:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.3403361344537816) internal successors, (1590), 476 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1590 transitions. [2021-06-05 20:58:34,842 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1590 transitions. Word has length 21 [2021-06-05 20:58:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:34,842 INFO L482 AbstractCegarLoop]: Abstraction has 477 states and 1590 transitions. [2021-06-05 20:58:34,843 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 20:58:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1590 transitions. [2021-06-05 20:58:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:34,846 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:34,847 INFO L554 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 20:58:34,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-06-05 20:58:34,847 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 20:58:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1057334118, now seen corresponding path program 76 times [2021-06-05 20:58:34,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:34,847 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616217317] [2021-06-05 20:58:34,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:34,933 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 20:58:34,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:34,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616217317] [2021-06-05 20:58:34,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616217317] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:34,933 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:34,933 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:34,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793891421] [2021-06-05 20:58:34,934 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:34,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:34,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:34,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:34,934 INFO L87 Difference]: Start difference. First operand 477 states and 1590 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 20:58:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:34,979 INFO L93 Difference]: Finished difference Result 986 states and 3063 transitions. [2021-06-05 20:58:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:34,979 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 20:58:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:34,981 INFO L225 Difference]: With dead ends: 986 [2021-06-05 20:58:34,981 INFO L226 Difference]: Without dead ends: 832 [2021-06-05 20:58:34,981 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 88.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-06-05 20:58:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 457. [2021-06-05 20:58:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.337719298245614) internal successors, (1522), 456 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1522 transitions. [2021-06-05 20:58:34,994 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1522 transitions. Word has length 21 [2021-06-05 20:58:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:34,994 INFO L482 AbstractCegarLoop]: Abstraction has 457 states and 1522 transitions. [2021-06-05 20:58:34,994 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 20:58:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1522 transitions. [2021-06-05 20:58:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:34,995 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:34,995 INFO L554 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 20:58:34,995 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-06-05 20:58:34,995 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 20:58:34,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:34,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1739976706, now seen corresponding path program 77 times [2021-06-05 20:58:34,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:34,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740924513] [2021-06-05 20:58:34,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:35,082 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 20:58:35,083 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:35,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740924513] [2021-06-05 20:58:35,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740924513] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:35,083 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:35,083 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:35,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826926574] [2021-06-05 20:58:35,083 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:35,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:35,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:35,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:35,084 INFO L87 Difference]: Start difference. First operand 457 states and 1522 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 20:58:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:35,121 INFO L93 Difference]: Finished difference Result 955 states and 2968 transitions. [2021-06-05 20:58:35,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:35,122 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 20:58:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:35,123 INFO L225 Difference]: With dead ends: 955 [2021-06-05 20:58:35,123 INFO L226 Difference]: Without dead ends: 852 [2021-06-05 20:58:35,124 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 88.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-06-05 20:58:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 477. [2021-06-05 20:58:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.323529411764706) internal successors, (1582), 476 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1582 transitions. [2021-06-05 20:58:35,135 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1582 transitions. Word has length 21 [2021-06-05 20:58:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:35,136 INFO L482 AbstractCegarLoop]: Abstraction has 477 states and 1582 transitions. [2021-06-05 20:58:35,136 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 20:58:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1582 transitions. [2021-06-05 20:58:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:35,137 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:35,137 INFO L554 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 20:58:35,137 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-06-05 20:58:35,137 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 20:58:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash 150041956, now seen corresponding path program 78 times [2021-06-05 20:58:35,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:35,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2681590] [2021-06-05 20:58:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:35,245 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 20:58:35,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:35,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2681590] [2021-06-05 20:58:35,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2681590] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:35,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:35,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:35,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52298343] [2021-06-05 20:58:35,246 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:35,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:35,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:35,248 INFO L87 Difference]: Start difference. First operand 477 states and 1582 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 20:58:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:35,288 INFO L93 Difference]: Finished difference Result 986 states and 3055 transitions. [2021-06-05 20:58:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:35,288 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 20:58:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:35,290 INFO L225 Difference]: With dead ends: 986 [2021-06-05 20:58:35,290 INFO L226 Difference]: Without dead ends: 824 [2021-06-05 20:58:35,290 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:35,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-06-05 20:58:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 449. [2021-06-05 20:58:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.34375) internal successors, (1498), 448 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1498 transitions. [2021-06-05 20:58:35,302 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1498 transitions. Word has length 21 [2021-06-05 20:58:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:35,302 INFO L482 AbstractCegarLoop]: Abstraction has 449 states and 1498 transitions. [2021-06-05 20:58:35,302 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 20:58:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1498 transitions. [2021-06-05 20:58:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:35,303 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:35,303 INFO L554 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 20:58:35,303 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-06-05 20:58:35,303 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 20:58:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1048980186, now seen corresponding path program 79 times [2021-06-05 20:58:35,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:35,304 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217624731] [2021-06-05 20:58:35,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:35,366 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 20:58:35,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:35,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217624731] [2021-06-05 20:58:35,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217624731] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:35,366 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:35,366 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:35,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595743568] [2021-06-05 20:58:35,367 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:35,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:35,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:35,367 INFO L87 Difference]: Start difference. First operand 449 states and 1498 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 20:58:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:35,422 INFO L93 Difference]: Finished difference Result 960 states and 2997 transitions. [2021-06-05 20:58:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:35,422 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 20:58:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:35,424 INFO L225 Difference]: With dead ends: 960 [2021-06-05 20:58:35,424 INFO L226 Difference]: Without dead ends: 857 [2021-06-05 20:58:35,424 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2021-06-05 20:58:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 461. [2021-06-05 20:58:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 3.3347826086956522) internal successors, (1534), 460 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1534 transitions. [2021-06-05 20:58:35,436 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1534 transitions. Word has length 21 [2021-06-05 20:58:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:35,436 INFO L482 AbstractCegarLoop]: Abstraction has 461 states and 1534 transitions. [2021-06-05 20:58:35,436 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 20:58:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1534 transitions. [2021-06-05 20:58:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:35,437 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:35,437 INFO L554 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 20:58:35,437 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-06-05 20:58:35,438 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 20:58:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1297089316, now seen corresponding path program 80 times [2021-06-05 20:58:35,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:35,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619219098] [2021-06-05 20:58:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:35,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 20:58:35,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:35,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619219098] [2021-06-05 20:58:35,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619219098] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:35,506 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:35,506 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:35,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245737565] [2021-06-05 20:58:35,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:35,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:35,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:35,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:35,506 INFO L87 Difference]: Start difference. First operand 461 states and 1534 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 20:58:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:35,547 INFO L93 Difference]: Finished difference Result 960 states and 2989 transitions. [2021-06-05 20:58:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:35,547 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 20:58:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:35,549 INFO L225 Difference]: With dead ends: 960 [2021-06-05 20:58:35,549 INFO L226 Difference]: Without dead ends: 849 [2021-06-05 20:58:35,549 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2021-06-05 20:58:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 453. [2021-06-05 20:58:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.34070796460177) internal successors, (1510), 452 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1510 transitions. [2021-06-05 20:58:35,560 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1510 transitions. Word has length 21 [2021-06-05 20:58:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:35,560 INFO L482 AbstractCegarLoop]: Abstraction has 453 states and 1510 transitions. [2021-06-05 20:58:35,560 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 20:58:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1510 transitions. [2021-06-05 20:58:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:35,561 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:35,561 INFO L554 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 20:58:35,561 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-06-05 20:58:35,561 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 20:58:35,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1604768474, now seen corresponding path program 81 times [2021-06-05 20:58:35,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:35,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432200410] [2021-06-05 20:58:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:35,626 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 20:58:35,626 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:35,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432200410] [2021-06-05 20:58:35,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432200410] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:35,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:35,627 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:35,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764223424] [2021-06-05 20:58:35,627 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:35,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:35,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:35,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:35,627 INFO L87 Difference]: Start difference. First operand 453 states and 1510 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 20:58:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:35,679 INFO L93 Difference]: Finished difference Result 952 states and 2977 transitions. [2021-06-05 20:58:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:35,680 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 20:58:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:35,681 INFO L225 Difference]: With dead ends: 952 [2021-06-05 20:58:35,682 INFO L226 Difference]: Without dead ends: 849 [2021-06-05 20:58:35,682 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2021-06-05 20:58:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 465. [2021-06-05 20:58:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 3.3232758620689653) internal successors, (1542), 464 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1542 transitions. [2021-06-05 20:58:35,694 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1542 transitions. Word has length 21 [2021-06-05 20:58:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:35,694 INFO L482 AbstractCegarLoop]: Abstraction has 465 states and 1542 transitions. [2021-06-05 20:58:35,694 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 20:58:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1542 transitions. [2021-06-05 20:58:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:35,695 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:35,695 INFO L554 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 20:58:35,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-06-05 20:58:35,696 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 20:58:35,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:35,696 INFO L82 PathProgramCache]: Analyzing trace with hash -569482052, now seen corresponding path program 82 times [2021-06-05 20:58:35,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:35,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28779301] [2021-06-05 20:58:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:35,761 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 20:58:35,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:35,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28779301] [2021-06-05 20:58:35,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28779301] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:35,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:35,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:35,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584363787] [2021-06-05 20:58:35,762 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:35,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:35,762 INFO L87 Difference]: Start difference. First operand 465 states and 1542 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 20:58:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:35,810 INFO L93 Difference]: Finished difference Result 884 states and 2792 transitions. [2021-06-05 20:58:35,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:35,810 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 20:58:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:35,811 INFO L225 Difference]: With dead ends: 884 [2021-06-05 20:58:35,812 INFO L226 Difference]: Without dead ends: 757 [2021-06-05 20:58:35,812 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2021-06-05 20:58:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 453. [2021-06-05 20:58:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.331858407079646) internal successors, (1506), 452 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1506 transitions. [2021-06-05 20:58:35,825 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1506 transitions. Word has length 21 [2021-06-05 20:58:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:35,825 INFO L482 AbstractCegarLoop]: Abstraction has 453 states and 1506 transitions. [2021-06-05 20:58:35,825 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 20:58:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1506 transitions. [2021-06-05 20:58:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:35,826 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:35,826 INFO L554 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 20:58:35,826 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-06-05 20:58:35,826 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 20:58:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash -751892188, now seen corresponding path program 83 times [2021-06-05 20:58:35,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:35,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54296824] [2021-06-05 20:58:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:35,886 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 20:58:35,886 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:35,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54296824] [2021-06-05 20:58:35,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54296824] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:35,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:35,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:35,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126360270] [2021-06-05 20:58:35,887 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:35,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:35,887 INFO L87 Difference]: Start difference. First operand 453 states and 1506 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 20:58:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:35,927 INFO L93 Difference]: Finished difference Result 952 states and 2973 transitions. [2021-06-05 20:58:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:35,927 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 20:58:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:35,929 INFO L225 Difference]: With dead ends: 952 [2021-06-05 20:58:35,929 INFO L226 Difference]: Without dead ends: 849 [2021-06-05 20:58:35,929 INFO L810 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 20:58:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2021-06-05 20:58:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 465. [2021-06-05 20:58:35,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 3.314655172413793) internal successors, (1538), 464 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1538 transitions. [2021-06-05 20:58:35,940 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1538 transitions. Word has length 21 [2021-06-05 20:58:35,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:35,940 INFO L482 AbstractCegarLoop]: Abstraction has 465 states and 1538 transitions. [2021-06-05 20:58:35,940 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 20:58:35,940 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1538 transitions. [2021-06-05 20:58:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:35,941 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:35,941 INFO L554 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 20:58:35,941 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-06-05 20:58:35,942 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 20:58:35,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:35,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1995152774, now seen corresponding path program 84 times [2021-06-05 20:58:35,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:35,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855631068] [2021-06-05 20:58:35,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:36,000 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 20:58:36,001 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:36,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855631068] [2021-06-05 20:58:36,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855631068] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:36,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:36,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:36,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691106866] [2021-06-05 20:58:36,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:36,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:36,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:36,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:36,002 INFO L87 Difference]: Start difference. First operand 465 states and 1538 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 20:58:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:36,050 INFO L93 Difference]: Finished difference Result 884 states and 2788 transitions. [2021-06-05 20:58:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:36,051 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 20:58:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:36,052 INFO L225 Difference]: With dead ends: 884 [2021-06-05 20:58:36,052 INFO L226 Difference]: Without dead ends: 753 [2021-06-05 20:58:36,052 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 75.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:36,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-06-05 20:58:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 449. [2021-06-05 20:58:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.3392857142857144) internal successors, (1496), 448 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1496 transitions. [2021-06-05 20:58:36,063 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1496 transitions. Word has length 21 [2021-06-05 20:58:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:36,063 INFO L482 AbstractCegarLoop]: Abstraction has 449 states and 1496 transitions. [2021-06-05 20:58:36,063 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 20:58:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1496 transitions. [2021-06-05 20:58:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:36,064 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:36,064 INFO L554 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 20:58:36,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-06-05 20:58:36,064 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 20:58:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2031327800, now seen corresponding path program 85 times [2021-06-05 20:58:36,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:36,064 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979994015] [2021-06-05 20:58:36,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:36,132 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 20:58:36,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:36,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979994015] [2021-06-05 20:58:36,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979994015] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:36,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:36,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:36,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677887887] [2021-06-05 20:58:36,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:36,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:36,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:36,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:36,134 INFO L87 Difference]: Start difference. First operand 449 states and 1496 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 20:58:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:36,197 INFO L93 Difference]: Finished difference Result 943 states and 2930 transitions. [2021-06-05 20:58:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:36,198 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 20:58:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:36,199 INFO L225 Difference]: With dead ends: 943 [2021-06-05 20:58:36,199 INFO L226 Difference]: Without dead ends: 840 [2021-06-05 20:58:36,200 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-06-05 20:58:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 449. [2021-06-05 20:58:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.3125) internal successors, (1484), 448 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1484 transitions. [2021-06-05 20:58:36,210 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1484 transitions. Word has length 21 [2021-06-05 20:58:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:36,210 INFO L482 AbstractCegarLoop]: Abstraction has 449 states and 1484 transitions. [2021-06-05 20:58:36,211 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 20:58:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1484 transitions. [2021-06-05 20:58:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:36,211 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:36,212 INFO L554 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 20:58:36,212 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-06-05 20:58:36,212 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 20:58:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1172323610, now seen corresponding path program 86 times [2021-06-05 20:58:36,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:36,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378188467] [2021-06-05 20:58:36,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:36,280 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 20:58:36,280 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:36,280 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378188467] [2021-06-05 20:58:36,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378188467] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:36,281 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:36,281 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:36,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707625099] [2021-06-05 20:58:36,281 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:36,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:36,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:36,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:36,281 INFO L87 Difference]: Start difference. First operand 449 states and 1484 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 20:58:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:36,320 INFO L93 Difference]: Finished difference Result 974 states and 3017 transitions. [2021-06-05 20:58:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:36,321 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 20:58:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:36,322 INFO L225 Difference]: With dead ends: 974 [2021-06-05 20:58:36,322 INFO L226 Difference]: Without dead ends: 820 [2021-06-05 20:58:36,323 INFO L810 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 20:58:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-06-05 20:58:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 429. [2021-06-05 20:58:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.303738317757009) internal successors, (1414), 428 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1414 transitions. [2021-06-05 20:58:36,334 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1414 transitions. Word has length 21 [2021-06-05 20:58:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:36,334 INFO L482 AbstractCegarLoop]: Abstraction has 429 states and 1414 transitions. [2021-06-05 20:58:36,334 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 20:58:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1414 transitions. [2021-06-05 20:58:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:36,335 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:36,336 INFO L554 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 20:58:36,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-06-05 20:58:36,336 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 20:58:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1824519834, now seen corresponding path program 87 times [2021-06-05 20:58:36,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:36,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375833290] [2021-06-05 20:58:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:36,412 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 20:58:36,412 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:36,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375833290] [2021-06-05 20:58:36,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375833290] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:36,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:36,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:36,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294071452] [2021-06-05 20:58:36,413 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:36,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:36,413 INFO L87 Difference]: Start difference. First operand 429 states and 1414 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 20:58:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:36,466 INFO L93 Difference]: Finished difference Result 892 states and 2761 transitions. [2021-06-05 20:58:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:36,466 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 20:58:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:36,468 INFO L225 Difference]: With dead ends: 892 [2021-06-05 20:58:36,468 INFO L226 Difference]: Without dead ends: 789 [2021-06-05 20:58:36,468 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 83.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-06-05 20:58:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 441. [2021-06-05 20:58:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 3.286363636363636) internal successors, (1446), 440 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1446 transitions. [2021-06-05 20:58:36,479 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1446 transitions. Word has length 21 [2021-06-05 20:58:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:36,479 INFO L482 AbstractCegarLoop]: Abstraction has 441 states and 1446 transitions. [2021-06-05 20:58:36,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 20:58:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1446 transitions. [2021-06-05 20:58:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:36,480 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:36,480 INFO L554 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 20:58:36,480 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-06-05 20:58:36,480 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 20:58:36,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:36,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1416279014, now seen corresponding path program 88 times [2021-06-05 20:58:36,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:36,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132238728] [2021-06-05 20:58:36,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:36,542 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 20:58:36,542 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:36,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132238728] [2021-06-05 20:58:36,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132238728] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:36,542 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:36,542 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:36,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104104884] [2021-06-05 20:58:36,543 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:36,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:36,543 INFO L87 Difference]: Start difference. First operand 441 states and 1446 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 20:58:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:36,597 INFO L93 Difference]: Finished difference Result 824 states and 2576 transitions. [2021-06-05 20:58:36,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:36,598 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 20:58:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:36,599 INFO L225 Difference]: With dead ends: 824 [2021-06-05 20:58:36,599 INFO L226 Difference]: Without dead ends: 697 [2021-06-05 20:58:36,599 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-06-05 20:58:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 429. [2021-06-05 20:58:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.289719626168224) internal successors, (1408), 428 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1408 transitions. [2021-06-05 20:58:36,609 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1408 transitions. Word has length 21 [2021-06-05 20:58:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:36,609 INFO L482 AbstractCegarLoop]: Abstraction has 429 states and 1408 transitions. [2021-06-05 20:58:36,609 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 20:58:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1408 transitions. [2021-06-05 20:58:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:36,610 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:36,610 INFO L554 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 20:58:36,610 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-06-05 20:58:36,610 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 20:58:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:36,610 INFO L82 PathProgramCache]: Analyzing trace with hash -928326020, now seen corresponding path program 89 times [2021-06-05 20:58:36,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:36,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674506723] [2021-06-05 20:58:36,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:36,685 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 20:58:36,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:36,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674506723] [2021-06-05 20:58:36,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674506723] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:36,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:36,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:36,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833192932] [2021-06-05 20:58:36,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:36,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:36,686 INFO L87 Difference]: Start difference. First operand 429 states and 1408 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 20:58:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:36,729 INFO L93 Difference]: Finished difference Result 937 states and 2907 transitions. [2021-06-05 20:58:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:36,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 20:58:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:36,731 INFO L225 Difference]: With dead ends: 937 [2021-06-05 20:58:36,731 INFO L226 Difference]: Without dead ends: 803 [2021-06-05 20:58:36,732 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2021-06-05 20:58:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 455. [2021-06-05 20:58:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.2577092511013217) internal successors, (1479), 454 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1479 transitions. [2021-06-05 20:58:36,742 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1479 transitions. Word has length 21 [2021-06-05 20:58:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:36,742 INFO L482 AbstractCegarLoop]: Abstraction has 455 states and 1479 transitions. [2021-06-05 20:58:36,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 20:58:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1479 transitions. [2021-06-05 20:58:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:36,743 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:36,743 INFO L554 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 20:58:36,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-06-05 20:58:36,744 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 20:58:36,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:36,744 INFO L82 PathProgramCache]: Analyzing trace with hash -840389286, now seen corresponding path program 90 times [2021-06-05 20:58:36,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:36,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907518171] [2021-06-05 20:58:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:36,803 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 20:58:36,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:36,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907518171] [2021-06-05 20:58:36,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907518171] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:36,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:36,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:36,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382544958] [2021-06-05 20:58:36,803 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:36,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:36,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:36,804 INFO L87 Difference]: Start difference. First operand 455 states and 1479 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 20:58:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:36,848 INFO L93 Difference]: Finished difference Result 838 states and 2609 transitions. [2021-06-05 20:58:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:36,849 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 20:58:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:36,850 INFO L225 Difference]: With dead ends: 838 [2021-06-05 20:58:36,850 INFO L226 Difference]: Without dead ends: 687 [2021-06-05 20:58:36,850 INFO L810 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 20:58:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-06-05 20:58:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 419. [2021-06-05 20:58:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 3.299043062200957) internal successors, (1379), 418 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1379 transitions. [2021-06-05 20:58:36,857 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1379 transitions. Word has length 21 [2021-06-05 20:58:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:36,857 INFO L482 AbstractCegarLoop]: Abstraction has 419 states and 1379 transitions. [2021-06-05 20:58:36,857 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 20:58:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1379 transitions. [2021-06-05 20:58:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:36,857 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:36,857 INFO L554 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 20:58:36,858 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-06-05 20:58:36,858 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 20:58:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:36,858 INFO L82 PathProgramCache]: Analyzing trace with hash 456830594, now seen corresponding path program 91 times [2021-06-05 20:58:36,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:36,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89705936] [2021-06-05 20:58:36,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:36,937 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 20:58:36,937 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:36,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89705936] [2021-06-05 20:58:36,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89705936] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:36,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:36,937 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:36,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902667937] [2021-06-05 20:58:36,937 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:36,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:36,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:36,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:36,938 INFO L87 Difference]: Start difference. First operand 419 states and 1379 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 20:58:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:36,977 INFO L93 Difference]: Finished difference Result 858 states and 2638 transitions. [2021-06-05 20:58:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:36,977 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 20:58:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:36,979 INFO L225 Difference]: With dead ends: 858 [2021-06-05 20:58:36,979 INFO L226 Difference]: Without dead ends: 755 [2021-06-05 20:58:36,979 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 74.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2021-06-05 20:58:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 419. [2021-06-05 20:58:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 3.270334928229665) internal successors, (1367), 418 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1367 transitions. [2021-06-05 20:58:36,989 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1367 transitions. Word has length 21 [2021-06-05 20:58:36,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:36,990 INFO L482 AbstractCegarLoop]: Abstraction has 419 states and 1367 transitions. [2021-06-05 20:58:36,990 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 20:58:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1367 transitions. [2021-06-05 20:58:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:36,991 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:36,991 INFO L554 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 20:58:36,991 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-06-05 20:58:36,991 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 20:58:36,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:36,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1133104156, now seen corresponding path program 92 times [2021-06-05 20:58:36,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:36,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228356461] [2021-06-05 20:58:36,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:37,064 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 20:58:37,065 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:37,065 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228356461] [2021-06-05 20:58:37,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228356461] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:37,065 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:37,065 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:37,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376240114] [2021-06-05 20:58:37,065 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:37,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:37,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:37,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:37,066 INFO L87 Difference]: Start difference. First operand 419 states and 1367 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 20:58:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:37,110 INFO L93 Difference]: Finished difference Result 889 states and 2725 transitions. [2021-06-05 20:58:37,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:37,110 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 20:58:37,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:37,111 INFO L225 Difference]: With dead ends: 889 [2021-06-05 20:58:37,111 INFO L226 Difference]: Without dead ends: 735 [2021-06-05 20:58:37,111 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-06-05 20:58:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 399. [2021-06-05 20:58:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 3.258793969849246) internal successors, (1297), 398 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1297 transitions. [2021-06-05 20:58:37,118 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1297 transitions. Word has length 21 [2021-06-05 20:58:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:37,118 INFO L482 AbstractCegarLoop]: Abstraction has 399 states and 1297 transitions. [2021-06-05 20:58:37,118 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 20:58:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1297 transitions. [2021-06-05 20:58:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:37,119 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:37,119 INFO L554 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 20:58:37,119 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-06-05 20:58:37,119 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 20:58:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash 250022628, now seen corresponding path program 93 times [2021-06-05 20:58:37,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:37,120 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212187683] [2021-06-05 20:58:37,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:37,181 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 20:58:37,181 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:37,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212187683] [2021-06-05 20:58:37,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212187683] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:37,181 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:37,181 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:37,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352805571] [2021-06-05 20:58:37,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:37,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:37,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:37,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:37,182 INFO L87 Difference]: Start difference. First operand 399 states and 1297 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 20:58:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:37,224 INFO L93 Difference]: Finished difference Result 862 states and 2644 transitions. [2021-06-05 20:58:37,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:37,225 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 20:58:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:37,226 INFO L225 Difference]: With dead ends: 862 [2021-06-05 20:58:37,226 INFO L226 Difference]: Without dead ends: 759 [2021-06-05 20:58:37,226 INFO L810 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 20:58:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2021-06-05 20:58:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 411. [2021-06-05 20:58:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.2414634146341466) internal successors, (1329), 410 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1329 transitions. [2021-06-05 20:58:37,236 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1329 transitions. Word has length 21 [2021-06-05 20:58:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:37,236 INFO L482 AbstractCegarLoop]: Abstraction has 411 states and 1329 transitions. [2021-06-05 20:58:37,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 20:58:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1329 transitions. [2021-06-05 20:58:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:37,237 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:37,238 INFO L554 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 20:58:37,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-06-05 20:58:37,238 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 20:58:37,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:37,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1930519268, now seen corresponding path program 94 times [2021-06-05 20:58:37,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:37,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818245619] [2021-06-05 20:58:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:37,298 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 20:58:37,298 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:37,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818245619] [2021-06-05 20:58:37,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818245619] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:37,299 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:37,299 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:37,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386511080] [2021-06-05 20:58:37,299 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:37,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:37,299 INFO L87 Difference]: Start difference. First operand 411 states and 1329 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 20:58:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:37,351 INFO L93 Difference]: Finished difference Result 794 states and 2459 transitions. [2021-06-05 20:58:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:37,351 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 20:58:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:37,352 INFO L225 Difference]: With dead ends: 794 [2021-06-05 20:58:37,353 INFO L226 Difference]: Without dead ends: 667 [2021-06-05 20:58:37,353 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-06-05 20:58:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 399. [2021-06-05 20:58:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 3.2437185929648242) internal successors, (1291), 398 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1291 transitions. [2021-06-05 20:58:37,362 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1291 transitions. Word has length 21 [2021-06-05 20:58:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:37,362 INFO L482 AbstractCegarLoop]: Abstraction has 399 states and 1291 transitions. [2021-06-05 20:58:37,362 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 20:58:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1291 transitions. [2021-06-05 20:58:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:37,363 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:37,363 INFO L554 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 20:58:37,363 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-06-05 20:58:37,364 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 20:58:37,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:37,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1667184582, now seen corresponding path program 95 times [2021-06-05 20:58:37,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:37,364 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276057962] [2021-06-05 20:58:37,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:37,425 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 20:58:37,425 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:37,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276057962] [2021-06-05 20:58:37,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276057962] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:37,425 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:37,425 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:37,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574937349] [2021-06-05 20:58:37,426 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:37,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:37,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:37,426 INFO L87 Difference]: Start difference. First operand 399 states and 1291 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 20:58:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:37,463 INFO L93 Difference]: Finished difference Result 826 states and 2518 transitions. [2021-06-05 20:58:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:37,464 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 20:58:37,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:37,465 INFO L225 Difference]: With dead ends: 826 [2021-06-05 20:58:37,465 INFO L226 Difference]: Without dead ends: 692 [2021-06-05 20:58:37,466 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 64.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-06-05 20:58:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 344. [2021-06-05 20:58:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 3.1778425655976674) internal successors, (1090), 343 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1090 transitions. [2021-06-05 20:58:37,474 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1090 transitions. Word has length 21 [2021-06-05 20:58:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:37,474 INFO L482 AbstractCegarLoop]: Abstraction has 344 states and 1090 transitions. [2021-06-05 20:58:37,474 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 20:58:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1090 transitions. [2021-06-05 20:58:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:37,475 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:37,475 INFO L554 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 20:58:37,475 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-06-05 20:58:37,475 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 20:58:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash 275040036, now seen corresponding path program 96 times [2021-06-05 20:58:37,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:37,475 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653097804] [2021-06-05 20:58:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:37,555 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 20:58:37,555 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:37,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653097804] [2021-06-05 20:58:37,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653097804] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:37,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:37,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:37,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266781951] [2021-06-05 20:58:37,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:37,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:37,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:37,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:37,556 INFO L87 Difference]: Start difference. First operand 344 states and 1090 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 20:58:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:37,611 INFO L93 Difference]: Finished difference Result 727 states and 2220 transitions. [2021-06-05 20:58:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:37,611 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 20:58:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:37,612 INFO L225 Difference]: With dead ends: 727 [2021-06-05 20:58:37,612 INFO L226 Difference]: Without dead ends: 572 [2021-06-05 20:58:37,613 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 97.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-06-05 20:58:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 304. [2021-06-05 20:58:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.2475247524752477) internal successors, (984), 303 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 984 transitions. [2021-06-05 20:58:37,619 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 984 transitions. Word has length 21 [2021-06-05 20:58:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:37,620 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 984 transitions. [2021-06-05 20:58:37,620 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 20:58:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 984 transitions. [2021-06-05 20:58:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:37,620 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:37,620 INFO L554 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 20:58:37,620 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-06-05 20:58:37,621 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 20:58:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:37,621 INFO L82 PathProgramCache]: Analyzing trace with hash 988259000, now seen corresponding path program 97 times [2021-06-05 20:58:37,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:37,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832440488] [2021-06-05 20:58:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:37,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 20:58:37,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:37,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832440488] [2021-06-05 20:58:37,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832440488] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:37,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:37,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:37,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439252192] [2021-06-05 20:58:37,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:37,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:37,683 INFO L87 Difference]: Start difference. First operand 304 states and 984 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 20:58:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:37,728 INFO L93 Difference]: Finished difference Result 623 states and 1890 transitions. [2021-06-05 20:58:37,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:37,728 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 20:58:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:37,729 INFO L225 Difference]: With dead ends: 623 [2021-06-05 20:58:37,729 INFO L226 Difference]: Without dead ends: 520 [2021-06-05 20:58:37,729 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 72.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-06-05 20:58:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 312. [2021-06-05 20:58:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 3.2282958199356915) internal successors, (1004), 311 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 1004 transitions. [2021-06-05 20:58:37,736 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 1004 transitions. Word has length 21 [2021-06-05 20:58:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:37,736 INFO L482 AbstractCegarLoop]: Abstraction has 312 states and 1004 transitions. [2021-06-05 20:58:37,736 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 20:58:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 1004 transitions. [2021-06-05 20:58:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:37,737 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:37,737 INFO L554 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 20:58:37,737 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-06-05 20:58:37,737 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 20:58:37,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:37,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1236368130, now seen corresponding path program 98 times [2021-06-05 20:58:37,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:37,738 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707948144] [2021-06-05 20:58:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:37,800 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 20:58:37,801 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:37,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707948144] [2021-06-05 20:58:37,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707948144] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:37,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:37,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:37,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494913243] [2021-06-05 20:58:37,801 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:37,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:37,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:37,802 INFO L87 Difference]: Start difference. First operand 312 states and 1004 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 20:58:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:37,838 INFO L93 Difference]: Finished difference Result 623 states and 1882 transitions. [2021-06-05 20:58:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:37,838 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 20:58:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:37,839 INFO L225 Difference]: With dead ends: 623 [2021-06-05 20:58:37,839 INFO L226 Difference]: Without dead ends: 512 [2021-06-05 20:58:37,840 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-06-05 20:58:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 304. [2021-06-05 20:58:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.2343234323432344) internal successors, (980), 303 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 980 transitions. [2021-06-05 20:58:37,846 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 980 transitions. Word has length 21 [2021-06-05 20:58:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:37,846 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 980 transitions. [2021-06-05 20:58:37,846 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 20:58:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 980 transitions. [2021-06-05 20:58:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:37,847 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:37,847 INFO L554 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 20:58:37,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-06-05 20:58:37,847 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 20:58:37,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2114241864, now seen corresponding path program 99 times [2021-06-05 20:58:37,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:37,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686782912] [2021-06-05 20:58:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:37,908 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 20:58:37,908 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:37,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686782912] [2021-06-05 20:58:37,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686782912] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:37,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:37,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:37,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791722280] [2021-06-05 20:58:37,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:37,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:37,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:37,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:37,909 INFO L87 Difference]: Start difference. First operand 304 states and 980 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 20:58:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:37,964 INFO L93 Difference]: Finished difference Result 641 states and 1951 transitions. [2021-06-05 20:58:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:37,964 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 20:58:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:37,965 INFO L225 Difference]: With dead ends: 641 [2021-06-05 20:58:37,965 INFO L226 Difference]: Without dead ends: 538 [2021-06-05 20:58:37,965 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-06-05 20:58:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 316. [2021-06-05 20:58:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 3.212698412698413) internal successors, (1012), 315 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1012 transitions. [2021-06-05 20:58:37,972 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 1012 transitions. Word has length 21 [2021-06-05 20:58:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:37,972 INFO L482 AbstractCegarLoop]: Abstraction has 316 states and 1012 transitions. [2021-06-05 20:58:37,972 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 20:58:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 1012 transitions. [2021-06-05 20:58:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:37,973 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:37,973 INFO L554 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 20:58:37,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-06-05 20:58:37,973 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 20:58:37,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:37,973 INFO L82 PathProgramCache]: Analyzing trace with hash 664098074, now seen corresponding path program 100 times [2021-06-05 20:58:37,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:37,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194233172] [2021-06-05 20:58:37,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:38,039 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 20:58:38,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:38,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194233172] [2021-06-05 20:58:38,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194233172] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:38,039 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:38,039 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:38,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247169558] [2021-06-05 20:58:38,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:38,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:38,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:38,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:38,040 INFO L87 Difference]: Start difference. First operand 316 states and 1012 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 20:58:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:38,096 INFO L93 Difference]: Finished difference Result 655 states and 1988 transitions. [2021-06-05 20:58:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:38,096 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 20:58:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:38,097 INFO L225 Difference]: With dead ends: 655 [2021-06-05 20:58:38,097 INFO L226 Difference]: Without dead ends: 526 [2021-06-05 20:58:38,098 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-06-05 20:58:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 304. [2021-06-05 20:58:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.221122112211221) internal successors, (976), 303 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 976 transitions. [2021-06-05 20:58:38,106 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 976 transitions. Word has length 21 [2021-06-05 20:58:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:38,107 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 976 transitions. [2021-06-05 20:58:38,107 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 20:58:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 976 transitions. [2021-06-05 20:58:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:38,107 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:38,107 INFO L554 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 20:58:38,107 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-06-05 20:58:38,108 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 20:58:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash -175935230, now seen corresponding path program 101 times [2021-06-05 20:58:38,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:38,108 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065700180] [2021-06-05 20:58:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:38,176 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 20:58:38,176 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:38,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065700180] [2021-06-05 20:58:38,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065700180] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:38,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:38,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:38,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861708983] [2021-06-05 20:58:38,177 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:38,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:38,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:38,177 INFO L87 Difference]: Start difference. First operand 304 states and 976 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 20:58:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:38,214 INFO L93 Difference]: Finished difference Result 641 states and 1947 transitions. [2021-06-05 20:58:38,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:38,214 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 20:58:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:38,215 INFO L225 Difference]: With dead ends: 641 [2021-06-05 20:58:38,215 INFO L226 Difference]: Without dead ends: 538 [2021-06-05 20:58:38,215 INFO L810 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 20:58:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-06-05 20:58:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 316. [2021-06-05 20:58:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 3.2) internal successors, (1008), 315 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1008 transitions. [2021-06-05 20:58:38,222 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 1008 transitions. Word has length 21 [2021-06-05 20:58:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:38,222 INFO L482 AbstractCegarLoop]: Abstraction has 316 states and 1008 transitions. [2021-06-05 20:58:38,222 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 20:58:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 1008 transitions. [2021-06-05 20:58:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:38,223 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:38,223 INFO L554 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 20:58:38,223 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-06-05 20:58:38,223 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 20:58:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:38,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1744863772, now seen corresponding path program 102 times [2021-06-05 20:58:38,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:38,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145705126] [2021-06-05 20:58:38,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:38,292 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 20:58:38,293 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:38,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145705126] [2021-06-05 20:58:38,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145705126] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:38,293 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:38,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:38,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334872825] [2021-06-05 20:58:38,293 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:38,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:38,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:38,294 INFO L87 Difference]: Start difference. First operand 316 states and 1008 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 20:58:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:38,347 INFO L93 Difference]: Finished difference Result 655 states and 1984 transitions. [2021-06-05 20:58:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:38,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 20:58:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:38,348 INFO L225 Difference]: With dead ends: 655 [2021-06-05 20:58:38,348 INFO L226 Difference]: Without dead ends: 522 [2021-06-05 20:58:38,348 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 88.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-06-05 20:58:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 300. [2021-06-05 20:58:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.230769230769231) internal successors, (966), 299 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 966 transitions. [2021-06-05 20:58:38,355 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 966 transitions. Word has length 21 [2021-06-05 20:58:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:38,355 INFO L482 AbstractCegarLoop]: Abstraction has 300 states and 966 transitions. [2021-06-05 20:58:38,355 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 20:58:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 966 transitions. [2021-06-05 20:58:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:38,355 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:38,355 INFO L554 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 20:58:38,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-06-05 20:58:38,356 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 20:58:38,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash 507356954, now seen corresponding path program 103 times [2021-06-05 20:58:38,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:38,356 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785772091] [2021-06-05 20:58:38,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:38,417 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 20:58:38,417 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:38,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785772091] [2021-06-05 20:58:38,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785772091] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:38,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:38,418 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:38,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016857454] [2021-06-05 20:58:38,418 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:38,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:38,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:38,418 INFO L87 Difference]: Start difference. First operand 300 states and 966 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 20:58:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:38,466 INFO L93 Difference]: Finished difference Result 611 states and 1844 transitions. [2021-06-05 20:58:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:38,467 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 20:58:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:38,468 INFO L225 Difference]: With dead ends: 611 [2021-06-05 20:58:38,468 INFO L226 Difference]: Without dead ends: 508 [2021-06-05 20:58:38,468 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-06-05 20:58:38,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 300. [2021-06-05 20:58:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.2040133779264215) internal successors, (958), 299 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 958 transitions. [2021-06-05 20:58:38,474 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 958 transitions. Word has length 21 [2021-06-05 20:58:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:38,474 INFO L482 AbstractCegarLoop]: Abstraction has 300 states and 958 transitions. [2021-06-05 20:58:38,475 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 20:58:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 958 transitions. [2021-06-05 20:58:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:38,475 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:38,475 INFO L554 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 20:58:38,475 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-06-05 20:58:38,475 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 20:58:38,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:38,476 INFO L82 PathProgramCache]: Analyzing trace with hash 755466084, now seen corresponding path program 104 times [2021-06-05 20:58:38,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:38,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325667259] [2021-06-05 20:58:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:38,537 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 20:58:38,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:38,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325667259] [2021-06-05 20:58:38,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325667259] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:38,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:38,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:38,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658958424] [2021-06-05 20:58:38,538 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:38,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:38,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:38,539 INFO L87 Difference]: Start difference. First operand 300 states and 958 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 20:58:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:38,577 INFO L93 Difference]: Finished difference Result 611 states and 1836 transitions. [2021-06-05 20:58:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:38,577 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 20:58:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:38,578 INFO L225 Difference]: With dead ends: 611 [2021-06-05 20:58:38,578 INFO L226 Difference]: Without dead ends: 500 [2021-06-05 20:58:38,578 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-06-05 20:58:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 292. [2021-06-05 20:58:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.209621993127148) internal successors, (934), 291 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 934 transitions. [2021-06-05 20:58:38,585 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 934 transitions. Word has length 21 [2021-06-05 20:58:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:38,585 INFO L482 AbstractCegarLoop]: Abstraction has 292 states and 934 transitions. [2021-06-05 20:58:38,585 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 20:58:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 934 transitions. [2021-06-05 20:58:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:38,586 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:38,586 INFO L554 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 20:58:38,587 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-06-05 20:58:38,587 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 20:58:38,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:38,587 INFO L82 PathProgramCache]: Analyzing trace with hash -418293064, now seen corresponding path program 105 times [2021-06-05 20:58:38,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:38,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223261323] [2021-06-05 20:58:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:38,648 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 20:58:38,649 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:38,649 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223261323] [2021-06-05 20:58:38,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223261323] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:38,649 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:38,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:38,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166364560] [2021-06-05 20:58:38,649 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:38,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:38,649 INFO L87 Difference]: Start difference. First operand 292 states and 934 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 20:58:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:38,686 INFO L93 Difference]: Finished difference Result 603 states and 1824 transitions. [2021-06-05 20:58:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:38,687 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 20:58:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:38,687 INFO L225 Difference]: With dead ends: 603 [2021-06-05 20:58:38,688 INFO L226 Difference]: Without dead ends: 500 [2021-06-05 20:58:38,688 INFO L810 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 20:58:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-06-05 20:58:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 304. [2021-06-05 20:58:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.1881188118811883) internal successors, (966), 303 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 966 transitions. [2021-06-05 20:58:38,694 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 966 transitions. Word has length 21 [2021-06-05 20:58:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:38,694 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 966 transitions. [2021-06-05 20:58:38,694 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 20:58:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 966 transitions. [2021-06-05 20:58:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:38,695 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:38,695 INFO L554 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 20:58:38,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-06-05 20:58:38,695 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 20:58:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:38,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1702423706, now seen corresponding path program 106 times [2021-06-05 20:58:38,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:38,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742811562] [2021-06-05 20:58:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:38,753 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 20:58:38,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:38,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742811562] [2021-06-05 20:58:38,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742811562] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:38,754 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:38,754 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:38,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179690887] [2021-06-05 20:58:38,754 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:38,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:38,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:38,755 INFO L87 Difference]: Start difference. First operand 304 states and 966 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 20:58:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:38,798 INFO L93 Difference]: Finished difference Result 535 states and 1639 transitions. [2021-06-05 20:58:38,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:38,798 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 20:58:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:38,799 INFO L225 Difference]: With dead ends: 535 [2021-06-05 20:58:38,799 INFO L226 Difference]: Without dead ends: 408 [2021-06-05 20:58:38,799 INFO L810 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 20:58:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-06-05 20:58:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 292. [2021-06-05 20:58:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.195876288659794) internal successors, (930), 291 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 930 transitions. [2021-06-05 20:58:38,805 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 930 transitions. Word has length 21 [2021-06-05 20:58:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:38,805 INFO L482 AbstractCegarLoop]: Abstraction has 292 states and 930 transitions. [2021-06-05 20:58:38,805 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 20:58:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 930 transitions. [2021-06-05 20:58:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:38,805 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:38,805 INFO L554 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 20:58:38,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-06-05 20:58:38,806 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 20:58:38,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:38,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1520013570, now seen corresponding path program 107 times [2021-06-05 20:58:38,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:38,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588290843] [2021-06-05 20:58:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:38,868 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 20:58:38,869 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:38,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588290843] [2021-06-05 20:58:38,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588290843] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:38,869 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:38,869 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:38,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391093755] [2021-06-05 20:58:38,869 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:38,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:38,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:38,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:38,870 INFO L87 Difference]: Start difference. First operand 292 states and 930 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 20:58:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:38,920 INFO L93 Difference]: Finished difference Result 603 states and 1820 transitions. [2021-06-05 20:58:38,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:38,920 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 20:58:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:38,921 INFO L225 Difference]: With dead ends: 603 [2021-06-05 20:58:38,921 INFO L226 Difference]: Without dead ends: 500 [2021-06-05 20:58:38,921 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-06-05 20:58:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 304. [2021-06-05 20:58:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.174917491749175) internal successors, (962), 303 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 962 transitions. [2021-06-05 20:58:38,928 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 962 transitions. Word has length 21 [2021-06-05 20:58:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:38,928 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 962 transitions. [2021-06-05 20:58:38,928 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 20:58:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 962 transitions. [2021-06-05 20:58:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:38,928 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:38,928 INFO L554 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 20:58:38,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-06-05 20:58:38,929 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 20:58:38,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:38,929 INFO L82 PathProgramCache]: Analyzing trace with hash -27908764, now seen corresponding path program 108 times [2021-06-05 20:58:38,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:38,929 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351537176] [2021-06-05 20:58:38,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:38,989 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 20:58:38,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:38,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351537176] [2021-06-05 20:58:38,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351537176] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:38,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:38,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:38,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780072380] [2021-06-05 20:58:38,990 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:38,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:38,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:38,991 INFO L87 Difference]: Start difference. First operand 304 states and 962 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 20:58:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:39,041 INFO L93 Difference]: Finished difference Result 535 states and 1635 transitions. [2021-06-05 20:58:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:39,042 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 20:58:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:39,043 INFO L225 Difference]: With dead ends: 535 [2021-06-05 20:58:39,043 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 20:58:39,043 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 20:58:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 288. [2021-06-05 20:58:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.205574912891986) internal successors, (920), 287 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 920 transitions. [2021-06-05 20:58:39,048 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 920 transitions. Word has length 21 [2021-06-05 20:58:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:39,048 INFO L482 AbstractCegarLoop]: Abstraction has 288 states and 920 transitions. [2021-06-05 20:58:39,049 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 20:58:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 920 transitions. [2021-06-05 20:58:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:39,049 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:39,049 INFO L554 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 20:58:39,049 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-06-05 20:58:39,049 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 20:58:39,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:39,050 INFO L82 PathProgramCache]: Analyzing trace with hash -577641800, now seen corresponding path program 109 times [2021-06-05 20:58:39,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:39,050 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080109653] [2021-06-05 20:58:39,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:39,110 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 20:58:39,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:39,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080109653] [2021-06-05 20:58:39,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080109653] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:39,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:39,111 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:39,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702847019] [2021-06-05 20:58:39,111 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:39,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:39,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:39,111 INFO L87 Difference]: Start difference. First operand 288 states and 920 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 20:58:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:39,149 INFO L93 Difference]: Finished difference Result 589 states and 1771 transitions. [2021-06-05 20:58:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:39,150 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 20:58:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:39,150 INFO L225 Difference]: With dead ends: 589 [2021-06-05 20:58:39,151 INFO L226 Difference]: Without dead ends: 486 [2021-06-05 20:58:39,151 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 64.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-06-05 20:58:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 288. [2021-06-05 20:58:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.163763066202091) internal successors, (908), 287 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 908 transitions. [2021-06-05 20:58:39,155 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 908 transitions. Word has length 21 [2021-06-05 20:58:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:39,155 INFO L482 AbstractCegarLoop]: Abstraction has 288 states and 908 transitions. [2021-06-05 20:58:39,155 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 20:58:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 908 transitions. [2021-06-05 20:58:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:39,156 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:39,156 INFO L554 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 20:58:39,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-06-05 20:58:39,156 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 20:58:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:39,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2094269158, now seen corresponding path program 110 times [2021-06-05 20:58:39,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:39,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49388712] [2021-06-05 20:58:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:39,212 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 20:58:39,212 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:39,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49388712] [2021-06-05 20:58:39,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49388712] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:39,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:39,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:39,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47437712] [2021-06-05 20:58:39,212 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:39,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:39,213 INFO L87 Difference]: Start difference. First operand 288 states and 908 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 20:58:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:39,260 INFO L93 Difference]: Finished difference Result 603 states and 1808 transitions. [2021-06-05 20:58:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:39,261 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 20:58:39,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:39,262 INFO L225 Difference]: With dead ends: 603 [2021-06-05 20:58:39,262 INFO L226 Difference]: Without dead ends: 474 [2021-06-05 20:58:39,262 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-06-05 20:58:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 276. [2021-06-05 20:58:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 3.1636363636363636) internal successors, (870), 275 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 870 transitions. [2021-06-05 20:58:39,267 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 870 transitions. Word has length 21 [2021-06-05 20:58:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:39,268 INFO L482 AbstractCegarLoop]: Abstraction has 276 states and 870 transitions. [2021-06-05 20:58:39,268 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 20:58:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 870 transitions. [2021-06-05 20:58:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:39,268 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:39,268 INFO L554 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 20:58:39,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-06-05 20:58:39,268 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 20:58:39,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:39,269 INFO L82 PathProgramCache]: Analyzing trace with hash 503420826, now seen corresponding path program 111 times [2021-06-05 20:58:39,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:39,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034126273] [2021-06-05 20:58:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:39,329 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 20:58:39,329 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:39,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034126273] [2021-06-05 20:58:39,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034126273] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:39,329 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:39,329 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:39,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642920458] [2021-06-05 20:58:39,329 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:39,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:39,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:39,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:39,330 INFO L87 Difference]: Start difference. First operand 276 states and 870 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 20:58:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:39,384 INFO L93 Difference]: Finished difference Result 551 states and 1640 transitions. [2021-06-05 20:58:39,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:39,385 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 20:58:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:39,386 INFO L225 Difference]: With dead ends: 551 [2021-06-05 20:58:39,386 INFO L226 Difference]: Without dead ends: 448 [2021-06-05 20:58:39,386 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:39,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-06-05 20:58:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 252. [2021-06-05 20:58:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 3.1155378486055776) internal successors, (782), 251 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 782 transitions. [2021-06-05 20:58:39,391 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 782 transitions. Word has length 21 [2021-06-05 20:58:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:39,391 INFO L482 AbstractCegarLoop]: Abstraction has 252 states and 782 transitions. [2021-06-05 20:58:39,391 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 20:58:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 782 transitions. [2021-06-05 20:58:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:39,392 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:39,392 INFO L554 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 20:58:39,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-06-05 20:58:39,392 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 20:58:39,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:39,392 INFO L82 PathProgramCache]: Analyzing trace with hash 906396826, now seen corresponding path program 112 times [2021-06-05 20:58:39,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:39,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009796486] [2021-06-05 20:58:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:39,453 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 20:58:39,454 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:39,454 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009796486] [2021-06-05 20:58:39,454 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009796486] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:39,454 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:39,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:39,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996003400] [2021-06-05 20:58:39,454 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:39,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:39,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:39,455 INFO L87 Difference]: Start difference. First operand 252 states and 782 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 20:58:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:39,505 INFO L93 Difference]: Finished difference Result 483 states and 1455 transitions. [2021-06-05 20:58:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:39,505 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 20:58:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:39,506 INFO L225 Difference]: With dead ends: 483 [2021-06-05 20:58:39,506 INFO L226 Difference]: Without dead ends: 356 [2021-06-05 20:58:39,506 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-06-05 20:58:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 240. [2021-06-05 20:58:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 3.1129707112970713) internal successors, (744), 239 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 744 transitions. [2021-06-05 20:58:39,511 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 744 transitions. Word has length 21 [2021-06-05 20:58:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:39,511 INFO L482 AbstractCegarLoop]: Abstraction has 240 states and 744 transitions. [2021-06-05 20:58:39,511 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 20:58:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 744 transitions. [2021-06-05 20:58:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:39,512 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:39,512 INFO L554 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 20:58:39,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-06-05 20:58:39,512 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 20:58:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash 100048508, now seen corresponding path program 113 times [2021-06-05 20:58:39,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:39,512 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957202784] [2021-06-05 20:58:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:39,570 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 20:58:39,571 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:39,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957202784] [2021-06-05 20:58:39,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957202784] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:39,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:39,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:39,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609070855] [2021-06-05 20:58:39,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:39,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:39,572 INFO L87 Difference]: Start difference. First operand 240 states and 744 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 20:58:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:39,626 INFO L93 Difference]: Finished difference Result 491 states and 1491 transitions. [2021-06-05 20:58:39,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:39,626 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 20:58:39,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:39,627 INFO L225 Difference]: With dead ends: 491 [2021-06-05 20:58:39,627 INFO L226 Difference]: Without dead ends: 374 [2021-06-05 20:58:39,627 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-06-05 20:58:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 258. [2021-06-05 20:58:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 3.093385214007782) internal successors, (795), 257 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 795 transitions. [2021-06-05 20:58:39,632 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 795 transitions. Word has length 21 [2021-06-05 20:58:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:39,632 INFO L482 AbstractCegarLoop]: Abstraction has 258 states and 795 transitions. [2021-06-05 20:58:39,632 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 20:58:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 795 transitions. [2021-06-05 20:58:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:39,633 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:39,633 INFO L554 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 20:58:39,633 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-06-05 20:58:39,633 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 20:58:39,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash -228334374, now seen corresponding path program 114 times [2021-06-05 20:58:39,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:39,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196376274] [2021-06-05 20:58:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:39,701 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 20:58:39,702 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:39,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196376274] [2021-06-05 20:58:39,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196376274] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:39,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:39,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:39,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957322540] [2021-06-05 20:58:39,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:39,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:39,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:39,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:39,702 INFO L87 Difference]: Start difference. First operand 258 states and 795 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 20:58:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:39,739 INFO L93 Difference]: Finished difference Result 373 states and 1131 transitions. [2021-06-05 20:58:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:39,739 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 20:58:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:39,740 INFO L225 Difference]: With dead ends: 373 [2021-06-05 20:58:39,740 INFO L226 Difference]: Without dead ends: 234 [2021-06-05 20:58:39,740 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 65.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-05 20:58:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2021-06-05 20:58:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 3.128755364806867) internal successors, (729), 233 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 729 transitions. [2021-06-05 20:58:39,743 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 729 transitions. Word has length 21 [2021-06-05 20:58:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:39,743 INFO L482 AbstractCegarLoop]: Abstraction has 234 states and 729 transitions. [2021-06-05 20:58:39,743 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 20:58:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 729 transitions. [2021-06-05 20:58:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:39,743 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:39,743 INFO L554 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 20:58:39,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-06-05 20:58:39,743 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 20:58:39,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:39,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2142828290, now seen corresponding path program 115 times [2021-06-05 20:58:39,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:39,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793864191] [2021-06-05 20:58:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:39,813 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 20:58:39,814 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:39,814 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793864191] [2021-06-05 20:58:39,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793864191] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:39,814 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:39,814 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:39,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839610982] [2021-06-05 20:58:39,814 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:39,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:39,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:39,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:39,815 INFO L87 Difference]: Start difference. First operand 234 states and 729 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 20:58:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:39,842 INFO L93 Difference]: Finished difference Result 417 states and 1238 transitions. [2021-06-05 20:58:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:39,843 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 20:58:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:39,843 INFO L225 Difference]: With dead ends: 417 [2021-06-05 20:58:39,843 INFO L226 Difference]: Without dead ends: 314 [2021-06-05 20:58:39,843 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 69.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-06-05 20:58:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 234. [2021-06-05 20:58:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 3.07725321888412) internal successors, (717), 233 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 717 transitions. [2021-06-05 20:58:39,848 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 717 transitions. Word has length 21 [2021-06-05 20:58:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:39,848 INFO L482 AbstractCegarLoop]: Abstraction has 234 states and 717 transitions. [2021-06-05 20:58:39,848 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 20:58:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 717 transitions. [2021-06-05 20:58:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:39,848 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:39,848 INFO L554 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 20:58:39,849 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-06-05 20:58:39,849 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 20:58:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:39,849 INFO L82 PathProgramCache]: Analyzing trace with hash 573899748, now seen corresponding path program 116 times [2021-06-05 20:58:39,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:39,849 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832040640] [2021-06-05 20:58:39,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:39,913 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 20:58:39,914 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:39,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832040640] [2021-06-05 20:58:39,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832040640] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:39,914 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:39,914 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:39,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841166293] [2021-06-05 20:58:39,914 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:39,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:39,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:39,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:39,915 INFO L87 Difference]: Start difference. First operand 234 states and 717 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 20:58:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:39,958 INFO L93 Difference]: Finished difference Result 431 states and 1275 transitions. [2021-06-05 20:58:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:39,959 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 20:58:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:39,959 INFO L225 Difference]: With dead ends: 431 [2021-06-05 20:58:39,959 INFO L226 Difference]: Without dead ends: 302 [2021-06-05 20:58:39,959 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-06-05 20:58:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 222. [2021-06-05 20:58:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 3.072398190045249) internal successors, (679), 221 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 679 transitions. [2021-06-05 20:58:39,963 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 679 transitions. Word has length 21 [2021-06-05 20:58:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:39,964 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 679 transitions. [2021-06-05 20:58:39,964 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 20:58:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 679 transitions. [2021-06-05 20:58:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:39,964 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:39,964 INFO L554 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 20:58:39,964 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-06-05 20:58:39,964 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 20:58:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1071076380, now seen corresponding path program 117 times [2021-06-05 20:58:39,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:39,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147677688] [2021-06-05 20:58:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:40,023 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 20:58:40,023 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:40,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147677688] [2021-06-05 20:58:40,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147677688] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:40,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:40,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:40,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114435019] [2021-06-05 20:58:40,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:40,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:40,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:40,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:40,024 INFO L87 Difference]: Start difference. First operand 222 states and 679 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 20:58:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:40,051 INFO L93 Difference]: Finished difference Result 381 states and 1112 transitions. [2021-06-05 20:58:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:40,052 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 20:58:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:40,052 INFO L225 Difference]: With dead ends: 381 [2021-06-05 20:58:40,052 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 20:58:40,053 INFO L810 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 20:58:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 20:58:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 198. [2021-06-05 20:58:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.0) internal successors, (591), 197 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 591 transitions. [2021-06-05 20:58:40,056 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 591 transitions. Word has length 21 [2021-06-05 20:58:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:40,056 INFO L482 AbstractCegarLoop]: Abstraction has 198 states and 591 transitions. [2021-06-05 20:58:40,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 20:58:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 591 transitions. [2021-06-05 20:58:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:40,057 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:40,057 INFO L554 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 20:58:40,057 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-06-05 20:58:40,057 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 20:58:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash -41772188, now seen corresponding path program 118 times [2021-06-05 20:58:40,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:40,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935451931] [2021-06-05 20:58:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:40,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 20:58:40,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:40,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935451931] [2021-06-05 20:58:40,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935451931] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:40,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:40,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:40,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864172934] [2021-06-05 20:58:40,116 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:40,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:40,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:40,117 INFO L87 Difference]: Start difference. First operand 198 states and 591 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 20:58:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:40,153 INFO L93 Difference]: Finished difference Result 313 states and 927 transitions. [2021-06-05 20:58:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:40,153 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 20:58:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:40,153 INFO L225 Difference]: With dead ends: 313 [2021-06-05 20:58:40,153 INFO L226 Difference]: Without dead ends: 186 [2021-06-05 20:58:40,154 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-06-05 20:58:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-06-05 20:58:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.9891891891891893) internal successors, (553), 185 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:58:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 553 transitions. [2021-06-05 20:58:40,157 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 553 transitions. Word has length 21 [2021-06-05 20:58:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:40,157 INFO L482 AbstractCegarLoop]: Abstraction has 186 states and 553 transitions. [2021-06-05 20:58:40,157 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 20:58:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 553 transitions. [2021-06-05 20:58:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:40,157 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:40,157 INFO L554 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 20:58:40,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-06-05 20:58:40,157 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 20:58:40,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:40,158 INFO L82 PathProgramCache]: Analyzing trace with hash -920778810, now seen corresponding path program 119 times [2021-06-05 20:58:40,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:40,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247952039] [2021-06-05 20:58:40,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:40,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 20:58:40,215 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:40,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247952039] [2021-06-05 20:58:40,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247952039] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:40,215 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:40,215 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:40,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794144431] [2021-06-05 20:58:40,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:40,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:40,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:40,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:40,216 INFO L87 Difference]: Start difference. First operand 186 states and 553 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 20:58:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:40,256 INFO L93 Difference]: Finished difference Result 265 states and 769 transitions. [2021-06-05 20:58:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:40,257 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 20:58:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:40,257 INFO L225 Difference]: With dead ends: 265 [2021-06-05 20:58:40,257 INFO L226 Difference]: Without dead ends: 148 [2021-06-05 20:58:40,257 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 75.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-06-05 20:58:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-06-05 20:58:40,258 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 20:58:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 410 transitions. [2021-06-05 20:58:40,259 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 410 transitions. Word has length 21 [2021-06-05 20:58:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:40,259 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 410 transitions. [2021-06-05 20:58:40,259 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 20:58:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 410 transitions. [2021-06-05 20:58:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 20:58:40,259 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:58:40,259 INFO L554 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 20:58:40,259 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-06-05 20:58:40,259 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 20:58:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:58:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1330851492, now seen corresponding path program 120 times [2021-06-05 20:58:40,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:58:40,260 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583337717] [2021-06-05 20:58:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:58:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:58:40,320 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 20:58:40,320 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:58:40,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583337717] [2021-06-05 20:58:40,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583337717] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:58:40,321 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:58:40,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:58:40,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664742883] [2021-06-05 20:58:40,321 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 20:58:40,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:58:40,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 20:58:40,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 20:58:40,321 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 20:58:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:58:40,353 INFO L93 Difference]: Finished difference Result 147 states and 409 transitions. [2021-06-05 20:58:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 20:58:40,353 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 20:58:40,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:58:40,353 INFO L225 Difference]: With dead ends: 147 [2021-06-05 20:58:40,353 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 20:58:40,354 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:58:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 20:58:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 20:58:40,354 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 20:58:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 20:58:40,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-06-05 20:58:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:58:40,354 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 20:58:40,354 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 20:58:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 20:58:40,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 20:58:40,355 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-06-05 20:58:40,356 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 20:58:40,359 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 08:58:40 BasicIcfg [2021-06-05 20:58:40,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 20:58:40,359 INFO L168 Benchmark]: Toolchain (without parser) took 18624.09 ms. Allocated memory was 356.5 MB in the beginning and 658.5 MB in the end (delta: 302.0 MB). Free memory was 335.9 MB in the beginning and 604.4 MB in the end (delta: -268.5 MB). Peak memory consumption was 33.9 MB. Max. memory is 16.0 GB. [2021-06-05 20:58:40,359 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 356.5 MB. Free memory was 336.9 MB in the beginning and 336.8 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 20:58:40,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.43 ms. Allocated memory is still 356.5 MB. Free memory was 335.8 MB in the beginning and 334.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 20:58:40,359 INFO L168 Benchmark]: Boogie Preprocessor took 15.14 ms. Allocated memory is still 356.5 MB. Free memory was 334.3 MB in the beginning and 333.5 MB in the end (delta: 847.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 20:58:40,359 INFO L168 Benchmark]: RCFGBuilder took 190.10 ms. Allocated memory is still 356.5 MB. Free memory was 333.4 MB in the beginning and 323.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. [2021-06-05 20:58:40,360 INFO L168 Benchmark]: TraceAbstraction took 18382.91 ms. Allocated memory was 356.5 MB in the beginning and 658.5 MB in the end (delta: 302.0 MB). Free memory was 323.1 MB in the beginning and 604.4 MB in the end (delta: -281.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 16.0 GB. [2021-06-05 20:58:40,360 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.16 ms. Allocated memory is still 356.5 MB. Free memory was 336.9 MB in the beginning and 336.8 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 30.43 ms. Allocated memory is still 356.5 MB. Free memory was 335.8 MB in the beginning and 334.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 15.14 ms. Allocated memory is still 356.5 MB. Free memory was 334.3 MB in the beginning and 333.5 MB in the end (delta: 847.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 190.10 ms. Allocated memory is still 356.5 MB. Free memory was 333.4 MB in the beginning and 323.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18382.91 ms. Allocated memory was 356.5 MB in the beginning and 658.5 MB in the end (delta: 302.0 MB). Free memory was 323.1 MB in the beginning and 604.4 MB in the end (delta: -281.2 MB). Peak memory consumption was 21.3 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 11 procedures, 49 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18232.3ms, OverallIterations: 123, TraceHistogramMax: 1, EmptinessCheckTime: 158.6ms, AutomataDifference: 6514.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 106.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7865 SDtfs, 10029 SDslu, 14790 SDs, 0 SdLazy, 2783 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1844.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 849 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 723 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 9520.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1148occurred in iteration=0, InterpolantAutomatonStates: 849, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1745.8ms AutomataMinimizationTime, 123 MinimizatonAttempts, 44064 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 49.8ms SsaConstructionTime, 155.8ms SatisfiabilityAnalysisTime, 8887.4ms InterpolantComputationTime, 2583 NumberOfCodeBlocks, 2583 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 2460 ConstructedInterpolants, 0 QuantifiedInterpolants, 48805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 123 InterpolantComputations, 123 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...