/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:40:19,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:40:19,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:40:19,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:40:19,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:40:19,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:40:19,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:40:19,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:40:19,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:40:19,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:40:19,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:40:19,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:40:19,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:40:19,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:40:19,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:40:19,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:40:19,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:40:19,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:40:19,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:40:19,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:40:19,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:40:19,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:40:19,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:40:19,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:40:19,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:40:19,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:40:19,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:40:19,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:40:19,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:40:19,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:40:19,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:40:19,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:40:19,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:40:19,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:40:19,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:40:19,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:40:19,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:40:19,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:40:19,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:40:19,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:40:19,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:40:19,254 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-VariableLbe.epf [2020-02-10 20:40:19,274 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:40:19,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:40:19,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:40:19,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:40:19,277 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:40:19,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:40:19,277 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:40:19,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:40:19,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:40:19,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:40:19,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:40:19,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:40:19,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:40:19,280 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:40:19,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:40:19,280 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:40:19,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:40:19,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:40:19,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:40:19,281 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:40:19,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:40:19,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:40:19,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:40:19,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:40:19,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:40:19,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:40:19,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:40:19,282 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-02-10 20:40:19,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:40:19,283 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:40:19,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:40:19,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:40:19,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:40:19,583 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:40:19,584 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:40:19,585 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl [2020-02-10 20:40:19,585 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl' [2020-02-10 20:40:19,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:40:19,621 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:40:19,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:40:19,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:40:19,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:40:19,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:40:19,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:40:19,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:40:19,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:40:19,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:40:19,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:40:19,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:40:19,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:40:19,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (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 [2020-02-10 20:40:19,750 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:40:19,750 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:40:19,750 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:40:19,750 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:40:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:40:19,751 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:40:19,751 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:40:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:40:19,751 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:40:19,752 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:40:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:40:19,752 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:40:19,752 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:40:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:40:19,752 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:40:19,753 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:40:19,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:40:19,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:40:19,753 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 20:40:19,753 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 20:40:19,753 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 20:40:19,755 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:40:19,934 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:40:19,934 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:40:19,938 INFO L202 PluginConnector]: Adding new model example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:40:19 BoogieIcfgContainer [2020-02-10 20:40:19,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:40:19,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:40:19,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:40:19,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:40:19,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/2) ... [2020-02-10 20:40:19,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37646475 and model type example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:40:19, skipping insertion in model container [2020-02-10 20:40:19,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:40:19" (2/2) ... [2020-02-10 20:40:19,946 INFO L109 eAbstractionObserver]: Analyzing ICFG example_6.bpl [2020-02-10 20:40:19,956 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:40:19,956 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:40:19,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:40:19,964 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:40:20,192 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-02-10 20:40:20,214 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:40:20,215 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:40:20,215 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:40:20,215 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:40:20,215 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:40:20,215 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:40:20,215 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:40:20,215 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:40:20,231 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 63 transitions [2020-02-10 20:40:20,233 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions [2020-02-10 20:40:20,364 INFO L129 PetriNetUnfolder]: 129/213 cut-off events. [2020-02-10 20:40:20,364 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2020-02-10 20:40:20,376 INFO L76 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 213 events. 129/213 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 773 event pairs. 0/212 useless extension candidates. Maximal degree in co-relation 187. Up to 60 conditions per place. [2020-02-10 20:40:20,383 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions [2020-02-10 20:40:20,438 INFO L129 PetriNetUnfolder]: 129/213 cut-off events. [2020-02-10 20:40:20,438 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2020-02-10 20:40:20,442 INFO L76 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 213 events. 129/213 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 773 event pairs. 0/212 useless extension candidates. Maximal degree in co-relation 187. Up to 60 conditions per place. [2020-02-10 20:40:20,448 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 780 [2020-02-10 20:40:20,449 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-02-10 20:40:20,591 INFO L206 etLargeBlockEncoding]: Checked pairs total: 225 [2020-02-10 20:40:20,591 INFO L214 etLargeBlockEncoding]: Total number of compositions: 7 [2020-02-10 20:40:20,595 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 56 transitions [2020-02-10 20:40:20,680 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 794 states. [2020-02-10 20:40:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states. [2020-02-10 20:40:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:20,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:20,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:20,723 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash -773222054, now seen corresponding path program 1 times [2020-02-10 20:40:20,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:20,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157606451] [2020-02-10 20:40:20,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:20,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157606451] [2020-02-10 20:40:20,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:20,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:20,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421244065] [2020-02-10 20:40:20,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:20,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:20,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:20,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:20,928 INFO L87 Difference]: Start difference. First operand 794 states. Second operand 3 states. [2020-02-10 20:40:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:20,988 INFO L93 Difference]: Finished difference Result 602 states and 2198 transitions. [2020-02-10 20:40:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:20,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 20:40:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:21,015 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:40:21,015 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:40:21,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:40:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2020-02-10 20:40:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2020-02-10 20:40:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 2197 transitions. [2020-02-10 20:40:21,124 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 2197 transitions. Word has length 19 [2020-02-10 20:40:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:21,125 INFO L479 AbstractCegarLoop]: Abstraction has 601 states and 2197 transitions. [2020-02-10 20:40:21,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 2197 transitions. [2020-02-10 20:40:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:21,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:21,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:21,132 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:21,133 INFO L82 PathProgramCache]: Analyzing trace with hash 969558490, now seen corresponding path program 1 times [2020-02-10 20:40:21,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:21,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510656447] [2020-02-10 20:40:21,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:21,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510656447] [2020-02-10 20:40:21,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:21,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:21,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611619538] [2020-02-10 20:40:21,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:21,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:21,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:21,184 INFO L87 Difference]: Start difference. First operand 601 states and 2197 transitions. Second operand 3 states. [2020-02-10 20:40:21,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:21,207 INFO L93 Difference]: Finished difference Result 417 states and 1445 transitions. [2020-02-10 20:40:21,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:21,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 20:40:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:21,214 INFO L225 Difference]: With dead ends: 417 [2020-02-10 20:40:21,215 INFO L226 Difference]: Without dead ends: 417 [2020-02-10 20:40:21,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-02-10 20:40:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2020-02-10 20:40:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-02-10 20:40:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1445 transitions. [2020-02-10 20:40:21,261 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1445 transitions. Word has length 19 [2020-02-10 20:40:21,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:21,262 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 1445 transitions. [2020-02-10 20:40:21,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1445 transitions. [2020-02-10 20:40:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:21,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:21,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:21,267 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash 160210872, now seen corresponding path program 1 times [2020-02-10 20:40:21,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:21,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187232117] [2020-02-10 20:40:21,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:21,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187232117] [2020-02-10 20:40:21,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:21,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:21,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790495496] [2020-02-10 20:40:21,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:21,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:21,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:21,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:21,836 INFO L87 Difference]: Start difference. First operand 417 states and 1445 transitions. Second operand 8 states. [2020-02-10 20:40:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:21,981 INFO L93 Difference]: Finished difference Result 861 states and 2672 transitions. [2020-02-10 20:40:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:21,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:21,989 INFO L225 Difference]: With dead ends: 861 [2020-02-10 20:40:21,989 INFO L226 Difference]: Without dead ends: 823 [2020-02-10 20:40:21,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2020-02-10 20:40:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 447. [2020-02-10 20:40:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-02-10 20:40:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1541 transitions. [2020-02-10 20:40:22,018 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1541 transitions. Word has length 19 [2020-02-10 20:40:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:22,019 INFO L479 AbstractCegarLoop]: Abstraction has 447 states and 1541 transitions. [2020-02-10 20:40:22,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1541 transitions. [2020-02-10 20:40:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:22,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:22,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:22,022 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:22,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:22,022 INFO L82 PathProgramCache]: Analyzing trace with hash 534862058, now seen corresponding path program 2 times [2020-02-10 20:40:22,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:22,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571466780] [2020-02-10 20:40:22,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:22,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571466780] [2020-02-10 20:40:22,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:22,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:22,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151161996] [2020-02-10 20:40:22,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:22,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:22,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:22,511 INFO L87 Difference]: Start difference. First operand 447 states and 1541 transitions. Second operand 8 states. [2020-02-10 20:40:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:22,659 INFO L93 Difference]: Finished difference Result 871 states and 2699 transitions. [2020-02-10 20:40:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:22,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:22,667 INFO L225 Difference]: With dead ends: 871 [2020-02-10 20:40:22,667 INFO L226 Difference]: Without dead ends: 812 [2020-02-10 20:40:22,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-02-10 20:40:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 436. [2020-02-10 20:40:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-02-10 20:40:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1507 transitions. [2020-02-10 20:40:22,700 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1507 transitions. Word has length 19 [2020-02-10 20:40:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:22,700 INFO L479 AbstractCegarLoop]: Abstraction has 436 states and 1507 transitions. [2020-02-10 20:40:22,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1507 transitions. [2020-02-10 20:40:22,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:22,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:22,703 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:22,704 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:22,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:22,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1341600626, now seen corresponding path program 3 times [2020-02-10 20:40:22,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:22,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914293926] [2020-02-10 20:40:22,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:23,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914293926] [2020-02-10 20:40:23,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:23,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:23,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67678040] [2020-02-10 20:40:23,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:23,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:23,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:23,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:23,063 INFO L87 Difference]: Start difference. First operand 436 states and 1507 transitions. Second operand 8 states. [2020-02-10 20:40:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:23,168 INFO L93 Difference]: Finished difference Result 855 states and 2646 transitions. [2020-02-10 20:40:23,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:23,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:23,175 INFO L225 Difference]: With dead ends: 855 [2020-02-10 20:40:23,176 INFO L226 Difference]: Without dead ends: 817 [2020-02-10 20:40:23,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2020-02-10 20:40:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 445. [2020-02-10 20:40:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-02-10 20:40:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1528 transitions. [2020-02-10 20:40:23,199 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1528 transitions. Word has length 19 [2020-02-10 20:40:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:23,199 INFO L479 AbstractCegarLoop]: Abstraction has 445 states and 1528 transitions. [2020-02-10 20:40:23,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1528 transitions. [2020-02-10 20:40:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:23,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:23,202 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:23,202 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:23,203 INFO L82 PathProgramCache]: Analyzing trace with hash 365395876, now seen corresponding path program 4 times [2020-02-10 20:40:23,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:23,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305206575] [2020-02-10 20:40:23,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:23,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305206575] [2020-02-10 20:40:23,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:23,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:23,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289538063] [2020-02-10 20:40:23,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:23,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:23,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:23,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:23,633 INFO L87 Difference]: Start difference. First operand 445 states and 1528 transitions. Second operand 8 states. [2020-02-10 20:40:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:23,746 INFO L93 Difference]: Finished difference Result 861 states and 2662 transitions. [2020-02-10 20:40:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:23,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:23,752 INFO L225 Difference]: With dead ends: 861 [2020-02-10 20:40:23,753 INFO L226 Difference]: Without dead ends: 808 [2020-02-10 20:40:23,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-02-10 20:40:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 436. [2020-02-10 20:40:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-02-10 20:40:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1498 transitions. [2020-02-10 20:40:23,776 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1498 transitions. Word has length 19 [2020-02-10 20:40:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:23,777 INFO L479 AbstractCegarLoop]: Abstraction has 436 states and 1498 transitions. [2020-02-10 20:40:23,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1498 transitions. [2020-02-10 20:40:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:23,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:23,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:23,780 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:23,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:23,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1763599130, now seen corresponding path program 5 times [2020-02-10 20:40:23,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:23,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332742796] [2020-02-10 20:40:23,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:24,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332742796] [2020-02-10 20:40:24,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:24,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:24,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579998506] [2020-02-10 20:40:24,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:24,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:24,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:24,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:24,130 INFO L87 Difference]: Start difference. First operand 436 states and 1498 transitions. Second operand 8 states. [2020-02-10 20:40:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:24,235 INFO L93 Difference]: Finished difference Result 882 states and 2745 transitions. [2020-02-10 20:40:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:24,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:24,242 INFO L225 Difference]: With dead ends: 882 [2020-02-10 20:40:24,242 INFO L226 Difference]: Without dead ends: 834 [2020-02-10 20:40:24,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-02-10 20:40:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 452. [2020-02-10 20:40:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-02-10 20:40:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1546 transitions. [2020-02-10 20:40:24,266 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1546 transitions. Word has length 19 [2020-02-10 20:40:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:24,267 INFO L479 AbstractCegarLoop]: Abstraction has 452 states and 1546 transitions. [2020-02-10 20:40:24,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1546 transitions. [2020-02-10 20:40:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:24,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:24,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:24,270 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:24,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:24,271 INFO L82 PathProgramCache]: Analyzing trace with hash -905319246, now seen corresponding path program 6 times [2020-02-10 20:40:24,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:24,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857291487] [2020-02-10 20:40:24,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:24,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857291487] [2020-02-10 20:40:24,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:24,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:24,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701355208] [2020-02-10 20:40:24,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:24,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:24,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:24,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:24,563 INFO L87 Difference]: Start difference. First operand 452 states and 1546 transitions. Second operand 8 states. [2020-02-10 20:40:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:24,653 INFO L93 Difference]: Finished difference Result 878 states and 2717 transitions. [2020-02-10 20:40:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:24,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:24,661 INFO L225 Difference]: With dead ends: 878 [2020-02-10 20:40:24,662 INFO L226 Difference]: Without dead ends: 807 [2020-02-10 20:40:24,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-02-10 20:40:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 425. [2020-02-10 20:40:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-02-10 20:40:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1468 transitions. [2020-02-10 20:40:24,684 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1468 transitions. Word has length 19 [2020-02-10 20:40:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:24,684 INFO L479 AbstractCegarLoop]: Abstraction has 425 states and 1468 transitions. [2020-02-10 20:40:24,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1468 transitions. [2020-02-10 20:40:24,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:24,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:24,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:24,688 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:24,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:24,688 INFO L82 PathProgramCache]: Analyzing trace with hash 903297962, now seen corresponding path program 7 times [2020-02-10 20:40:24,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:24,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617066717] [2020-02-10 20:40:24,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:24,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617066717] [2020-02-10 20:40:24,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:24,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:24,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861746555] [2020-02-10 20:40:24,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:24,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:24,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:24,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:24,959 INFO L87 Difference]: Start difference. First operand 425 states and 1468 transitions. Second operand 8 states. [2020-02-10 20:40:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:25,024 INFO L93 Difference]: Finished difference Result 838 states and 2569 transitions. [2020-02-10 20:40:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:25,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:25,031 INFO L225 Difference]: With dead ends: 838 [2020-02-10 20:40:25,031 INFO L226 Difference]: Without dead ends: 800 [2020-02-10 20:40:25,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2020-02-10 20:40:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 442. [2020-02-10 20:40:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-02-10 20:40:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1513 transitions. [2020-02-10 20:40:25,051 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1513 transitions. Word has length 19 [2020-02-10 20:40:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:25,051 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 1513 transitions. [2020-02-10 20:40:25,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1513 transitions. [2020-02-10 20:40:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:25,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:25,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:25,054 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1277949148, now seen corresponding path program 8 times [2020-02-10 20:40:25,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:25,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981698668] [2020-02-10 20:40:25,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:25,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981698668] [2020-02-10 20:40:25,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:25,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:25,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305771357] [2020-02-10 20:40:25,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:25,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:25,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:25,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:25,317 INFO L87 Difference]: Start difference. First operand 442 states and 1513 transitions. Second operand 8 states. [2020-02-10 20:40:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:25,422 INFO L93 Difference]: Finished difference Result 848 states and 2596 transitions. [2020-02-10 20:40:25,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:25,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:25,429 INFO L225 Difference]: With dead ends: 848 [2020-02-10 20:40:25,429 INFO L226 Difference]: Without dead ends: 789 [2020-02-10 20:40:25,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2020-02-10 20:40:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 431. [2020-02-10 20:40:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-02-10 20:40:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1483 transitions. [2020-02-10 20:40:25,464 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1483 transitions. Word has length 19 [2020-02-10 20:40:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:25,464 INFO L479 AbstractCegarLoop]: Abstraction has 431 states and 1483 transitions. [2020-02-10 20:40:25,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1483 transitions. [2020-02-10 20:40:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:25,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:25,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:25,467 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1759091492, now seen corresponding path program 9 times [2020-02-10 20:40:25,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:25,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891885318] [2020-02-10 20:40:25,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:25,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891885318] [2020-02-10 20:40:25,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:25,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:25,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442837773] [2020-02-10 20:40:25,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:25,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:25,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:25,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:25,732 INFO L87 Difference]: Start difference. First operand 431 states and 1483 transitions. Second operand 8 states. [2020-02-10 20:40:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:25,796 INFO L93 Difference]: Finished difference Result 821 states and 2505 transitions. [2020-02-10 20:40:25,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:25,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:25,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:25,802 INFO L225 Difference]: With dead ends: 821 [2020-02-10 20:40:25,803 INFO L226 Difference]: Without dead ends: 783 [2020-02-10 20:40:25,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2020-02-10 20:40:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 436. [2020-02-10 20:40:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-02-10 20:40:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1492 transitions. [2020-02-10 20:40:25,823 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1492 transitions. Word has length 19 [2020-02-10 20:40:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:25,823 INFO L479 AbstractCegarLoop]: Abstraction has 436 states and 1492 transitions. [2020-02-10 20:40:25,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1492 transitions. [2020-02-10 20:40:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:25,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:25,825 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:25,825 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:25,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:25,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1008029398, now seen corresponding path program 10 times [2020-02-10 20:40:25,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:25,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314952051] [2020-02-10 20:40:25,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:26,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314952051] [2020-02-10 20:40:26,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:26,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:26,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878285143] [2020-02-10 20:40:26,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:26,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:26,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:26,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:26,060 INFO L87 Difference]: Start difference. First operand 436 states and 1492 transitions. Second operand 8 states. [2020-02-10 20:40:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:26,142 INFO L93 Difference]: Finished difference Result 820 states and 2499 transitions. [2020-02-10 20:40:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:26,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:26,148 INFO L225 Difference]: With dead ends: 820 [2020-02-10 20:40:26,148 INFO L226 Difference]: Without dead ends: 778 [2020-02-10 20:40:26,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:26,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2020-02-10 20:40:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 431. [2020-02-10 20:40:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-02-10 20:40:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1478 transitions. [2020-02-10 20:40:26,166 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1478 transitions. Word has length 19 [2020-02-10 20:40:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:26,166 INFO L479 AbstractCegarLoop]: Abstraction has 431 states and 1478 transitions. [2020-02-10 20:40:26,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1478 transitions. [2020-02-10 20:40:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:26,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:26,169 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:26,169 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:26,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:26,169 INFO L82 PathProgramCache]: Analyzing trace with hash -262091078, now seen corresponding path program 11 times [2020-02-10 20:40:26,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:26,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140632279] [2020-02-10 20:40:26,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:26,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140632279] [2020-02-10 20:40:26,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:26,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:26,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366246935] [2020-02-10 20:40:26,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:26,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:26,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:26,397 INFO L87 Difference]: Start difference. First operand 431 states and 1478 transitions. Second operand 8 states. [2020-02-10 20:40:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:26,493 INFO L93 Difference]: Finished difference Result 845 states and 2591 transitions. [2020-02-10 20:40:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:26,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:26,499 INFO L225 Difference]: With dead ends: 845 [2020-02-10 20:40:26,499 INFO L226 Difference]: Without dead ends: 797 [2020-02-10 20:40:26,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2020-02-10 20:40:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 440. [2020-02-10 20:40:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-02-10 20:40:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1500 transitions. [2020-02-10 20:40:26,525 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1500 transitions. Word has length 19 [2020-02-10 20:40:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:26,525 INFO L479 AbstractCegarLoop]: Abstraction has 440 states and 1500 transitions. [2020-02-10 20:40:26,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1500 transitions. [2020-02-10 20:40:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:26,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:26,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:26,528 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash -262685724, now seen corresponding path program 12 times [2020-02-10 20:40:26,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:26,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819535571] [2020-02-10 20:40:26,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:26,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819535571] [2020-02-10 20:40:26,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:26,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:26,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205298748] [2020-02-10 20:40:26,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:26,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:26,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:26,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:26,757 INFO L87 Difference]: Start difference. First operand 440 states and 1500 transitions. Second operand 8 states. [2020-02-10 20:40:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:26,841 INFO L93 Difference]: Finished difference Result 834 states and 2544 transitions. [2020-02-10 20:40:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:26,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:26,847 INFO L225 Difference]: With dead ends: 834 [2020-02-10 20:40:26,847 INFO L226 Difference]: Without dead ends: 782 [2020-02-10 20:40:26,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2020-02-10 20:40:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 425. [2020-02-10 20:40:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-02-10 20:40:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1462 transitions. [2020-02-10 20:40:26,866 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1462 transitions. Word has length 19 [2020-02-10 20:40:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:26,866 INFO L479 AbstractCegarLoop]: Abstraction has 425 states and 1462 transitions. [2020-02-10 20:40:26,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1462 transitions. [2020-02-10 20:40:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:26,868 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:26,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:26,868 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash -272531798, now seen corresponding path program 13 times [2020-02-10 20:40:26,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:26,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957112222] [2020-02-10 20:40:26,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:27,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957112222] [2020-02-10 20:40:27,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:27,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:27,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317032711] [2020-02-10 20:40:27,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:27,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:27,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:27,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:27,119 INFO L87 Difference]: Start difference. First operand 425 states and 1462 transitions. Second operand 8 states. [2020-02-10 20:40:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:27,190 INFO L93 Difference]: Finished difference Result 813 states and 2484 transitions. [2020-02-10 20:40:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:27,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:27,195 INFO L225 Difference]: With dead ends: 813 [2020-02-10 20:40:27,196 INFO L226 Difference]: Without dead ends: 775 [2020-02-10 20:40:27,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-02-10 20:40:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 435. [2020-02-10 20:40:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 20:40:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1490 transitions. [2020-02-10 20:40:27,213 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1490 transitions. Word has length 19 [2020-02-10 20:40:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:27,214 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1490 transitions. [2020-02-10 20:40:27,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1490 transitions. [2020-02-10 20:40:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:27,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:27,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:27,216 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:27,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:27,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1023593892, now seen corresponding path program 14 times [2020-02-10 20:40:27,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:27,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839610362] [2020-02-10 20:40:27,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:27,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839610362] [2020-02-10 20:40:27,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:27,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:27,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291545435] [2020-02-10 20:40:27,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:27,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:27,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:27,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:27,510 INFO L87 Difference]: Start difference. First operand 435 states and 1490 transitions. Second operand 8 states. [2020-02-10 20:40:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:27,644 INFO L93 Difference]: Finished difference Result 812 states and 2478 transitions. [2020-02-10 20:40:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:27,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:27,650 INFO L225 Difference]: With dead ends: 812 [2020-02-10 20:40:27,650 INFO L226 Difference]: Without dead ends: 770 [2020-02-10 20:40:27,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-02-10 20:40:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 430. [2020-02-10 20:40:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-02-10 20:40:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1476 transitions. [2020-02-10 20:40:27,671 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1476 transitions. Word has length 19 [2020-02-10 20:40:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:27,671 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1476 transitions. [2020-02-10 20:40:27,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1476 transitions. [2020-02-10 20:40:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:27,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:27,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:27,674 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:27,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1872969652, now seen corresponding path program 15 times [2020-02-10 20:40:27,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:27,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030412907] [2020-02-10 20:40:27,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:27,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030412907] [2020-02-10 20:40:27,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:27,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:27,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537531489] [2020-02-10 20:40:27,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:27,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:27,942 INFO L87 Difference]: Start difference. First operand 430 states and 1476 transitions. Second operand 8 states. [2020-02-10 20:40:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:28,004 INFO L93 Difference]: Finished difference Result 824 states and 2521 transitions. [2020-02-10 20:40:28,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:28,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:28,011 INFO L225 Difference]: With dead ends: 824 [2020-02-10 20:40:28,012 INFO L226 Difference]: Without dead ends: 786 [2020-02-10 20:40:28,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2020-02-10 20:40:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 439. [2020-02-10 20:40:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-02-10 20:40:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1497 transitions. [2020-02-10 20:40:28,029 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1497 transitions. Word has length 19 [2020-02-10 20:40:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:28,029 INFO L479 AbstractCegarLoop]: Abstraction has 439 states and 1497 transitions. [2020-02-10 20:40:28,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1497 transitions. [2020-02-10 20:40:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:28,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:28,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:28,031 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1445792894, now seen corresponding path program 16 times [2020-02-10 20:40:28,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:28,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041748550] [2020-02-10 20:40:28,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:28,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041748550] [2020-02-10 20:40:28,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:28,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:28,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582507472] [2020-02-10 20:40:28,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:28,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:28,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:28,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:28,267 INFO L87 Difference]: Start difference. First operand 439 states and 1497 transitions. Second operand 8 states. [2020-02-10 20:40:28,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:28,377 INFO L93 Difference]: Finished difference Result 830 states and 2537 transitions. [2020-02-10 20:40:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:28,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:28,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:28,384 INFO L225 Difference]: With dead ends: 830 [2020-02-10 20:40:28,384 INFO L226 Difference]: Without dead ends: 777 [2020-02-10 20:40:28,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2020-02-10 20:40:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 430. [2020-02-10 20:40:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-02-10 20:40:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1471 transitions. [2020-02-10 20:40:28,401 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1471 transitions. Word has length 19 [2020-02-10 20:40:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:28,401 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1471 transitions. [2020-02-10 20:40:28,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1471 transitions. [2020-02-10 20:40:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:28,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:28,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:28,403 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:28,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:28,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1221170070, now seen corresponding path program 17 times [2020-02-10 20:40:28,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:28,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739774838] [2020-02-10 20:40:28,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:28,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739774838] [2020-02-10 20:40:28,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:28,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:28,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738652778] [2020-02-10 20:40:28,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:28,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:28,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:28,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:28,633 INFO L87 Difference]: Start difference. First operand 430 states and 1471 transitions. Second operand 8 states. [2020-02-10 20:40:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:28,722 INFO L93 Difference]: Finished difference Result 821 states and 2512 transitions. [2020-02-10 20:40:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:28,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:28,729 INFO L225 Difference]: With dead ends: 821 [2020-02-10 20:40:28,729 INFO L226 Difference]: Without dead ends: 784 [2020-02-10 20:40:28,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-02-10 20:40:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 438. [2020-02-10 20:40:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-02-10 20:40:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1491 transitions. [2020-02-10 20:40:28,747 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1491 transitions. Word has length 19 [2020-02-10 20:40:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:28,747 INFO L479 AbstractCegarLoop]: Abstraction has 438 states and 1491 transitions. [2020-02-10 20:40:28,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1491 transitions. [2020-02-10 20:40:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:28,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:28,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:28,749 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:28,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash -362295540, now seen corresponding path program 18 times [2020-02-10 20:40:28,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:28,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162531242] [2020-02-10 20:40:28,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:28,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162531242] [2020-02-10 20:40:28,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:28,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:28,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037538131] [2020-02-10 20:40:28,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:28,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:28,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:28,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:28,989 INFO L87 Difference]: Start difference. First operand 438 states and 1491 transitions. Second operand 8 states. [2020-02-10 20:40:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:29,074 INFO L93 Difference]: Finished difference Result 828 states and 2530 transitions. [2020-02-10 20:40:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:29,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:29,079 INFO L225 Difference]: With dead ends: 828 [2020-02-10 20:40:29,079 INFO L226 Difference]: Without dead ends: 771 [2020-02-10 20:40:29,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2020-02-10 20:40:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 425. [2020-02-10 20:40:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-02-10 20:40:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1457 transitions. [2020-02-10 20:40:29,096 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1457 transitions. Word has length 19 [2020-02-10 20:40:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:29,096 INFO L479 AbstractCegarLoop]: Abstraction has 425 states and 1457 transitions. [2020-02-10 20:40:29,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1457 transitions. [2020-02-10 20:40:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:29,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:29,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:29,098 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1500056126, now seen corresponding path program 19 times [2020-02-10 20:40:29,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:29,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987533290] [2020-02-10 20:40:29,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:29,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987533290] [2020-02-10 20:40:29,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:29,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:29,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572272142] [2020-02-10 20:40:29,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:29,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:29,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:29,343 INFO L87 Difference]: Start difference. First operand 425 states and 1457 transitions. Second operand 8 states. [2020-02-10 20:40:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:29,424 INFO L93 Difference]: Finished difference Result 861 states and 2675 transitions. [2020-02-10 20:40:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:29,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:29,434 INFO L225 Difference]: With dead ends: 861 [2020-02-10 20:40:29,434 INFO L226 Difference]: Without dead ends: 813 [2020-02-10 20:40:29,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:29,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2020-02-10 20:40:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 442. [2020-02-10 20:40:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-02-10 20:40:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1515 transitions. [2020-02-10 20:40:29,463 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1515 transitions. Word has length 19 [2020-02-10 20:40:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:29,463 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 1515 transitions. [2020-02-10 20:40:29,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1515 transitions. [2020-02-10 20:40:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:29,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:29,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:29,465 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:29,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:29,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1499461480, now seen corresponding path program 20 times [2020-02-10 20:40:29,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:29,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618066466] [2020-02-10 20:40:29,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:29,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618066466] [2020-02-10 20:40:29,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:29,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:29,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469843639] [2020-02-10 20:40:29,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:29,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:29,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:29,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:29,682 INFO L87 Difference]: Start difference. First operand 442 states and 1515 transitions. Second operand 8 states. [2020-02-10 20:40:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:29,770 INFO L93 Difference]: Finished difference Result 850 states and 2628 transitions. [2020-02-10 20:40:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:29,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:29,774 INFO L225 Difference]: With dead ends: 850 [2020-02-10 20:40:29,774 INFO L226 Difference]: Without dead ends: 804 [2020-02-10 20:40:29,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2020-02-10 20:40:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 433. [2020-02-10 20:40:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-02-10 20:40:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1485 transitions. [2020-02-10 20:40:29,793 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1485 transitions. Word has length 19 [2020-02-10 20:40:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:29,794 INFO L479 AbstractCegarLoop]: Abstraction has 433 states and 1485 transitions. [2020-02-10 20:40:29,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1485 transitions. [2020-02-10 20:40:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:29,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:29,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:29,795 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1939604516, now seen corresponding path program 21 times [2020-02-10 20:40:29,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:29,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371700879] [2020-02-10 20:40:29,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:30,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371700879] [2020-02-10 20:40:30,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:30,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:30,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318816829] [2020-02-10 20:40:30,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:30,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:30,060 INFO L87 Difference]: Start difference. First operand 433 states and 1485 transitions. Second operand 8 states. [2020-02-10 20:40:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:30,164 INFO L93 Difference]: Finished difference Result 875 states and 2726 transitions. [2020-02-10 20:40:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:30,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:30,168 INFO L225 Difference]: With dead ends: 875 [2020-02-10 20:40:30,169 INFO L226 Difference]: Without dead ends: 827 [2020-02-10 20:40:30,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2020-02-10 20:40:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 449. [2020-02-10 20:40:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-02-10 20:40:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1533 transitions. [2020-02-10 20:40:30,192 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1533 transitions. Word has length 19 [2020-02-10 20:40:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:30,192 INFO L479 AbstractCegarLoop]: Abstraction has 449 states and 1533 transitions. [2020-02-10 20:40:30,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1533 transitions. [2020-02-10 20:40:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:30,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:30,194 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:30,194 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1081324632, now seen corresponding path program 22 times [2020-02-10 20:40:30,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:30,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012563571] [2020-02-10 20:40:30,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:30,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012563571] [2020-02-10 20:40:30,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:30,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:30,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117918240] [2020-02-10 20:40:30,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:30,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:30,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:30,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:30,408 INFO L87 Difference]: Start difference. First operand 449 states and 1533 transitions. Second operand 8 states. [2020-02-10 20:40:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:30,491 INFO L93 Difference]: Finished difference Result 871 states and 2698 transitions. [2020-02-10 20:40:30,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:30,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:30,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:30,495 INFO L225 Difference]: With dead ends: 871 [2020-02-10 20:40:30,496 INFO L226 Difference]: Without dead ends: 811 [2020-02-10 20:40:30,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-02-10 20:40:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 433. [2020-02-10 20:40:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-02-10 20:40:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1477 transitions. [2020-02-10 20:40:30,518 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1477 transitions. Word has length 19 [2020-02-10 20:40:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:30,518 INFO L479 AbstractCegarLoop]: Abstraction has 433 states and 1477 transitions. [2020-02-10 20:40:30,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1477 transitions. [2020-02-10 20:40:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:30,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:30,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:30,520 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:30,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:30,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1958633188, now seen corresponding path program 23 times [2020-02-10 20:40:30,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:30,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603014813] [2020-02-10 20:40:30,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:30,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603014813] [2020-02-10 20:40:30,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:30,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:30,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087978375] [2020-02-10 20:40:30,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:30,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:30,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:30,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:30,766 INFO L87 Difference]: Start difference. First operand 433 states and 1477 transitions. Second operand 8 states. [2020-02-10 20:40:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:30,850 INFO L93 Difference]: Finished difference Result 845 states and 2606 transitions. [2020-02-10 20:40:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:30,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:30,855 INFO L225 Difference]: With dead ends: 845 [2020-02-10 20:40:30,855 INFO L226 Difference]: Without dead ends: 808 [2020-02-10 20:40:30,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-02-10 20:40:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 441. [2020-02-10 20:40:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-02-10 20:40:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1497 transitions. [2020-02-10 20:40:30,872 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1497 transitions. Word has length 19 [2020-02-10 20:40:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:30,873 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 1497 transitions. [2020-02-10 20:40:30,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1497 transitions. [2020-02-10 20:40:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:30,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:30,874 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:30,875 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:30,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1099758658, now seen corresponding path program 24 times [2020-02-10 20:40:30,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:30,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925311170] [2020-02-10 20:40:30,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925311170] [2020-02-10 20:40:31,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:31,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226016715] [2020-02-10 20:40:31,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:31,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:31,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:31,097 INFO L87 Difference]: Start difference. First operand 441 states and 1497 transitions. Second operand 8 states. [2020-02-10 20:40:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,177 INFO L93 Difference]: Finished difference Result 852 states and 2624 transitions. [2020-02-10 20:40:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:31,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,179 INFO L225 Difference]: With dead ends: 852 [2020-02-10 20:40:31,179 INFO L226 Difference]: Without dead ends: 784 [2020-02-10 20:40:31,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:31,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-02-10 20:40:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 417. [2020-02-10 20:40:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-02-10 20:40:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1439 transitions. [2020-02-10 20:40:31,195 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1439 transitions. Word has length 19 [2020-02-10 20:40:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,195 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 1439 transitions. [2020-02-10 20:40:31,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1439 transitions. [2020-02-10 20:40:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:31,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:31,197 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:31,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1228367856, now seen corresponding path program 25 times [2020-02-10 20:40:31,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446792849] [2020-02-10 20:40:31,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446792849] [2020-02-10 20:40:31,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:31,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403783741] [2020-02-10 20:40:31,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:31,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:31,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:31,427 INFO L87 Difference]: Start difference. First operand 417 states and 1439 transitions. Second operand 8 states. [2020-02-10 20:40:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,488 INFO L93 Difference]: Finished difference Result 860 states and 2665 transitions. [2020-02-10 20:40:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:31,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,492 INFO L225 Difference]: With dead ends: 860 [2020-02-10 20:40:31,492 INFO L226 Difference]: Without dead ends: 822 [2020-02-10 20:40:31,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-02-10 20:40:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 446. [2020-02-10 20:40:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-02-10 20:40:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1534 transitions. [2020-02-10 20:40:31,508 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1534 transitions. Word has length 19 [2020-02-10 20:40:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,508 INFO L479 AbstractCegarLoop]: Abstraction has 446 states and 1534 transitions. [2020-02-10 20:40:31,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1534 transitions. [2020-02-10 20:40:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:31,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:31,510 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,511 INFO L82 PathProgramCache]: Analyzing trace with hash -853716670, now seen corresponding path program 26 times [2020-02-10 20:40:31,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639930868] [2020-02-10 20:40:31,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639930868] [2020-02-10 20:40:31,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:31,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955369784] [2020-02-10 20:40:31,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:31,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:31,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:31,739 INFO L87 Difference]: Start difference. First operand 446 states and 1534 transitions. Second operand 8 states. [2020-02-10 20:40:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,846 INFO L93 Difference]: Finished difference Result 870 states and 2692 transitions. [2020-02-10 20:40:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:31,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,849 INFO L225 Difference]: With dead ends: 870 [2020-02-10 20:40:31,849 INFO L226 Difference]: Without dead ends: 811 [2020-02-10 20:40:31,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-02-10 20:40:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 435. [2020-02-10 20:40:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 20:40:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1500 transitions. [2020-02-10 20:40:31,865 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1500 transitions. Word has length 19 [2020-02-10 20:40:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,865 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1500 transitions. [2020-02-10 20:40:31,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1500 transitions. [2020-02-10 20:40:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:31,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:31,867 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:31,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,867 INFO L82 PathProgramCache]: Analyzing trace with hash -46978102, now seen corresponding path program 27 times [2020-02-10 20:40:31,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558206626] [2020-02-10 20:40:31,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:32,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558206626] [2020-02-10 20:40:32,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:32,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:32,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964194955] [2020-02-10 20:40:32,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:32,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:32,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:32,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:32,079 INFO L87 Difference]: Start difference. First operand 435 states and 1500 transitions. Second operand 8 states. [2020-02-10 20:40:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:32,170 INFO L93 Difference]: Finished difference Result 854 states and 2639 transitions. [2020-02-10 20:40:32,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:32,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:32,173 INFO L225 Difference]: With dead ends: 854 [2020-02-10 20:40:32,173 INFO L226 Difference]: Without dead ends: 816 [2020-02-10 20:40:32,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2020-02-10 20:40:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 444. [2020-02-10 20:40:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-02-10 20:40:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1521 transitions. [2020-02-10 20:40:32,203 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1521 transitions. Word has length 19 [2020-02-10 20:40:32,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:32,204 INFO L479 AbstractCegarLoop]: Abstraction has 444 states and 1521 transitions. [2020-02-10 20:40:32,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1521 transitions. [2020-02-10 20:40:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:32,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:32,205 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:32,205 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1023182852, now seen corresponding path program 28 times [2020-02-10 20:40:32,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:32,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598615871] [2020-02-10 20:40:32,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:32,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598615871] [2020-02-10 20:40:32,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:32,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:32,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612389964] [2020-02-10 20:40:32,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:32,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:32,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:32,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:32,443 INFO L87 Difference]: Start difference. First operand 444 states and 1521 transitions. Second operand 8 states. [2020-02-10 20:40:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:32,551 INFO L93 Difference]: Finished difference Result 860 states and 2655 transitions. [2020-02-10 20:40:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:32,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:32,554 INFO L225 Difference]: With dead ends: 860 [2020-02-10 20:40:32,554 INFO L226 Difference]: Without dead ends: 807 [2020-02-10 20:40:32,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-02-10 20:40:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 435. [2020-02-10 20:40:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 20:40:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1491 transitions. [2020-02-10 20:40:32,570 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1491 transitions. Word has length 19 [2020-02-10 20:40:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:32,570 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1491 transitions. [2020-02-10 20:40:32,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1491 transitions. [2020-02-10 20:40:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:32,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:32,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:32,572 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:32,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:32,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1142789438, now seen corresponding path program 29 times [2020-02-10 20:40:32,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:32,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690703484] [2020-02-10 20:40:32,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:32,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690703484] [2020-02-10 20:40:32,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:32,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:32,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664414854] [2020-02-10 20:40:32,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:32,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:32,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:32,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:32,789 INFO L87 Difference]: Start difference. First operand 435 states and 1491 transitions. Second operand 8 states. [2020-02-10 20:40:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:32,872 INFO L93 Difference]: Finished difference Result 881 states and 2738 transitions. [2020-02-10 20:40:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:32,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:32,876 INFO L225 Difference]: With dead ends: 881 [2020-02-10 20:40:32,876 INFO L226 Difference]: Without dead ends: 833 [2020-02-10 20:40:32,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:32,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2020-02-10 20:40:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 451. [2020-02-10 20:40:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2020-02-10 20:40:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1539 transitions. [2020-02-10 20:40:32,893 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1539 transitions. Word has length 19 [2020-02-10 20:40:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:32,893 INFO L479 AbstractCegarLoop]: Abstraction has 451 states and 1539 transitions. [2020-02-10 20:40:32,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1539 transitions. [2020-02-10 20:40:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:32,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:32,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:32,895 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:32,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2001069322, now seen corresponding path program 30 times [2020-02-10 20:40:32,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:32,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435132915] [2020-02-10 20:40:32,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:33,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435132915] [2020-02-10 20:40:33,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:33,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:33,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460108999] [2020-02-10 20:40:33,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:33,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:33,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:33,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:33,122 INFO L87 Difference]: Start difference. First operand 451 states and 1539 transitions. Second operand 8 states. [2020-02-10 20:40:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:33,212 INFO L93 Difference]: Finished difference Result 877 states and 2710 transitions. [2020-02-10 20:40:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:33,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:33,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:33,216 INFO L225 Difference]: With dead ends: 877 [2020-02-10 20:40:33,216 INFO L226 Difference]: Without dead ends: 806 [2020-02-10 20:40:33,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-02-10 20:40:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 424. [2020-02-10 20:40:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-02-10 20:40:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1461 transitions. [2020-02-10 20:40:33,232 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1461 transitions. Word has length 19 [2020-02-10 20:40:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:33,233 INFO L479 AbstractCegarLoop]: Abstraction has 424 states and 1461 transitions. [2020-02-10 20:40:33,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1461 transitions. [2020-02-10 20:40:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:33,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,234 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,234 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,235 INFO L82 PathProgramCache]: Analyzing trace with hash 784001922, now seen corresponding path program 31 times [2020-02-10 20:40:33,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885113562] [2020-02-10 20:40:33,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:33,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885113562] [2020-02-10 20:40:33,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:33,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:33,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918171293] [2020-02-10 20:40:33,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:33,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:33,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:33,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:33,456 INFO L87 Difference]: Start difference. First operand 424 states and 1461 transitions. Second operand 8 states. [2020-02-10 20:40:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:33,530 INFO L93 Difference]: Finished difference Result 837 states and 2562 transitions. [2020-02-10 20:40:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:33,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:33,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:33,534 INFO L225 Difference]: With dead ends: 837 [2020-02-10 20:40:33,534 INFO L226 Difference]: Without dead ends: 799 [2020-02-10 20:40:33,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2020-02-10 20:40:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 441. [2020-02-10 20:40:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-02-10 20:40:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1506 transitions. [2020-02-10 20:40:33,550 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1506 transitions. Word has length 19 [2020-02-10 20:40:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:33,550 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 1506 transitions. [2020-02-10 20:40:33,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1506 transitions. [2020-02-10 20:40:33,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:33,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,552 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:33,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1158653108, now seen corresponding path program 32 times [2020-02-10 20:40:33,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642836509] [2020-02-10 20:40:33,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:33,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642836509] [2020-02-10 20:40:33,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:33,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:33,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509622822] [2020-02-10 20:40:33,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:33,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:33,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:33,794 INFO L87 Difference]: Start difference. First operand 441 states and 1506 transitions. Second operand 8 states. [2020-02-10 20:40:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:33,886 INFO L93 Difference]: Finished difference Result 847 states and 2589 transitions. [2020-02-10 20:40:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:33,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:33,891 INFO L225 Difference]: With dead ends: 847 [2020-02-10 20:40:33,892 INFO L226 Difference]: Without dead ends: 788 [2020-02-10 20:40:33,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2020-02-10 20:40:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 430. [2020-02-10 20:40:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-02-10 20:40:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1476 transitions. [2020-02-10 20:40:33,908 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1476 transitions. Word has length 19 [2020-02-10 20:40:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:33,908 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1476 transitions. [2020-02-10 20:40:33,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1476 transitions. [2020-02-10 20:40:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:33,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,910 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash 988603004, now seen corresponding path program 33 times [2020-02-10 20:40:33,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253413088] [2020-02-10 20:40:33,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:34,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253413088] [2020-02-10 20:40:34,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:34,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:34,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277234046] [2020-02-10 20:40:34,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:34,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:34,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:34,111 INFO L87 Difference]: Start difference. First operand 430 states and 1476 transitions. Second operand 8 states. [2020-02-10 20:40:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:34,179 INFO L93 Difference]: Finished difference Result 820 states and 2498 transitions. [2020-02-10 20:40:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:34,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:34,182 INFO L225 Difference]: With dead ends: 820 [2020-02-10 20:40:34,182 INFO L226 Difference]: Without dead ends: 782 [2020-02-10 20:40:34,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2020-02-10 20:40:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 435. [2020-02-10 20:40:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 20:40:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1485 transitions. [2020-02-10 20:40:34,197 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1485 transitions. Word has length 19 [2020-02-10 20:40:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:34,198 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1485 transitions. [2020-02-10 20:40:34,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1485 transitions. [2020-02-10 20:40:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:34,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:34,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:34,200 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:34,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1865254260, now seen corresponding path program 1 times [2020-02-10 20:40:34,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:34,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858094068] [2020-02-10 20:40:34,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:34,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858094068] [2020-02-10 20:40:34,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:34,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:34,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432711222] [2020-02-10 20:40:34,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:34,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:34,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:34,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:34,211 INFO L87 Difference]: Start difference. First operand 435 states and 1485 transitions. Second operand 3 states. [2020-02-10 20:40:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:34,217 INFO L93 Difference]: Finished difference Result 349 states and 1112 transitions. [2020-02-10 20:40:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:34,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 20:40:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:34,219 INFO L225 Difference]: With dead ends: 349 [2020-02-10 20:40:34,219 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 20:40:34,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 20:40:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2020-02-10 20:40:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:40:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1112 transitions. [2020-02-10 20:40:34,229 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1112 transitions. Word has length 19 [2020-02-10 20:40:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:34,229 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1112 transitions. [2020-02-10 20:40:34,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1112 transitions. [2020-02-10 20:40:34,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:34,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:34,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:34,231 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:34,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:34,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1163123542, now seen corresponding path program 34 times [2020-02-10 20:40:34,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:34,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312604718] [2020-02-10 20:40:34,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:34,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312604718] [2020-02-10 20:40:34,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:34,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:34,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413452502] [2020-02-10 20:40:34,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:34,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:34,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:34,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:34,425 INFO L87 Difference]: Start difference. First operand 349 states and 1112 transitions. Second operand 8 states. [2020-02-10 20:40:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:34,507 INFO L93 Difference]: Finished difference Result 644 states and 1770 transitions. [2020-02-10 20:40:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:34,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:34,509 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:40:34,509 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:40:34,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:40:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 346. [2020-02-10 20:40:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:40:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1105 transitions. [2020-02-10 20:40:34,521 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1105 transitions. Word has length 19 [2020-02-10 20:40:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:34,521 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1105 transitions. [2020-02-10 20:40:34,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1105 transitions. [2020-02-10 20:40:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:34,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:34,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:34,523 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -409413030, now seen corresponding path program 35 times [2020-02-10 20:40:34,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:34,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15675490] [2020-02-10 20:40:34,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:34,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15675490] [2020-02-10 20:40:34,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:34,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:34,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745700692] [2020-02-10 20:40:34,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:34,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:34,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:34,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:34,737 INFO L87 Difference]: Start difference. First operand 346 states and 1105 transitions. Second operand 8 states. [2020-02-10 20:40:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:34,830 INFO L93 Difference]: Finished difference Result 666 states and 1842 transitions. [2020-02-10 20:40:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:34,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:34,832 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:40:34,833 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:40:34,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:40:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 352. [2020-02-10 20:40:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 20:40:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1117 transitions. [2020-02-10 20:40:34,844 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1117 transitions. Word has length 19 [2020-02-10 20:40:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:34,845 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1117 transitions. [2020-02-10 20:40:34,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1117 transitions. [2020-02-10 20:40:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:34,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:34,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:34,846 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1283748356, now seen corresponding path program 36 times [2020-02-10 20:40:34,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:34,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011132461] [2020-02-10 20:40:34,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:35,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011132461] [2020-02-10 20:40:35,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:35,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:35,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618615879] [2020-02-10 20:40:35,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:35,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:35,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:35,046 INFO L87 Difference]: Start difference. First operand 352 states and 1117 transitions. Second operand 8 states. [2020-02-10 20:40:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,137 INFO L93 Difference]: Finished difference Result 656 states and 1805 transitions. [2020-02-10 20:40:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:35,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,139 INFO L225 Difference]: With dead ends: 656 [2020-02-10 20:40:35,139 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:40:35,140 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:40:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 342. [2020-02-10 20:40:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-02-10 20:40:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1096 transitions. [2020-02-10 20:40:35,150 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1096 transitions. Word has length 19 [2020-02-10 20:40:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:35,150 INFO L479 AbstractCegarLoop]: Abstraction has 342 states and 1096 transitions. [2020-02-10 20:40:35,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1096 transitions. [2020-02-10 20:40:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:35,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:35,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:35,152 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:35,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1043020286, now seen corresponding path program 37 times [2020-02-10 20:40:35,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:35,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319945729] [2020-02-10 20:40:35,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:35,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319945729] [2020-02-10 20:40:35,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:35,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:35,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749231681] [2020-02-10 20:40:35,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:35,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:35,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:35,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:35,349 INFO L87 Difference]: Start difference. First operand 342 states and 1096 transitions. Second operand 8 states. [2020-02-10 20:40:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,424 INFO L93 Difference]: Finished difference Result 637 states and 1753 transitions. [2020-02-10 20:40:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:35,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,426 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:40:35,426 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:40:35,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:40:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 348. [2020-02-10 20:40:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:40:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1110 transitions. [2020-02-10 20:40:35,435 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1110 transitions. Word has length 19 [2020-02-10 20:40:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:35,435 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1110 transitions. [2020-02-10 20:40:35,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1110 transitions. [2020-02-10 20:40:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:35,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:35,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:35,436 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1100220464, now seen corresponding path program 38 times [2020-02-10 20:40:35,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:35,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262715415] [2020-02-10 20:40:35,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:35,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262715415] [2020-02-10 20:40:35,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:35,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:35,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740893404] [2020-02-10 20:40:35,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:35,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:35,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:35,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:35,645 INFO L87 Difference]: Start difference. First operand 348 states and 1110 transitions. Second operand 8 states. [2020-02-10 20:40:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,712 INFO L93 Difference]: Finished difference Result 636 states and 1749 transitions. [2020-02-10 20:40:35,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:35,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,714 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:40:35,714 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:40:35,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:40:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 345. [2020-02-10 20:40:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-02-10 20:40:35,725 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-02-10 20:40:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:35,725 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-02-10 20:40:35,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-02-10 20:40:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:35,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:35,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:35,727 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1549366552, now seen corresponding path program 39 times [2020-02-10 20:40:35,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:35,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130650566] [2020-02-10 20:40:35,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:35,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130650566] [2020-02-10 20:40:35,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:35,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:35,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592824803] [2020-02-10 20:40:35,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:35,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:35,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:35,905 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:40:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,972 INFO L93 Difference]: Finished difference Result 646 states and 1779 transitions. [2020-02-10 20:40:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:35,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,974 INFO L225 Difference]: With dead ends: 646 [2020-02-10 20:40:35,975 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:40:35,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:40:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 351. [2020-02-10 20:40:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:40:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1114 transitions. [2020-02-10 20:40:35,983 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1114 transitions. Word has length 19 [2020-02-10 20:40:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:35,984 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1114 transitions. [2020-02-10 20:40:35,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1114 transitions. [2020-02-10 20:40:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:35,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:35,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:35,985 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:35,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1769395994, now seen corresponding path program 40 times [2020-02-10 20:40:35,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:35,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405341815] [2020-02-10 20:40:35,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:36,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405341815] [2020-02-10 20:40:36,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:36,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:36,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300432951] [2020-02-10 20:40:36,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:36,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:36,187 INFO L87 Difference]: Start difference. First operand 351 states and 1114 transitions. Second operand 8 states. [2020-02-10 20:40:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:36,298 INFO L93 Difference]: Finished difference Result 651 states and 1791 transitions. [2020-02-10 20:40:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:36,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:36,300 INFO L225 Difference]: With dead ends: 651 [2020-02-10 20:40:36,300 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:40:36,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:40:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 345. [2020-02-10 20:40:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1100 transitions. [2020-02-10 20:40:36,309 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1100 transitions. Word has length 19 [2020-02-10 20:40:36,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:36,309 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1100 transitions. [2020-02-10 20:40:36,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1100 transitions. [2020-02-10 20:40:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:36,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:36,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:36,311 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:36,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:36,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1215861966, now seen corresponding path program 41 times [2020-02-10 20:40:36,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:36,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074044442] [2020-02-10 20:40:36,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:36,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074044442] [2020-02-10 20:40:36,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:36,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:36,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535151890] [2020-02-10 20:40:36,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:36,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:36,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:36,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:36,516 INFO L87 Difference]: Start difference. First operand 345 states and 1100 transitions. Second operand 8 states. [2020-02-10 20:40:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:36,603 INFO L93 Difference]: Finished difference Result 643 states and 1772 transitions. [2020-02-10 20:40:36,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:36,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:36,605 INFO L225 Difference]: With dead ends: 643 [2020-02-10 20:40:36,605 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:40:36,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:40:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 350. [2020-02-10 20:40:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 20:40:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1110 transitions. [2020-02-10 20:40:36,613 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1110 transitions. Word has length 19 [2020-02-10 20:40:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:36,613 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1110 transitions. [2020-02-10 20:40:36,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1110 transitions. [2020-02-10 20:40:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:36,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:36,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:36,614 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:36,614 INFO L82 PathProgramCache]: Analyzing trace with hash -513185368, now seen corresponding path program 42 times [2020-02-10 20:40:36,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:36,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757666082] [2020-02-10 20:40:36,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:36,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757666082] [2020-02-10 20:40:36,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:36,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:36,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294308769] [2020-02-10 20:40:36,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:36,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:36,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:36,833 INFO L87 Difference]: Start difference. First operand 350 states and 1110 transitions. Second operand 8 states. [2020-02-10 20:40:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:36,923 INFO L93 Difference]: Finished difference Result 649 states and 1786 transitions. [2020-02-10 20:40:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:36,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:36,925 INFO L225 Difference]: With dead ends: 649 [2020-02-10 20:40:36,925 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:40:36,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:40:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 342. [2020-02-10 20:40:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-02-10 20:40:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1093 transitions. [2020-02-10 20:40:36,934 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1093 transitions. Word has length 19 [2020-02-10 20:40:36,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:36,934 INFO L479 AbstractCegarLoop]: Abstraction has 342 states and 1093 transitions. [2020-02-10 20:40:36,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1093 transitions. [2020-02-10 20:40:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:36,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:36,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:36,935 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:36,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1822419634, now seen corresponding path program 43 times [2020-02-10 20:40:36,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:36,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646015604] [2020-02-10 20:40:36,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646015604] [2020-02-10 20:40:37,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:37,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426126772] [2020-02-10 20:40:37,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:37,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:37,151 INFO L87 Difference]: Start difference. First operand 342 states and 1093 transitions. Second operand 8 states. [2020-02-10 20:40:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:37,268 INFO L93 Difference]: Finished difference Result 678 states and 1898 transitions. [2020-02-10 20:40:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:37,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:37,270 INFO L225 Difference]: With dead ends: 678 [2020-02-10 20:40:37,270 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:40:37,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:40:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 353. [2020-02-10 20:40:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 20:40:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1125 transitions. [2020-02-10 20:40:37,305 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1125 transitions. Word has length 19 [2020-02-10 20:40:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:37,306 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1125 transitions. [2020-02-10 20:40:37,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1125 transitions. [2020-02-10 20:40:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:37,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:37,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:37,308 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:37,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1598212336, now seen corresponding path program 44 times [2020-02-10 20:40:37,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:37,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390199851] [2020-02-10 20:40:37,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,629 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2020-02-10 20:40:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390199851] [2020-02-10 20:40:37,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:37,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174067371] [2020-02-10 20:40:37,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:37,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:37,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:37,635 INFO L87 Difference]: Start difference. First operand 353 states and 1125 transitions. Second operand 8 states. [2020-02-10 20:40:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:37,715 INFO L93 Difference]: Finished difference Result 668 states and 1861 transitions. [2020-02-10 20:40:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:37,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:37,717 INFO L225 Difference]: With dead ends: 668 [2020-02-10 20:40:37,717 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:40:37,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:40:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 347. [2020-02-10 20:40:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:40:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1108 transitions. [2020-02-10 20:40:37,728 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1108 transitions. Word has length 19 [2020-02-10 20:40:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:37,729 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1108 transitions. [2020-02-10 20:40:37,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1108 transitions. [2020-02-10 20:40:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:37,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:37,730 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:37,730 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:37,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash 411687860, now seen corresponding path program 45 times [2020-02-10 20:40:37,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:37,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710992090] [2020-02-10 20:40:37,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710992090] [2020-02-10 20:40:37,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:37,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674535931] [2020-02-10 20:40:37,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:37,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:37,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:37,925 INFO L87 Difference]: Start difference. First operand 347 states and 1108 transitions. Second operand 8 states. [2020-02-10 20:40:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,011 INFO L93 Difference]: Finished difference Result 690 states and 1937 transitions. [2020-02-10 20:40:38,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:38,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,013 INFO L225 Difference]: With dead ends: 690 [2020-02-10 20:40:38,014 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 20:40:38,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 20:40:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 359. [2020-02-10 20:40:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-02-10 20:40:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1139 transitions. [2020-02-10 20:40:38,026 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1139 transitions. Word has length 19 [2020-02-10 20:40:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,026 INFO L479 AbstractCegarLoop]: Abstraction has 359 states and 1139 transitions. [2020-02-10 20:40:38,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1139 transitions. [2020-02-10 20:40:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:38,027 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:38,028 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1380571900, now seen corresponding path program 46 times [2020-02-10 20:40:38,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981779960] [2020-02-10 20:40:38,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:38,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981779960] [2020-02-10 20:40:38,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:38,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:38,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696578004] [2020-02-10 20:40:38,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:38,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:38,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:38,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:38,223 INFO L87 Difference]: Start difference. First operand 359 states and 1139 transitions. Second operand 8 states. [2020-02-10 20:40:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,307 INFO L93 Difference]: Finished difference Result 686 states and 1913 transitions. [2020-02-10 20:40:38,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:38,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,308 INFO L225 Difference]: With dead ends: 686 [2020-02-10 20:40:38,308 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:40:38,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:40:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 347. [2020-02-10 20:40:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:40:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1103 transitions. [2020-02-10 20:40:38,319 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1103 transitions. Word has length 19 [2020-02-10 20:40:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,320 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1103 transitions. [2020-02-10 20:40:38,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1103 transitions. [2020-02-10 20:40:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:38,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,321 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:38,321 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1771460028, now seen corresponding path program 47 times [2020-02-10 20:40:38,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101380891] [2020-02-10 20:40:38,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:38,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101380891] [2020-02-10 20:40:38,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:38,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:38,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015730611] [2020-02-10 20:40:38,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:38,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:38,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:38,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:38,519 INFO L87 Difference]: Start difference. First operand 347 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:40:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,605 INFO L93 Difference]: Finished difference Result 663 states and 1842 transitions. [2020-02-10 20:40:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:38,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,606 INFO L225 Difference]: With dead ends: 663 [2020-02-10 20:40:38,606 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:40:38,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:40:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 352. [2020-02-10 20:40:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 20:40:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1113 transitions. [2020-02-10 20:40:38,618 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1113 transitions. Word has length 19 [2020-02-10 20:40:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,618 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1113 transitions. [2020-02-10 20:40:38,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1113 transitions. [2020-02-10 20:40:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:38,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:38,619 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash 42412694, now seen corresponding path program 48 times [2020-02-10 20:40:38,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440453698] [2020-02-10 20:40:38,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:38,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440453698] [2020-02-10 20:40:38,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:38,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:38,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318668401] [2020-02-10 20:40:38,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:38,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:38,802 INFO L87 Difference]: Start difference. First operand 352 states and 1113 transitions. Second operand 8 states. [2020-02-10 20:40:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,893 INFO L93 Difference]: Finished difference Result 669 states and 1856 transitions. [2020-02-10 20:40:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:38,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:38,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,896 INFO L225 Difference]: With dead ends: 669 [2020-02-10 20:40:38,896 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:40:38,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:40:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 337. [2020-02-10 20:40:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-02-10 20:40:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1082 transitions. [2020-02-10 20:40:38,905 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1082 transitions. Word has length 19 [2020-02-10 20:40:38,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,905 INFO L479 AbstractCegarLoop]: Abstraction has 337 states and 1082 transitions. [2020-02-10 20:40:38,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1082 transitions. [2020-02-10 20:40:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:38,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:38,906 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1950102064, now seen corresponding path program 49 times [2020-02-10 20:40:38,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124488160] [2020-02-10 20:40:38,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124488160] [2020-02-10 20:40:39,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:39,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36947299] [2020-02-10 20:40:39,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:39,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:39,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:39,124 INFO L87 Difference]: Start difference. First operand 337 states and 1082 transitions. Second operand 8 states. [2020-02-10 20:40:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,205 INFO L93 Difference]: Finished difference Result 648 states and 1785 transitions. [2020-02-10 20:40:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:39,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,207 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:40:39,207 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:40:39,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:40:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 353. [2020-02-10 20:40:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 20:40:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1124 transitions. [2020-02-10 20:40:39,225 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1124 transitions. Word has length 19 [2020-02-10 20:40:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:39,225 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1124 transitions. [2020-02-10 20:40:39,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1124 transitions. [2020-02-10 20:40:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:39,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:39,226 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:39,226 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1575450878, now seen corresponding path program 50 times [2020-02-10 20:40:39,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:39,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175214077] [2020-02-10 20:40:39,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175214077] [2020-02-10 20:40:39,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:39,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803457078] [2020-02-10 20:40:39,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:39,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:39,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:39,435 INFO L87 Difference]: Start difference. First operand 353 states and 1124 transitions. Second operand 8 states. [2020-02-10 20:40:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,531 INFO L93 Difference]: Finished difference Result 657 states and 1808 transitions. [2020-02-10 20:40:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:39,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,533 INFO L225 Difference]: With dead ends: 657 [2020-02-10 20:40:39,533 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:40:39,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:39,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:40:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 345. [2020-02-10 20:40:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:39,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1106 transitions. [2020-02-10 20:40:39,543 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1106 transitions. Word has length 19 [2020-02-10 20:40:39,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:39,543 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1106 transitions. [2020-02-10 20:40:39,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1106 transitions. [2020-02-10 20:40:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:39,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:39,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:39,544 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1745500982, now seen corresponding path program 51 times [2020-02-10 20:40:39,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:39,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110306200] [2020-02-10 20:40:39,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110306200] [2020-02-10 20:40:39,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:39,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420294607] [2020-02-10 20:40:39,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:39,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:39,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:39,754 INFO L87 Difference]: Start difference. First operand 345 states and 1106 transitions. Second operand 8 states. [2020-02-10 20:40:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,819 INFO L93 Difference]: Finished difference Result 633 states and 1736 transitions. [2020-02-10 20:40:39,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:39,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,821 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:40:39,821 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:40:39,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:40:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 348. [2020-02-10 20:40:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:40:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1110 transitions. [2020-02-10 20:40:39,831 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1110 transitions. Word has length 19 [2020-02-10 20:40:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:39,831 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1110 transitions. [2020-02-10 20:40:39,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1110 transitions. [2020-02-10 20:40:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:39,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:39,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:39,832 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:39,833 INFO L82 PathProgramCache]: Analyzing trace with hash 397739768, now seen corresponding path program 52 times [2020-02-10 20:40:39,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:39,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045949771] [2020-02-10 20:40:39,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:40,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045949771] [2020-02-10 20:40:40,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:40,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:40,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735800446] [2020-02-10 20:40:40,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:40,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:40,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:40,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:40,042 INFO L87 Difference]: Start difference. First operand 348 states and 1110 transitions. Second operand 8 states. [2020-02-10 20:40:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:40,136 INFO L93 Difference]: Finished difference Result 632 states and 1732 transitions. [2020-02-10 20:40:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:40,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:40,138 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:40:40,138 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:40:40,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:40:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 345. [2020-02-10 20:40:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-02-10 20:40:40,147 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-02-10 20:40:40,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:40,147 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-02-10 20:40:40,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-02-10 20:40:40,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:40,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:40,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:40,148 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:40,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:40,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1151450280, now seen corresponding path program 53 times [2020-02-10 20:40:40,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:40,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708648639] [2020-02-10 20:40:40,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:40,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708648639] [2020-02-10 20:40:40,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:40,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:40,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653481021] [2020-02-10 20:40:40,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:40,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:40,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:40,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:40,354 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:40:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:40,436 INFO L93 Difference]: Finished difference Result 654 states and 1804 transitions. [2020-02-10 20:40:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:40,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:40,437 INFO L225 Difference]: With dead ends: 654 [2020-02-10 20:40:40,437 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:40:40,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:40:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 351. [2020-02-10 20:40:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:40:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1115 transitions. [2020-02-10 20:40:40,447 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1115 transitions. Word has length 19 [2020-02-10 20:40:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:40,448 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1115 transitions. [2020-02-10 20:40:40,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1115 transitions. [2020-02-10 20:40:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:40,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:40,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:40,449 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:40,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:40,449 INFO L82 PathProgramCache]: Analyzing trace with hash 277114954, now seen corresponding path program 54 times [2020-02-10 20:40:40,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:40,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658878648] [2020-02-10 20:40:40,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:40,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658878648] [2020-02-10 20:40:40,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:40,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:40,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554154553] [2020-02-10 20:40:40,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:40,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:40,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:40,652 INFO L87 Difference]: Start difference. First operand 351 states and 1115 transitions. Second operand 8 states. [2020-02-10 20:40:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:40,745 INFO L93 Difference]: Finished difference Result 644 states and 1767 transitions. [2020-02-10 20:40:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:40,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:40,747 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:40:40,747 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:40:40,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:40:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 341. [2020-02-10 20:40:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:40:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1094 transitions. [2020-02-10 20:40:40,755 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1094 transitions. Word has length 19 [2020-02-10 20:40:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:40,755 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1094 transitions. [2020-02-10 20:40:40,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1094 transitions. [2020-02-10 20:40:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:40,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:40,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:40,756 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1499893780, now seen corresponding path program 55 times [2020-02-10 20:40:40,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:40,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276037442] [2020-02-10 20:40:40,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:40,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276037442] [2020-02-10 20:40:40,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:40,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:40,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131605518] [2020-02-10 20:40:40,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:40,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:40,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:40,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:40,974 INFO L87 Difference]: Start difference. First operand 341 states and 1094 transitions. Second operand 8 states. [2020-02-10 20:40:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,037 INFO L93 Difference]: Finished difference Result 658 states and 1820 transitions. [2020-02-10 20:40:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:41,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,038 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:40:41,038 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:40:41,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:40:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 355. [2020-02-10 20:40:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-02-10 20:40:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1129 transitions. [2020-02-10 20:40:41,049 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1129 transitions. Word has length 19 [2020-02-10 20:40:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,049 INFO L479 AbstractCegarLoop]: Abstraction has 355 states and 1129 transitions. [2020-02-10 20:40:41,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1129 transitions. [2020-02-10 20:40:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:41,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:41,050 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:41,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1874544966, now seen corresponding path program 56 times [2020-02-10 20:40:41,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422344587] [2020-02-10 20:40:41,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:41,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422344587] [2020-02-10 20:40:41,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:41,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797705899] [2020-02-10 20:40:41,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:41,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:41,306 INFO L87 Difference]: Start difference. First operand 355 states and 1129 transitions. Second operand 8 states. [2020-02-10 20:40:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,391 INFO L93 Difference]: Finished difference Result 667 states and 1843 transitions. [2020-02-10 20:40:41,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:41,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,393 INFO L225 Difference]: With dead ends: 667 [2020-02-10 20:40:41,393 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:40:41,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:40:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 347. [2020-02-10 20:40:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:40:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1109 transitions. [2020-02-10 20:40:41,402 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1109 transitions. Word has length 19 [2020-02-10 20:40:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,402 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1109 transitions. [2020-02-10 20:40:41,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1109 transitions. [2020-02-10 20:40:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:41,402 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:41,403 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1939279986, now seen corresponding path program 57 times [2020-02-10 20:40:41,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185421015] [2020-02-10 20:40:41,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:41,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185421015] [2020-02-10 20:40:41,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:41,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805134878] [2020-02-10 20:40:41,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:41,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:41,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:41,620 INFO L87 Difference]: Start difference. First operand 347 states and 1109 transitions. Second operand 8 states. [2020-02-10 20:40:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,683 INFO L93 Difference]: Finished difference Result 648 states and 1786 transitions. [2020-02-10 20:40:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:41,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,685 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:40:41,685 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:40:41,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:40:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 352. [2020-02-10 20:40:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 20:40:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1118 transitions. [2020-02-10 20:40:41,696 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1118 transitions. Word has length 19 [2020-02-10 20:40:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,696 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1118 transitions. [2020-02-10 20:40:41,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1118 transitions. [2020-02-10 20:40:41,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:41,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:41,697 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:41,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1604625216, now seen corresponding path program 58 times [2020-02-10 20:40:41,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900765914] [2020-02-10 20:40:41,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:41,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900765914] [2020-02-10 20:40:41,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:41,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307055800] [2020-02-10 20:40:41,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:41,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:41,902 INFO L87 Difference]: Start difference. First operand 352 states and 1118 transitions. Second operand 8 states. [2020-02-10 20:40:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,984 INFO L93 Difference]: Finished difference Result 650 states and 1790 transitions. [2020-02-10 20:40:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:41,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,986 INFO L225 Difference]: With dead ends: 650 [2020-02-10 20:40:41,986 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:40:41,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:41,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:40:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 347. [2020-02-10 20:40:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:40:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1104 transitions. [2020-02-10 20:40:41,994 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1104 transitions. Word has length 19 [2020-02-10 20:40:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,994 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1104 transitions. [2020-02-10 20:40:41,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1104 transitions. [2020-02-10 20:40:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:41,995 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,995 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:41,995 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,996 INFO L82 PathProgramCache]: Analyzing trace with hash 334504740, now seen corresponding path program 59 times [2020-02-10 20:40:41,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916195100] [2020-02-10 20:40:41,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:42,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916195100] [2020-02-10 20:40:42,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:42,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:42,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572193521] [2020-02-10 20:40:42,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:42,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:42,209 INFO L87 Difference]: Start difference. First operand 347 states and 1104 transitions. Second operand 8 states. [2020-02-10 20:40:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:42,316 INFO L93 Difference]: Finished difference Result 670 states and 1858 transitions. [2020-02-10 20:40:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:42,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:42,317 INFO L225 Difference]: With dead ends: 670 [2020-02-10 20:40:42,317 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:40:42,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:40:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 356. [2020-02-10 20:40:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2020-02-10 20:40:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1126 transitions. [2020-02-10 20:40:42,326 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 1126 transitions. Word has length 19 [2020-02-10 20:40:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:42,326 INFO L479 AbstractCegarLoop]: Abstraction has 356 states and 1126 transitions. [2020-02-10 20:40:42,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 1126 transitions. [2020-02-10 20:40:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:42,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:42,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:42,327 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:42,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:42,327 INFO L82 PathProgramCache]: Analyzing trace with hash 333910094, now seen corresponding path program 60 times [2020-02-10 20:40:42,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:42,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508610929] [2020-02-10 20:40:42,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:42,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508610929] [2020-02-10 20:40:42,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:42,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:42,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873698181] [2020-02-10 20:40:42,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:42,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:42,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:42,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:42,558 INFO L87 Difference]: Start difference. First operand 356 states and 1126 transitions. Second operand 8 states. [2020-02-10 20:40:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:42,691 INFO L93 Difference]: Finished difference Result 663 states and 1828 transitions. [2020-02-10 20:40:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:42,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:42,693 INFO L225 Difference]: With dead ends: 663 [2020-02-10 20:40:42,693 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:40:42,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:40:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 341. [2020-02-10 20:40:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:40:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1090 transitions. [2020-02-10 20:40:42,703 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1090 transitions. Word has length 19 [2020-02-10 20:40:42,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:42,703 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1090 transitions. [2020-02-10 20:40:42,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1090 transitions. [2020-02-10 20:40:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:42,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:42,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:42,705 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash -985705328, now seen corresponding path program 61 times [2020-02-10 20:40:42,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:42,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212539012] [2020-02-10 20:40:42,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212539012] [2020-02-10 20:40:43,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:43,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146458612] [2020-02-10 20:40:43,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:43,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:43,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:43,047 INFO L87 Difference]: Start difference. First operand 341 states and 1090 transitions. Second operand 8 states. [2020-02-10 20:40:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,113 INFO L93 Difference]: Finished difference Result 620 states and 1696 transitions. [2020-02-10 20:40:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:43,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,115 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:40:43,115 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:40:43,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:40:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 347. [2020-02-10 20:40:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:40:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1104 transitions. [2020-02-10 20:40:43,123 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1104 transitions. Word has length 19 [2020-02-10 20:40:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,123 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1104 transitions. [2020-02-10 20:40:43,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1104 transitions. [2020-02-10 20:40:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:43,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,124 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:43,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1157535422, now seen corresponding path program 62 times [2020-02-10 20:40:43,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241815808] [2020-02-10 20:40:43,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241815808] [2020-02-10 20:40:43,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:43,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607091344] [2020-02-10 20:40:43,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:43,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:43,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:43,342 INFO L87 Difference]: Start difference. First operand 347 states and 1104 transitions. Second operand 8 states. [2020-02-10 20:40:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,430 INFO L93 Difference]: Finished difference Result 619 states and 1692 transitions. [2020-02-10 20:40:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:43,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,432 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:40:43,432 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:40:43,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:40:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 344. [2020-02-10 20:40:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:40:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1097 transitions. [2020-02-10 20:40:43,442 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1097 transitions. Word has length 19 [2020-02-10 20:40:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,443 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1097 transitions. [2020-02-10 20:40:43,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1097 transitions. [2020-02-10 20:40:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:43,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,444 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash 108386260, now seen corresponding path program 63 times [2020-02-10 20:40:43,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444488050] [2020-02-10 20:40:43,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444488050] [2020-02-10 20:40:43,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:43,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375014426] [2020-02-10 20:40:43,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:43,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:43,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:43,665 INFO L87 Difference]: Start difference. First operand 344 states and 1097 transitions. Second operand 8 states. [2020-02-10 20:40:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,724 INFO L93 Difference]: Finished difference Result 625 states and 1710 transitions. [2020-02-10 20:40:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:43,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,726 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:40:43,726 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:40:43,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:40:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 349. [2020-02-10 20:40:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:40:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1106 transitions. [2020-02-10 20:40:43,735 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1106 transitions. Word has length 19 [2020-02-10 20:40:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,735 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1106 transitions. [2020-02-10 20:40:43,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1106 transitions. [2020-02-10 20:40:43,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:43,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,736 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,737 INFO L82 PathProgramCache]: Analyzing trace with hash -642675834, now seen corresponding path program 64 times [2020-02-10 20:40:43,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967679348] [2020-02-10 20:40:43,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967679348] [2020-02-10 20:40:43,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:43,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892029710] [2020-02-10 20:40:43,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:43,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:43,934 INFO L87 Difference]: Start difference. First operand 349 states and 1106 transitions. Second operand 8 states. [2020-02-10 20:40:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,028 INFO L93 Difference]: Finished difference Result 627 states and 1714 transitions. [2020-02-10 20:40:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:44,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,030 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:40:44,030 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:40:44,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:40:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 344. [2020-02-10 20:40:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:40:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1094 transitions. [2020-02-10 20:40:44,039 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1094 transitions. Word has length 19 [2020-02-10 20:40:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,039 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1094 transitions. [2020-02-10 20:40:44,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1094 transitions. [2020-02-10 20:40:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:44,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,040 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:44,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,041 INFO L82 PathProgramCache]: Analyzing trace with hash 517971322, now seen corresponding path program 65 times [2020-02-10 20:40:44,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975497326] [2020-02-10 20:40:44,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:44,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975497326] [2020-02-10 20:40:44,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:44,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:44,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994018818] [2020-02-10 20:40:44,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:44,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:44,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:44,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:44,265 INFO L87 Difference]: Start difference. First operand 344 states and 1094 transitions. Second operand 8 states. [2020-02-10 20:40:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,346 INFO L93 Difference]: Finished difference Result 622 states and 1703 transitions. [2020-02-10 20:40:44,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:44,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,348 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:40:44,348 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:40:44,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:40:44,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 348. [2020-02-10 20:40:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:40:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1102 transitions. [2020-02-10 20:40:44,355 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1102 transitions. Word has length 19 [2020-02-10 20:40:44,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,356 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1102 transitions. [2020-02-10 20:40:44,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1102 transitions. [2020-02-10 20:40:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:44,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,356 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,357 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:44,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2066382666, now seen corresponding path program 66 times [2020-02-10 20:40:44,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274797662] [2020-02-10 20:40:44,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:44,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274797662] [2020-02-10 20:40:44,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:44,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:44,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266050001] [2020-02-10 20:40:44,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:44,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:44,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:44,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:44,573 INFO L87 Difference]: Start difference. First operand 348 states and 1102 transitions. Second operand 8 states. [2020-02-10 20:40:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,658 INFO L93 Difference]: Finished difference Result 625 states and 1709 transitions. [2020-02-10 20:40:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:44,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,660 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:40:44,660 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:40:44,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:40:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 341. [2020-02-10 20:40:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:40:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1087 transitions. [2020-02-10 20:40:44,669 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1087 transitions. Word has length 19 [2020-02-10 20:40:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,670 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1087 transitions. [2020-02-10 20:40:44,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1087 transitions. [2020-02-10 20:40:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:44,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,671 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:44,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1775607780, now seen corresponding path program 67 times [2020-02-10 20:40:44,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727716490] [2020-02-10 20:40:44,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:44,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727716490] [2020-02-10 20:40:44,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:44,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:44,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084788466] [2020-02-10 20:40:44,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:44,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:44,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:44,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:44,853 INFO L87 Difference]: Start difference. First operand 341 states and 1087 transitions. Second operand 8 states. [2020-02-10 20:40:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,932 INFO L93 Difference]: Finished difference Result 658 states and 1828 transitions. [2020-02-10 20:40:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:44,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,934 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:40:44,934 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:40:44,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:40:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 351. [2020-02-10 20:40:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:40:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1115 transitions. [2020-02-10 20:40:44,942 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1115 transitions. Word has length 19 [2020-02-10 20:40:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,942 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1115 transitions. [2020-02-10 20:40:44,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:44,942 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1115 transitions. [2020-02-10 20:40:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:44,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,943 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:44,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1645024190, now seen corresponding path program 68 times [2020-02-10 20:40:44,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476075345] [2020-02-10 20:40:44,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476075345] [2020-02-10 20:40:45,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:45,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148241025] [2020-02-10 20:40:45,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:45,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:45,131 INFO L87 Difference]: Start difference. First operand 351 states and 1115 transitions. Second operand 8 states. [2020-02-10 20:40:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,212 INFO L93 Difference]: Finished difference Result 648 states and 1791 transitions. [2020-02-10 20:40:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:45,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,213 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:40:45,213 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:40:45,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:40:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 345. [2020-02-10 20:40:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1099 transitions. [2020-02-10 20:40:45,221 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1099 transitions. Word has length 19 [2020-02-10 20:40:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,221 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1099 transitions. [2020-02-10 20:40:45,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1099 transitions. [2020-02-10 20:40:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:45,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:45,222 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:45,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,222 INFO L82 PathProgramCache]: Analyzing trace with hash -286202784, now seen corresponding path program 69 times [2020-02-10 20:40:45,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710986947] [2020-02-10 20:40:45,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710986947] [2020-02-10 20:40:45,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:45,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126170165] [2020-02-10 20:40:45,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:45,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:45,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:45,441 INFO L87 Difference]: Start difference. First operand 345 states and 1099 transitions. Second operand 8 states. [2020-02-10 20:40:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,543 INFO L93 Difference]: Finished difference Result 664 states and 1847 transitions. [2020-02-10 20:40:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:45,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:45,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,545 INFO L225 Difference]: With dead ends: 664 [2020-02-10 20:40:45,545 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:40:45,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:40:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 354. [2020-02-10 20:40:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-02-10 20:40:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1121 transitions. [2020-02-10 20:40:45,554 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1121 transitions. Word has length 19 [2020-02-10 20:40:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,554 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 1121 transitions. [2020-02-10 20:40:45,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1121 transitions. [2020-02-10 20:40:45,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:45,555 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,555 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:45,555 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:45,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1031499928, now seen corresponding path program 70 times [2020-02-10 20:40:45,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75552757] [2020-02-10 20:40:45,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75552757] [2020-02-10 20:40:45,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:45,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838265857] [2020-02-10 20:40:45,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:45,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:45,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:45,759 INFO L87 Difference]: Start difference. First operand 354 states and 1121 transitions. Second operand 8 states. [2020-02-10 20:40:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,840 INFO L93 Difference]: Finished difference Result 657 states and 1817 transitions. [2020-02-10 20:40:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:45,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,841 INFO L225 Difference]: With dead ends: 657 [2020-02-10 20:40:45,842 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:40:45,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:40:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 345. [2020-02-10 20:40:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1095 transitions. [2020-02-10 20:40:45,850 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1095 transitions. Word has length 19 [2020-02-10 20:40:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,850 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1095 transitions. [2020-02-10 20:40:45,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1095 transitions. [2020-02-10 20:40:45,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:45,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,851 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:45,851 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1073569384, now seen corresponding path program 71 times [2020-02-10 20:40:45,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231525937] [2020-02-10 20:40:45,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231525937] [2020-02-10 20:40:46,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:46,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113073694] [2020-02-10 20:40:46,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:46,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:46,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:46,027 INFO L87 Difference]: Start difference. First operand 345 states and 1095 transitions. Second operand 8 states. [2020-02-10 20:40:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,109 INFO L93 Difference]: Finished difference Result 639 states and 1762 transitions. [2020-02-10 20:40:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:46,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,111 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:40:46,111 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:40:46,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:40:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 349. [2020-02-10 20:40:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:40:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1103 transitions. [2020-02-10 20:40:46,118 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1103 transitions. Word has length 19 [2020-02-10 20:40:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,119 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1103 transitions. [2020-02-10 20:40:46,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1103 transitions. [2020-02-10 20:40:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:46,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:46,120 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1510784604, now seen corresponding path program 72 times [2020-02-10 20:40:46,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246009778] [2020-02-10 20:40:46,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246009778] [2020-02-10 20:40:46,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:46,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624238020] [2020-02-10 20:40:46,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:46,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:46,309 INFO L87 Difference]: Start difference. First operand 349 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:40:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,392 INFO L93 Difference]: Finished difference Result 642 states and 1768 transitions. [2020-02-10 20:40:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:46,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,394 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:40:46,394 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:40:46,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:40:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2020-02-10 20:40:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-02-10 20:40:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1078 transitions. [2020-02-10 20:40:46,402 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1078 transitions. Word has length 19 [2020-02-10 20:40:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,402 INFO L479 AbstractCegarLoop]: Abstraction has 337 states and 1078 transitions. [2020-02-10 20:40:46,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1078 transitions. [2020-02-10 20:40:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:46,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:46,403 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash 458482122, now seen corresponding path program 73 times [2020-02-10 20:40:46,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767689879] [2020-02-10 20:40:46,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767689879] [2020-02-10 20:40:46,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:46,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331408503] [2020-02-10 20:40:46,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:46,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:46,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:46,633 INFO L87 Difference]: Start difference. First operand 337 states and 1078 transitions. Second operand 8 states. [2020-02-10 20:40:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,697 INFO L93 Difference]: Finished difference Result 609 states and 1671 transitions. [2020-02-10 20:40:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:46,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,699 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:40:46,699 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:40:46,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:40:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 346. [2020-02-10 20:40:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:40:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1105 transitions. [2020-02-10 20:40:46,707 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1105 transitions. Word has length 19 [2020-02-10 20:40:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,708 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1105 transitions. [2020-02-10 20:40:46,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1105 transitions. [2020-02-10 20:40:46,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:46,708 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,709 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:46,709 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1693244424, now seen corresponding path program 74 times [2020-02-10 20:40:46,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832134759] [2020-02-10 20:40:46,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832134759] [2020-02-10 20:40:46,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:46,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600971339] [2020-02-10 20:40:46,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:46,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:46,918 INFO L87 Difference]: Start difference. First operand 346 states and 1105 transitions. Second operand 8 states. [2020-02-10 20:40:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:47,004 INFO L93 Difference]: Finished difference Result 608 states and 1667 transitions. [2020-02-10 20:40:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:47,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:47,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:47,007 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:40:47,007 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:40:47,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:40:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 343. [2020-02-10 20:40:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:40:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1098 transitions. [2020-02-10 20:40:47,017 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1098 transitions. Word has length 19 [2020-02-10 20:40:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:47,017 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1098 transitions. [2020-02-10 20:40:47,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1098 transitions. [2020-02-10 20:40:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:47,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:47,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:47,019 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1552573710, now seen corresponding path program 75 times [2020-02-10 20:40:47,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:47,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624570658] [2020-02-10 20:40:47,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:47,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624570658] [2020-02-10 20:40:47,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:47,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:47,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041112117] [2020-02-10 20:40:47,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:47,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:47,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:47,234 INFO L87 Difference]: Start difference. First operand 343 states and 1098 transitions. Second operand 8 states. [2020-02-10 20:40:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:47,299 INFO L93 Difference]: Finished difference Result 614 states and 1685 transitions. [2020-02-10 20:40:47,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:47,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:47,301 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:40:47,301 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:40:47,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:40:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 348. [2020-02-10 20:40:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:40:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1107 transitions. [2020-02-10 20:40:47,309 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1107 transitions. Word has length 19 [2020-02-10 20:40:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:47,309 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1107 transitions. [2020-02-10 20:40:47,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1107 transitions. [2020-02-10 20:40:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:47,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:47,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:47,310 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash 801511616, now seen corresponding path program 76 times [2020-02-10 20:40:47,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:47,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012329207] [2020-02-10 20:40:47,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:47,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012329207] [2020-02-10 20:40:47,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:47,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:47,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996762872] [2020-02-10 20:40:47,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:47,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:47,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:47,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:47,527 INFO L87 Difference]: Start difference. First operand 348 states and 1107 transitions. Second operand 8 states. [2020-02-10 20:40:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:47,616 INFO L93 Difference]: Finished difference Result 616 states and 1689 transitions. [2020-02-10 20:40:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:47,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:47,618 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:40:47,618 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:40:47,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:40:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 343. [2020-02-10 20:40:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:40:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1095 transitions. [2020-02-10 20:40:47,627 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1095 transitions. Word has length 19 [2020-02-10 20:40:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:47,627 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1095 transitions. [2020-02-10 20:40:47,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1095 transitions. [2020-02-10 20:40:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:47,628 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:47,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:47,628 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:47,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:47,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1962158772, now seen corresponding path program 77 times [2020-02-10 20:40:47,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:47,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574689207] [2020-02-10 20:40:47,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:47,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574689207] [2020-02-10 20:40:47,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:47,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:47,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247367457] [2020-02-10 20:40:47,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:47,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:47,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:47,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:47,832 INFO L87 Difference]: Start difference. First operand 343 states and 1095 transitions. Second operand 8 states. [2020-02-10 20:40:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:47,915 INFO L93 Difference]: Finished difference Result 611 states and 1678 transitions. [2020-02-10 20:40:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:47,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:47,917 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:40:47,917 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:40:47,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:40:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 347. [2020-02-10 20:40:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:40:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1103 transitions. [2020-02-10 20:40:47,924 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1103 transitions. Word has length 19 [2020-02-10 20:40:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:47,924 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1103 transitions. [2020-02-10 20:40:47,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1103 transitions. [2020-02-10 20:40:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:47,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:47,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:47,925 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:47,925 INFO L82 PathProgramCache]: Analyzing trace with hash -622195216, now seen corresponding path program 78 times [2020-02-10 20:40:47,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:47,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300791054] [2020-02-10 20:40:47,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:48,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300791054] [2020-02-10 20:40:48,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:48,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:48,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744071735] [2020-02-10 20:40:48,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:48,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:48,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:48,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:48,128 INFO L87 Difference]: Start difference. First operand 347 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:40:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:48,212 INFO L93 Difference]: Finished difference Result 614 states and 1684 transitions. [2020-02-10 20:40:48,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:48,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:48,214 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:40:48,214 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:40:48,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:40:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 340. [2020-02-10 20:40:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 20:40:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1088 transitions. [2020-02-10 20:40:48,223 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1088 transitions. Word has length 19 [2020-02-10 20:40:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:48,223 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1088 transitions. [2020-02-10 20:40:48,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1088 transitions. [2020-02-10 20:40:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:48,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:48,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:48,225 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1910451096, now seen corresponding path program 79 times [2020-02-10 20:40:48,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:48,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860546146] [2020-02-10 20:40:48,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:48,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860546146] [2020-02-10 20:40:48,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:48,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:48,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365770565] [2020-02-10 20:40:48,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:48,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:48,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:48,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:48,419 INFO L87 Difference]: Start difference. First operand 340 states and 1088 transitions. Second operand 8 states. [2020-02-10 20:40:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:48,488 INFO L93 Difference]: Finished difference Result 614 states and 1683 transitions. [2020-02-10 20:40:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:48,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:48,489 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:40:48,489 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:40:48,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:40:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 346. [2020-02-10 20:40:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:40:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1102 transitions. [2020-02-10 20:40:48,496 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1102 transitions. Word has length 19 [2020-02-10 20:40:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:48,497 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1102 transitions. [2020-02-10 20:40:48,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1102 transitions. [2020-02-10 20:40:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:48,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:48,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:48,498 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:48,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:48,498 INFO L82 PathProgramCache]: Analyzing trace with hash 232789654, now seen corresponding path program 80 times [2020-02-10 20:40:48,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:48,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585773220] [2020-02-10 20:40:48,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:48,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585773220] [2020-02-10 20:40:48,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:48,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:48,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676137394] [2020-02-10 20:40:48,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:48,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:48,671 INFO L87 Difference]: Start difference. First operand 346 states and 1102 transitions. Second operand 8 states. [2020-02-10 20:40:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:48,752 INFO L93 Difference]: Finished difference Result 613 states and 1679 transitions. [2020-02-10 20:40:48,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:48,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:48,754 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:40:48,754 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:40:48,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:40:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 343. [2020-02-10 20:40:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:40:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1095 transitions. [2020-02-10 20:40:48,761 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1095 transitions. Word has length 19 [2020-02-10 20:40:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:48,762 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1095 transitions. [2020-02-10 20:40:48,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1095 transitions. [2020-02-10 20:40:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:48,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:48,762 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:48,763 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:48,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1878169934, now seen corresponding path program 81 times [2020-02-10 20:40:48,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:48,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685955436] [2020-02-10 20:40:48,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:48,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685955436] [2020-02-10 20:40:48,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:48,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:48,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953119302] [2020-02-10 20:40:48,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:48,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:48,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:48,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:48,949 INFO L87 Difference]: Start difference. First operand 343 states and 1095 transitions. Second operand 8 states. [2020-02-10 20:40:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:49,025 INFO L93 Difference]: Finished difference Result 623 states and 1709 transitions. [2020-02-10 20:40:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:49,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:49,027 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:40:49,027 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:40:49,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:40:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 349. [2020-02-10 20:40:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:40:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1106 transitions. [2020-02-10 20:40:49,035 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1106 transitions. Word has length 19 [2020-02-10 20:40:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:49,035 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1106 transitions. [2020-02-10 20:40:49,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1106 transitions. [2020-02-10 20:40:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:49,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:49,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:49,037 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:49,037 INFO L82 PathProgramCache]: Analyzing trace with hash 901965184, now seen corresponding path program 82 times [2020-02-10 20:40:49,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:49,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51777625] [2020-02-10 20:40:49,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:49,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51777625] [2020-02-10 20:40:49,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:49,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:49,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490957964] [2020-02-10 20:40:49,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:49,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:49,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:49,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:49,297 INFO L87 Difference]: Start difference. First operand 349 states and 1106 transitions. Second operand 8 states. [2020-02-10 20:40:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:49,371 INFO L93 Difference]: Finished difference Result 628 states and 1721 transitions. [2020-02-10 20:40:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:49,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:49,372 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:40:49,372 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:40:49,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:40:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 343. [2020-02-10 20:40:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:40:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1092 transitions. [2020-02-10 20:40:49,380 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1092 transitions. Word has length 19 [2020-02-10 20:40:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:49,381 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1092 transitions. [2020-02-10 20:40:49,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1092 transitions. [2020-02-10 20:40:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:49,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:49,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:49,382 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash 348431156, now seen corresponding path program 83 times [2020-02-10 20:40:49,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:49,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244110428] [2020-02-10 20:40:49,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:49,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244110428] [2020-02-10 20:40:49,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:49,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:49,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469326221] [2020-02-10 20:40:49,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:49,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:49,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:49,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:49,584 INFO L87 Difference]: Start difference. First operand 343 states and 1092 transitions. Second operand 8 states. [2020-02-10 20:40:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:49,686 INFO L93 Difference]: Finished difference Result 620 states and 1702 transitions. [2020-02-10 20:40:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:49,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:49,688 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:40:49,688 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:40:49,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:40:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 348. [2020-02-10 20:40:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:40:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1102 transitions. [2020-02-10 20:40:49,696 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1102 transitions. Word has length 19 [2020-02-10 20:40:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:49,696 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1102 transitions. [2020-02-10 20:40:49,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1102 transitions. [2020-02-10 20:40:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:49,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:49,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:49,697 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:49,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1380616178, now seen corresponding path program 84 times [2020-02-10 20:40:49,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:49,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057616283] [2020-02-10 20:40:49,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:49,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057616283] [2020-02-10 20:40:49,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:49,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:49,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705982569] [2020-02-10 20:40:49,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:49,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:49,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:49,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:49,873 INFO L87 Difference]: Start difference. First operand 348 states and 1102 transitions. Second operand 8 states. [2020-02-10 20:40:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:49,956 INFO L93 Difference]: Finished difference Result 626 states and 1716 transitions. [2020-02-10 20:40:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:49,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:49,958 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:40:49,958 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:40:49,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:40:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 340. [2020-02-10 20:40:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 20:40:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1085 transitions. [2020-02-10 20:40:49,965 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1085 transitions. Word has length 19 [2020-02-10 20:40:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:49,965 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1085 transitions. [2020-02-10 20:40:49,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1085 transitions. [2020-02-10 20:40:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:49,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:49,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:49,966 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1259258648, now seen corresponding path program 85 times [2020-02-10 20:40:49,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:49,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73273233] [2020-02-10 20:40:49,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:50,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73273233] [2020-02-10 20:40:50,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:50,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:50,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116027223] [2020-02-10 20:40:50,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:50,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:50,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:50,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:50,185 INFO L87 Difference]: Start difference. First operand 340 states and 1085 transitions. Second operand 8 states. [2020-02-10 20:40:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:50,259 INFO L93 Difference]: Finished difference Result 629 states and 1736 transitions. [2020-02-10 20:40:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:50,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:50,260 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:40:50,260 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:40:50,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:40:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 350. [2020-02-10 20:40:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 20:40:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1113 transitions. [2020-02-10 20:40:50,269 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1113 transitions. Word has length 19 [2020-02-10 20:40:50,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:50,269 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1113 transitions. [2020-02-10 20:40:50,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1113 transitions. [2020-02-10 20:40:50,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:50,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:50,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:50,271 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:50,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:50,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2010320742, now seen corresponding path program 86 times [2020-02-10 20:40:50,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:50,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449134993] [2020-02-10 20:40:50,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:50,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449134993] [2020-02-10 20:40:50,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:50,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:50,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674586835] [2020-02-10 20:40:50,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:50,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:50,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:50,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:50,485 INFO L87 Difference]: Start difference. First operand 350 states and 1113 transitions. Second operand 8 states. [2020-02-10 20:40:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:50,562 INFO L93 Difference]: Finished difference Result 631 states and 1740 transitions. [2020-02-10 20:40:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:50,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:50,564 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:40:50,564 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:40:50,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:40:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 345. [2020-02-10 20:40:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1099 transitions. [2020-02-10 20:40:50,572 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1099 transitions. Word has length 19 [2020-02-10 20:40:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:50,572 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1099 transitions. [2020-02-10 20:40:50,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1099 transitions. [2020-02-10 20:40:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:50,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:50,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:50,573 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1435270794, now seen corresponding path program 87 times [2020-02-10 20:40:50,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:50,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551555930] [2020-02-10 20:40:50,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:50,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551555930] [2020-02-10 20:40:50,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:50,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:50,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490767154] [2020-02-10 20:40:50,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:50,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:50,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:50,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:50,781 INFO L87 Difference]: Start difference. First operand 345 states and 1099 transitions. Second operand 8 states. [2020-02-10 20:40:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:50,877 INFO L93 Difference]: Finished difference Result 633 states and 1743 transitions. [2020-02-10 20:40:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:50,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:50,879 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:40:50,879 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:40:50,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:40:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 351. [2020-02-10 20:40:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:40:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1110 transitions. [2020-02-10 20:40:50,888 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1110 transitions. Word has length 19 [2020-02-10 20:40:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:50,889 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1110 transitions. [2020-02-10 20:40:50,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1110 transitions. [2020-02-10 20:40:50,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:50,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:50,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:50,890 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash 459066044, now seen corresponding path program 88 times [2020-02-10 20:40:50,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:50,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861826980] [2020-02-10 20:40:50,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:51,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861826980] [2020-02-10 20:40:51,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:51,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:51,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294851306] [2020-02-10 20:40:51,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:51,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:51,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:51,101 INFO L87 Difference]: Start difference. First operand 351 states and 1110 transitions. Second operand 8 states. [2020-02-10 20:40:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:51,187 INFO L93 Difference]: Finished difference Result 638 states and 1755 transitions. [2020-02-10 20:40:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:51,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:51,188 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:40:51,189 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:40:51,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:40:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 345. [2020-02-10 20:40:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1094 transitions. [2020-02-10 20:40:51,196 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1094 transitions. Word has length 19 [2020-02-10 20:40:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:51,196 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1094 transitions. [2020-02-10 20:40:51,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1094 transitions. [2020-02-10 20:40:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:51,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:51,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:51,197 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:51,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2087070376, now seen corresponding path program 89 times [2020-02-10 20:40:51,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:51,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874076063] [2020-02-10 20:40:51,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:51,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874076063] [2020-02-10 20:40:51,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:51,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:51,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116918482] [2020-02-10 20:40:51,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:51,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:51,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:51,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:51,478 INFO L87 Difference]: Start difference. First operand 345 states and 1094 transitions. Second operand 8 states. [2020-02-10 20:40:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:51,583 INFO L93 Difference]: Finished difference Result 639 states and 1767 transitions. [2020-02-10 20:40:51,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:51,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:51,586 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:40:51,586 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:40:51,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:40:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 353. [2020-02-10 20:40:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 20:40:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1114 transitions. [2020-02-10 20:40:51,601 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1114 transitions. Word has length 19 [2020-02-10 20:40:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:51,601 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1114 transitions. [2020-02-10 20:40:51,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1114 transitions. [2020-02-10 20:40:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:51,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:51,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:51,603 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:51,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:51,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1349022390, now seen corresponding path program 90 times [2020-02-10 20:40:51,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:51,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79777746] [2020-02-10 20:40:51,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:51,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79777746] [2020-02-10 20:40:51,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:51,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:51,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888346488] [2020-02-10 20:40:51,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:51,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:51,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:51,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:51,826 INFO L87 Difference]: Start difference. First operand 353 states and 1114 transitions. Second operand 8 states. [2020-02-10 20:40:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:51,902 INFO L93 Difference]: Finished difference Result 642 states and 1768 transitions. [2020-02-10 20:40:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:51,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:51,904 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:40:51,904 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:40:51,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:40:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 340. [2020-02-10 20:40:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 20:40:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1082 transitions. [2020-02-10 20:40:51,910 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1082 transitions. Word has length 19 [2020-02-10 20:40:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:51,910 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1082 transitions. [2020-02-10 20:40:51,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1082 transitions. [2020-02-10 20:40:51,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:51,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:51,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:51,911 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:51,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:51,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1252078038, now seen corresponding path program 91 times [2020-02-10 20:40:51,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:51,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134304454] [2020-02-10 20:40:51,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:52,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134304454] [2020-02-10 20:40:52,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:52,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:52,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883154174] [2020-02-10 20:40:52,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:52,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:52,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:52,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:52,119 INFO L87 Difference]: Start difference. First operand 340 states and 1082 transitions. Second operand 8 states. [2020-02-10 20:40:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:52,203 INFO L93 Difference]: Finished difference Result 622 states and 1721 transitions. [2020-02-10 20:40:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:52,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:52,204 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:40:52,204 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:40:52,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:40:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 348. [2020-02-10 20:40:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:40:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1106 transitions. [2020-02-10 20:40:52,212 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1106 transitions. Word has length 19 [2020-02-10 20:40:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:52,212 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1106 transitions. [2020-02-10 20:40:52,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1106 transitions. [2020-02-10 20:40:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:52,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:52,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:52,213 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:52,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1332275950, now seen corresponding path program 92 times [2020-02-10 20:40:52,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:52,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365060021] [2020-02-10 20:40:52,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:52,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365060021] [2020-02-10 20:40:52,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:52,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:52,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865214699] [2020-02-10 20:40:52,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:52,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:52,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:52,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:52,419 INFO L87 Difference]: Start difference. First operand 348 states and 1106 transitions. Second operand 8 states. [2020-02-10 20:40:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:52,508 INFO L93 Difference]: Finished difference Result 625 states and 1727 transitions. [2020-02-10 20:40:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:52,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:52,510 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:40:52,510 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:40:52,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:40:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 344. [2020-02-10 20:40:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:40:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1094 transitions. [2020-02-10 20:40:52,518 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1094 transitions. Word has length 19 [2020-02-10 20:40:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:52,518 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1094 transitions. [2020-02-10 20:40:52,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1094 transitions. [2020-02-10 20:40:52,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:52,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:52,519 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:52,519 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:52,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:52,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1996780536, now seen corresponding path program 93 times [2020-02-10 20:40:52,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:52,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88869843] [2020-02-10 20:40:52,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:52,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88869843] [2020-02-10 20:40:52,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:52,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:52,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432146615] [2020-02-10 20:40:52,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:52,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:52,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:52,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:52,725 INFO L87 Difference]: Start difference. First operand 344 states and 1094 transitions. Second operand 8 states. [2020-02-10 20:40:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:52,842 INFO L93 Difference]: Finished difference Result 626 states and 1729 transitions. [2020-02-10 20:40:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:52,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:52,844 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:40:52,844 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:40:52,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:40:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 349. [2020-02-10 20:40:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:40:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1104 transitions. [2020-02-10 20:40:52,851 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1104 transitions. Word has length 19 [2020-02-10 20:40:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:52,851 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1104 transitions. [2020-02-10 20:40:52,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1104 transitions. [2020-02-10 20:40:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:52,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:52,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:52,852 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:52,853 INFO L82 PathProgramCache]: Analyzing trace with hash 267733202, now seen corresponding path program 94 times [2020-02-10 20:40:52,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:52,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777892365] [2020-02-10 20:40:52,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:53,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777892365] [2020-02-10 20:40:53,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:53,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:53,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441055209] [2020-02-10 20:40:53,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:53,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:53,049 INFO L87 Difference]: Start difference. First operand 349 states and 1104 transitions. Second operand 8 states. [2020-02-10 20:40:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:53,135 INFO L93 Difference]: Finished difference Result 632 states and 1743 transitions. [2020-02-10 20:40:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:53,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:53,137 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:40:53,137 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:40:53,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:40:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 344. [2020-02-10 20:40:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:40:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1090 transitions. [2020-02-10 20:40:53,144 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1090 transitions. Word has length 19 [2020-02-10 20:40:53,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:53,144 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1090 transitions. [2020-02-10 20:40:53,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1090 transitions. [2020-02-10 20:40:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:53,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:53,145 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:53,145 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:53,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:53,146 INFO L82 PathProgramCache]: Analyzing trace with hash 901831544, now seen corresponding path program 95 times [2020-02-10 20:40:53,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:53,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115096027] [2020-02-10 20:40:53,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:53,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115096027] [2020-02-10 20:40:53,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:53,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:53,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312707875] [2020-02-10 20:40:53,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:53,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:53,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:53,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:53,352 INFO L87 Difference]: Start difference. First operand 344 states and 1090 transitions. Second operand 8 states. [2020-02-10 20:40:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:53,443 INFO L93 Difference]: Finished difference Result 635 states and 1758 transitions. [2020-02-10 20:40:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:53,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:53,445 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:40:53,445 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:40:53,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:40:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 352. [2020-02-10 20:40:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 20:40:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1110 transitions. [2020-02-10 20:40:53,455 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1110 transitions. Word has length 19 [2020-02-10 20:40:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:53,455 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1110 transitions. [2020-02-10 20:40:53,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1110 transitions. [2020-02-10 20:40:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:53,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:53,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:53,456 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:53,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:53,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1757138198, now seen corresponding path program 96 times [2020-02-10 20:40:53,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:53,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999087064] [2020-02-10 20:40:53,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:53,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999087064] [2020-02-10 20:40:53,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:53,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:53,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155007765] [2020-02-10 20:40:53,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:53,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:53,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:53,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:53,652 INFO L87 Difference]: Start difference. First operand 352 states and 1110 transitions. Second operand 8 states. [2020-02-10 20:40:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:53,749 INFO L93 Difference]: Finished difference Result 638 states and 1759 transitions. [2020-02-10 20:40:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:53,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:53,750 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:40:53,751 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:40:53,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:40:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 337. [2020-02-10 20:40:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-02-10 20:40:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1075 transitions. [2020-02-10 20:40:53,759 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1075 transitions. Word has length 19 [2020-02-10 20:40:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:53,759 INFO L479 AbstractCegarLoop]: Abstraction has 337 states and 1075 transitions. [2020-02-10 20:40:53,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1075 transitions. [2020-02-10 20:40:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:53,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:53,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:53,760 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:53,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1665827752, now seen corresponding path program 97 times [2020-02-10 20:40:53,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:53,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359802279] [2020-02-10 20:40:53,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:53,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359802279] [2020-02-10 20:40:53,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:53,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:53,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884474384] [2020-02-10 20:40:53,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:53,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:53,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:53,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:53,959 INFO L87 Difference]: Start difference. First operand 337 states and 1075 transitions. Second operand 8 states. [2020-02-10 20:40:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:54,084 INFO L93 Difference]: Finished difference Result 676 states and 1927 transitions. [2020-02-10 20:40:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:54,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:54,086 INFO L225 Difference]: With dead ends: 676 [2020-02-10 20:40:54,086 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 20:40:54,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 20:40:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 351. [2020-02-10 20:40:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:40:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1123 transitions. [2020-02-10 20:40:54,102 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1123 transitions. Word has length 19 [2020-02-10 20:40:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:54,102 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1123 transitions. [2020-02-10 20:40:54,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1123 transitions. [2020-02-10 20:40:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:54,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:54,104 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:54,104 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:54,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash 791492426, now seen corresponding path program 98 times [2020-02-10 20:40:54,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:54,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551456465] [2020-02-10 20:40:54,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:54,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551456465] [2020-02-10 20:40:54,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:54,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:54,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887235952] [2020-02-10 20:40:54,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:54,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:54,303 INFO L87 Difference]: Start difference. First operand 351 states and 1123 transitions. Second operand 8 states. [2020-02-10 20:40:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:54,381 INFO L93 Difference]: Finished difference Result 666 states and 1890 transitions. [2020-02-10 20:40:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:54,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:54,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:54,383 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:40:54,383 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:40:54,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:40:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 345. [2020-02-10 20:40:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1107 transitions. [2020-02-10 20:40:54,392 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1107 transitions. Word has length 19 [2020-02-10 20:40:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:54,392 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1107 transitions. [2020-02-10 20:40:54,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1107 transitions. [2020-02-10 20:40:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:54,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:54,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:54,393 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:54,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1139734548, now seen corresponding path program 99 times [2020-02-10 20:40:54,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:54,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541517737] [2020-02-10 20:40:54,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:54,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541517737] [2020-02-10 20:40:54,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:54,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:54,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565784802] [2020-02-10 20:40:54,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:54,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:54,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:54,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:54,571 INFO L87 Difference]: Start difference. First operand 345 states and 1107 transitions. Second operand 8 states. [2020-02-10 20:40:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:54,651 INFO L93 Difference]: Finished difference Result 682 states and 1946 transitions. [2020-02-10 20:40:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:54,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:54,653 INFO L225 Difference]: With dead ends: 682 [2020-02-10 20:40:54,653 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:40:54,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:40:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 354. [2020-02-10 20:40:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-02-10 20:40:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1129 transitions. [2020-02-10 20:40:54,661 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1129 transitions. Word has length 19 [2020-02-10 20:40:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:54,661 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 1129 transitions. [2020-02-10 20:40:54,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1129 transitions. [2020-02-10 20:40:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:54,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:54,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:54,662 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:54,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:54,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1885031692, now seen corresponding path program 100 times [2020-02-10 20:40:54,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:54,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924591124] [2020-02-10 20:40:54,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:54,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924591124] [2020-02-10 20:40:54,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:54,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:54,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629035996] [2020-02-10 20:40:54,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:54,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:54,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:54,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:54,856 INFO L87 Difference]: Start difference. First operand 354 states and 1129 transitions. Second operand 8 states. [2020-02-10 20:40:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:54,938 INFO L93 Difference]: Finished difference Result 675 states and 1916 transitions. [2020-02-10 20:40:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:54,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:54,940 INFO L225 Difference]: With dead ends: 675 [2020-02-10 20:40:54,940 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:40:54,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:40:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 345. [2020-02-10 20:40:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-02-10 20:40:54,949 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-02-10 20:40:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:54,949 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-02-10 20:40:54,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-02-10 20:40:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:54,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:54,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:54,950 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash 220037620, now seen corresponding path program 101 times [2020-02-10 20:40:54,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:54,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378766775] [2020-02-10 20:40:54,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:55,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378766775] [2020-02-10 20:40:55,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:55,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:55,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606691104] [2020-02-10 20:40:55,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:55,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:55,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:55,137 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:40:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:55,212 INFO L93 Difference]: Finished difference Result 657 states and 1861 transitions. [2020-02-10 20:40:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:55,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:55,214 INFO L225 Difference]: With dead ends: 657 [2020-02-10 20:40:55,214 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:40:55,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:40:55,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 349. [2020-02-10 20:40:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:40:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1111 transitions. [2020-02-10 20:40:55,222 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1111 transitions. Word has length 19 [2020-02-10 20:40:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:55,222 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1111 transitions. [2020-02-10 20:40:55,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1111 transitions. [2020-02-10 20:40:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:55,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:55,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:55,223 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:55,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:55,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1930650928, now seen corresponding path program 102 times [2020-02-10 20:40:55,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:55,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490220107] [2020-02-10 20:40:55,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:55,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490220107] [2020-02-10 20:40:55,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:55,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:55,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406374108] [2020-02-10 20:40:55,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:55,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:55,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:55,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:55,407 INFO L87 Difference]: Start difference. First operand 349 states and 1111 transitions. Second operand 8 states. [2020-02-10 20:40:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:55,489 INFO L93 Difference]: Finished difference Result 660 states and 1867 transitions. [2020-02-10 20:40:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:55,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:55,490 INFO L225 Difference]: With dead ends: 660 [2020-02-10 20:40:55,490 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:40:55,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:40:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 341. [2020-02-10 20:40:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:40:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1091 transitions. [2020-02-10 20:40:55,498 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1091 transitions. Word has length 19 [2020-02-10 20:40:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:55,498 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1091 transitions. [2020-02-10 20:40:55,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1091 transitions. [2020-02-10 20:40:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:55,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:55,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:55,499 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1018198586, now seen corresponding path program 103 times [2020-02-10 20:40:55,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:55,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908364947] [2020-02-10 20:40:55,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:55,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908364947] [2020-02-10 20:40:55,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:55,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:55,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309985297] [2020-02-10 20:40:55,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:55,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:55,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:55,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:55,664 INFO L87 Difference]: Start difference. First operand 341 states and 1091 transitions. Second operand 8 states. [2020-02-10 20:40:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:55,753 INFO L93 Difference]: Finished difference Result 684 states and 1951 transitions. [2020-02-10 20:40:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:55,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:55,755 INFO L225 Difference]: With dead ends: 684 [2020-02-10 20:40:55,755 INFO L226 Difference]: Without dead ends: 644 [2020-02-10 20:40:55,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-02-10 20:40:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 352. [2020-02-10 20:40:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 20:40:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1123 transitions. [2020-02-10 20:40:55,762 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1123 transitions. Word has length 19 [2020-02-10 20:40:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:55,763 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1123 transitions. [2020-02-10 20:40:55,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1123 transitions. [2020-02-10 20:40:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:55,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:55,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:55,763 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:55,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:55,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1892533912, now seen corresponding path program 104 times [2020-02-10 20:40:55,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:55,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912968095] [2020-02-10 20:40:55,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:55,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912968095] [2020-02-10 20:40:55,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:55,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:55,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919823982] [2020-02-10 20:40:55,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:55,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:55,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:55,944 INFO L87 Difference]: Start difference. First operand 352 states and 1123 transitions. Second operand 8 states. [2020-02-10 20:40:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:56,030 INFO L93 Difference]: Finished difference Result 674 states and 1914 transitions. [2020-02-10 20:40:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:56,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:56,032 INFO L225 Difference]: With dead ends: 674 [2020-02-10 20:40:56,032 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:40:56,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:40:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 346. [2020-02-10 20:40:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:40:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1106 transitions. [2020-02-10 20:40:56,042 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1106 transitions. Word has length 19 [2020-02-10 20:40:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:56,042 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1106 transitions. [2020-02-10 20:40:56,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:56,042 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1106 transitions. [2020-02-10 20:40:56,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:56,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:56,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:56,043 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:56,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1215908908, now seen corresponding path program 105 times [2020-02-10 20:40:56,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:56,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799467197] [2020-02-10 20:40:56,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:56,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799467197] [2020-02-10 20:40:56,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:56,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:56,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106292530] [2020-02-10 20:40:56,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:56,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:56,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:56,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:56,281 INFO L87 Difference]: Start difference. First operand 346 states and 1106 transitions. Second operand 8 states. [2020-02-10 20:40:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:56,385 INFO L93 Difference]: Finished difference Result 696 states and 1990 transitions. [2020-02-10 20:40:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:56,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:56,387 INFO L225 Difference]: With dead ends: 696 [2020-02-10 20:40:56,387 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:40:56,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:40:56,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 358. [2020-02-10 20:40:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-02-10 20:40:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1137 transitions. [2020-02-10 20:40:56,400 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1137 transitions. Word has length 19 [2020-02-10 20:40:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:56,401 INFO L479 AbstractCegarLoop]: Abstraction has 358 states and 1137 transitions. [2020-02-10 20:40:56,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1137 transitions. [2020-02-10 20:40:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:56,402 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:56,402 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:56,403 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:56,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2110174348, now seen corresponding path program 106 times [2020-02-10 20:40:56,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:56,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15922273] [2020-02-10 20:40:56,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:56,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15922273] [2020-02-10 20:40:56,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:56,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:56,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467248494] [2020-02-10 20:40:56,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:56,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:56,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:56,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:56,583 INFO L87 Difference]: Start difference. First operand 358 states and 1137 transitions. Second operand 8 states. [2020-02-10 20:40:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:56,665 INFO L93 Difference]: Finished difference Result 692 states and 1966 transitions. [2020-02-10 20:40:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:56,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:56,667 INFO L225 Difference]: With dead ends: 692 [2020-02-10 20:40:56,667 INFO L226 Difference]: Without dead ends: 644 [2020-02-10 20:40:56,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-02-10 20:40:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 346. [2020-02-10 20:40:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:40:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1101 transitions. [2020-02-10 20:40:56,675 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1101 transitions. Word has length 19 [2020-02-10 20:40:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:56,675 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1101 transitions. [2020-02-10 20:40:56,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1101 transitions. [2020-02-10 20:40:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:56,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:56,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:56,676 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1719286220, now seen corresponding path program 107 times [2020-02-10 20:40:56,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:56,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729280226] [2020-02-10 20:40:56,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:56,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729280226] [2020-02-10 20:40:56,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:56,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:56,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540667869] [2020-02-10 20:40:56,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:56,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:56,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:56,862 INFO L87 Difference]: Start difference. First operand 346 states and 1101 transitions. Second operand 8 states. [2020-02-10 20:40:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:56,940 INFO L93 Difference]: Finished difference Result 669 states and 1895 transitions. [2020-02-10 20:40:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:56,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:56,942 INFO L225 Difference]: With dead ends: 669 [2020-02-10 20:40:56,942 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:40:56,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:56,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:40:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 351. [2020-02-10 20:40:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:40:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1111 transitions. [2020-02-10 20:40:56,950 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1111 transitions. Word has length 19 [2020-02-10 20:40:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:56,950 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1111 transitions. [2020-02-10 20:40:56,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1111 transitions. [2020-02-10 20:40:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:56,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:56,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:56,951 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:56,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:56,951 INFO L82 PathProgramCache]: Analyzing trace with hash 846633742, now seen corresponding path program 108 times [2020-02-10 20:40:56,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:56,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346586517] [2020-02-10 20:40:56,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:57,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346586517] [2020-02-10 20:40:57,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:57,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:57,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737476249] [2020-02-10 20:40:57,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:57,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:57,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:57,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:57,123 INFO L87 Difference]: Start difference. First operand 351 states and 1111 transitions. Second operand 8 states. [2020-02-10 20:40:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:57,202 INFO L93 Difference]: Finished difference Result 675 states and 1909 transitions. [2020-02-10 20:40:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:57,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:57,204 INFO L225 Difference]: With dead ends: 675 [2020-02-10 20:40:57,204 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:40:57,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:40:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 341. [2020-02-10 20:40:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:40:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1087 transitions. [2020-02-10 20:40:57,212 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1087 transitions. Word has length 19 [2020-02-10 20:40:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:57,212 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1087 transitions. [2020-02-10 20:40:57,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1087 transitions. [2020-02-10 20:40:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:57,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:57,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:57,213 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash -601878970, now seen corresponding path program 109 times [2020-02-10 20:40:57,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:57,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647006011] [2020-02-10 20:40:57,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:57,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647006011] [2020-02-10 20:40:57,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:57,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:57,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200249346] [2020-02-10 20:40:57,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:57,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:57,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:57,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:57,399 INFO L87 Difference]: Start difference. First operand 341 states and 1087 transitions. Second operand 8 states. [2020-02-10 20:40:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:57,476 INFO L93 Difference]: Finished difference Result 702 states and 2022 transitions. [2020-02-10 20:40:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:57,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:57,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:57,478 INFO L225 Difference]: With dead ends: 702 [2020-02-10 20:40:57,478 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 20:40:57,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 20:40:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 358. [2020-02-10 20:40:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-02-10 20:40:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1145 transitions. [2020-02-10 20:40:57,486 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1145 transitions. Word has length 19 [2020-02-10 20:40:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:57,486 INFO L479 AbstractCegarLoop]: Abstraction has 358 states and 1145 transitions. [2020-02-10 20:40:57,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1145 transitions. [2020-02-10 20:40:57,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:57,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:57,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:57,487 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:57,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1347176114, now seen corresponding path program 110 times [2020-02-10 20:40:57,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:57,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611454679] [2020-02-10 20:40:57,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:57,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611454679] [2020-02-10 20:40:57,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:57,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:57,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98484323] [2020-02-10 20:40:57,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:57,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:57,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:57,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:57,674 INFO L87 Difference]: Start difference. First operand 358 states and 1145 transitions. Second operand 8 states. [2020-02-10 20:40:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:57,752 INFO L93 Difference]: Finished difference Result 695 states and 1992 transitions. [2020-02-10 20:40:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:57,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:57,753 INFO L225 Difference]: With dead ends: 695 [2020-02-10 20:40:57,754 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:40:57,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:40:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 349. [2020-02-10 20:40:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:40:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1115 transitions. [2020-02-10 20:40:57,761 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1115 transitions. Word has length 19 [2020-02-10 20:40:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:57,761 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1115 transitions. [2020-02-10 20:40:57,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1115 transitions. [2020-02-10 20:40:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:57,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:57,762 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:57,762 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash 142823528, now seen corresponding path program 111 times [2020-02-10 20:40:57,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:57,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169152261] [2020-02-10 20:40:57,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:57,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169152261] [2020-02-10 20:40:57,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:57,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:57,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083802836] [2020-02-10 20:40:57,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:57,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:57,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:57,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:57,959 INFO L87 Difference]: Start difference. First operand 349 states and 1115 transitions. Second operand 8 states. [2020-02-10 20:40:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:58,042 INFO L93 Difference]: Finished difference Result 708 states and 2035 transitions. [2020-02-10 20:40:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:58,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:58,044 INFO L225 Difference]: With dead ends: 708 [2020-02-10 20:40:58,044 INFO L226 Difference]: Without dead ends: 668 [2020-02-10 20:40:58,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-02-10 20:40:58,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 361. [2020-02-10 20:40:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-02-10 20:40:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1146 transitions. [2020-02-10 20:40:58,052 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1146 transitions. Word has length 19 [2020-02-10 20:40:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:58,052 INFO L479 AbstractCegarLoop]: Abstraction has 361 states and 1146 transitions. [2020-02-10 20:40:58,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1146 transitions. [2020-02-10 20:40:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:58,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:58,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:58,053 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1111707568, now seen corresponding path program 112 times [2020-02-10 20:40:58,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:58,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407463149] [2020-02-10 20:40:58,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:58,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407463149] [2020-02-10 20:40:58,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:58,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:58,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664614347] [2020-02-10 20:40:58,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:58,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:58,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:58,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:58,243 INFO L87 Difference]: Start difference. First operand 361 states and 1146 transitions. Second operand 8 states. [2020-02-10 20:40:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:58,329 INFO L93 Difference]: Finished difference Result 704 states and 2011 transitions. [2020-02-10 20:40:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:58,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:58,331 INFO L225 Difference]: With dead ends: 704 [2020-02-10 20:40:58,332 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:40:58,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:58,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:40:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 349. [2020-02-10 20:40:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:40:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1107 transitions. [2020-02-10 20:40:58,340 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1107 transitions. Word has length 19 [2020-02-10 20:40:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:58,340 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1107 transitions. [2020-02-10 20:40:58,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1107 transitions. [2020-02-10 20:40:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:58,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:58,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:58,341 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1376541946, now seen corresponding path program 113 times [2020-02-10 20:40:58,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:58,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55166937] [2020-02-10 20:40:58,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:58,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55166937] [2020-02-10 20:40:58,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:58,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:58,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700663536] [2020-02-10 20:40:58,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:58,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:58,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:58,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:58,550 INFO L87 Difference]: Start difference. First operand 349 states and 1107 transitions. Second operand 8 states. [2020-02-10 20:40:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:58,637 INFO L93 Difference]: Finished difference Result 690 states and 1970 transitions. [2020-02-10 20:40:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:58,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:58,639 INFO L225 Difference]: With dead ends: 690 [2020-02-10 20:40:58,639 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 20:40:58,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 20:40:58,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 357. [2020-02-10 20:40:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-02-10 20:40:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1127 transitions. [2020-02-10 20:40:58,646 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1127 transitions. Word has length 19 [2020-02-10 20:40:58,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:58,646 INFO L479 AbstractCegarLoop]: Abstraction has 357 states and 1127 transitions. [2020-02-10 20:40:58,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:58,646 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1127 transitions. [2020-02-10 20:40:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:58,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:58,647 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:58,647 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:58,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:58,647 INFO L82 PathProgramCache]: Analyzing trace with hash -517667416, now seen corresponding path program 114 times [2020-02-10 20:40:58,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:58,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997422230] [2020-02-10 20:40:58,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:58,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997422230] [2020-02-10 20:40:58,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:58,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:58,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466050269] [2020-02-10 20:40:58,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:58,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:58,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:58,839 INFO L87 Difference]: Start difference. First operand 357 states and 1127 transitions. Second operand 8 states. [2020-02-10 20:40:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:58,919 INFO L93 Difference]: Finished difference Result 693 states and 1971 transitions. [2020-02-10 20:40:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:58,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:58,921 INFO L225 Difference]: With dead ends: 693 [2020-02-10 20:40:58,921 INFO L226 Difference]: Without dead ends: 641 [2020-02-10 20:40:58,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:58,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-02-10 20:40:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 341. [2020-02-10 20:40:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:40:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1083 transitions. [2020-02-10 20:40:58,929 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1083 transitions. Word has length 19 [2020-02-10 20:40:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:58,929 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1083 transitions. [2020-02-10 20:40:58,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1083 transitions. [2020-02-10 20:40:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:58,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:58,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:58,930 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:58,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:58,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1295748776, now seen corresponding path program 115 times [2020-02-10 20:40:58,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:58,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697509311] [2020-02-10 20:40:58,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:59,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697509311] [2020-02-10 20:40:59,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:59,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:59,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885048546] [2020-02-10 20:40:59,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:59,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:59,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:59,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:59,143 INFO L87 Difference]: Start difference. First operand 341 states and 1083 transitions. Second operand 8 states. [2020-02-10 20:40:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:59,216 INFO L93 Difference]: Finished difference Result 651 states and 1839 transitions. [2020-02-10 20:40:59,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:59,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:59,217 INFO L225 Difference]: With dead ends: 651 [2020-02-10 20:40:59,217 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:40:59,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:40:59,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 349. [2020-02-10 20:40:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:40:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1107 transitions. [2020-02-10 20:40:59,225 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1107 transitions. Word has length 19 [2020-02-10 20:40:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:59,225 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1107 transitions. [2020-02-10 20:40:59,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1107 transitions. [2020-02-10 20:40:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:59,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:59,226 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:59,226 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:59,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1288605212, now seen corresponding path program 116 times [2020-02-10 20:40:59,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:59,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531571790] [2020-02-10 20:40:59,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:59,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531571790] [2020-02-10 20:40:59,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:59,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:59,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225035231] [2020-02-10 20:40:59,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:59,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:59,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:59,439 INFO L87 Difference]: Start difference. First operand 349 states and 1107 transitions. Second operand 8 states. [2020-02-10 20:40:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:59,512 INFO L93 Difference]: Finished difference Result 654 states and 1845 transitions. [2020-02-10 20:40:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:59,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:59,515 INFO L225 Difference]: With dead ends: 654 [2020-02-10 20:40:59,515 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:40:59,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:40:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 345. [2020-02-10 20:40:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:40:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1095 transitions. [2020-02-10 20:40:59,522 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1095 transitions. Word has length 19 [2020-02-10 20:40:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:59,522 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1095 transitions. [2020-02-10 20:40:59,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1095 transitions. [2020-02-10 20:40:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:59,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:59,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:59,523 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:59,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2040451274, now seen corresponding path program 117 times [2020-02-10 20:40:59,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:59,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126781372] [2020-02-10 20:40:59,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:59,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126781372] [2020-02-10 20:40:59,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:59,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:40:59,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225462642] [2020-02-10 20:40:59,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:40:59,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:40:59,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:59,728 INFO L87 Difference]: Start difference. First operand 345 states and 1095 transitions. Second operand 8 states. [2020-02-10 20:40:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:59,807 INFO L93 Difference]: Finished difference Result 655 states and 1847 transitions. [2020-02-10 20:40:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:40:59,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:40:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:59,808 INFO L225 Difference]: With dead ends: 655 [2020-02-10 20:40:59,809 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:40:59,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:40:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:40:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 350. [2020-02-10 20:40:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 20:40:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1105 transitions. [2020-02-10 20:40:59,816 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1105 transitions. Word has length 19 [2020-02-10 20:40:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:59,816 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1105 transitions. [2020-02-10 20:40:59,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:40:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1105 transitions. [2020-02-10 20:40:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:40:59,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:59,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:59,817 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash 311403940, now seen corresponding path program 118 times [2020-02-10 20:40:59,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:59,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446720504] [2020-02-10 20:40:59,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:00,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446720504] [2020-02-10 20:41:00,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:00,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:00,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591969574] [2020-02-10 20:41:00,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:00,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:00,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:00,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:00,001 INFO L87 Difference]: Start difference. First operand 350 states and 1105 transitions. Second operand 8 states. [2020-02-10 20:41:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:00,077 INFO L93 Difference]: Finished difference Result 661 states and 1861 transitions. [2020-02-10 20:41:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:00,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:00,079 INFO L225 Difference]: With dead ends: 661 [2020-02-10 20:41:00,079 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:41:00,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:41:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 345. [2020-02-10 20:41:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:41:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1091 transitions. [2020-02-10 20:41:00,087 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1091 transitions. Word has length 19 [2020-02-10 20:41:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:00,087 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1091 transitions. [2020-02-10 20:41:00,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1091 transitions. [2020-02-10 20:41:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:00,087 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:00,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:00,088 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash 945502282, now seen corresponding path program 119 times [2020-02-10 20:41:00,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:00,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102028406] [2020-02-10 20:41:00,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:00,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102028406] [2020-02-10 20:41:00,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:00,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:00,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365724167] [2020-02-10 20:41:00,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:00,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:00,281 INFO L87 Difference]: Start difference. First operand 345 states and 1091 transitions. Second operand 8 states. [2020-02-10 20:41:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:00,357 INFO L93 Difference]: Finished difference Result 664 states and 1876 transitions. [2020-02-10 20:41:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:00,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:00,359 INFO L225 Difference]: With dead ends: 664 [2020-02-10 20:41:00,359 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:41:00,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:41:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 353. [2020-02-10 20:41:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 20:41:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1111 transitions. [2020-02-10 20:41:00,368 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1111 transitions. Word has length 19 [2020-02-10 20:41:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:00,368 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1111 transitions. [2020-02-10 20:41:00,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1111 transitions. [2020-02-10 20:41:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:00,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:00,369 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:00,369 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:00,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:00,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1800808936, now seen corresponding path program 120 times [2020-02-10 20:41:00,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:00,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831163997] [2020-02-10 20:41:00,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:00,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831163997] [2020-02-10 20:41:00,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:00,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:00,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257336979] [2020-02-10 20:41:00,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:00,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:00,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:00,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:00,575 INFO L87 Difference]: Start difference. First operand 353 states and 1111 transitions. Second operand 8 states. [2020-02-10 20:41:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:00,655 INFO L93 Difference]: Finished difference Result 667 states and 1877 transitions. [2020-02-10 20:41:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:00,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:00,657 INFO L225 Difference]: With dead ends: 667 [2020-02-10 20:41:00,657 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:41:00,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:41:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 330. [2020-02-10 20:41:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 20:41:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1061 transitions. [2020-02-10 20:41:00,664 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1061 transitions. Word has length 19 [2020-02-10 20:41:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:00,664 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1061 transitions. [2020-02-10 20:41:00,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1061 transitions. [2020-02-10 20:41:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:00,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:00,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:00,665 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash 822861400, now seen corresponding path program 121 times [2020-02-10 20:41:00,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:00,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895189459] [2020-02-10 20:41:00,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:00,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895189459] [2020-02-10 20:41:00,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:00,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:00,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664210867] [2020-02-10 20:41:00,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:00,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:00,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:00,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:00,889 INFO L87 Difference]: Start difference. First operand 330 states and 1061 transitions. Second operand 8 states. [2020-02-10 20:41:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:00,974 INFO L93 Difference]: Finished difference Result 685 states and 1929 transitions. [2020-02-10 20:41:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:00,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:00,976 INFO L225 Difference]: With dead ends: 685 [2020-02-10 20:41:00,976 INFO L226 Difference]: Without dead ends: 654 [2020-02-10 20:41:00,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2020-02-10 20:41:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 346. [2020-02-10 20:41:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:41:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1101 transitions. [2020-02-10 20:41:00,984 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1101 transitions. Word has length 19 [2020-02-10 20:41:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:00,984 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1101 transitions. [2020-02-10 20:41:00,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1101 transitions. [2020-02-10 20:41:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:00,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:00,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:00,985 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:00,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1197512586, now seen corresponding path program 122 times [2020-02-10 20:41:00,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:00,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191872950] [2020-02-10 20:41:00,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:01,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191872950] [2020-02-10 20:41:01,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:01,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:01,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868278061] [2020-02-10 20:41:01,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:01,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:01,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:01,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:01,198 INFO L87 Difference]: Start difference. First operand 346 states and 1101 transitions. Second operand 8 states. [2020-02-10 20:41:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:01,277 INFO L93 Difference]: Finished difference Result 694 states and 1952 transitions. [2020-02-10 20:41:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:01,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:01,278 INFO L225 Difference]: With dead ends: 694 [2020-02-10 20:41:01,279 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 20:41:01,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:01,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 20:41:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 338. [2020-02-10 20:41:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 20:41:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1080 transitions. [2020-02-10 20:41:01,285 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1080 transitions. Word has length 19 [2020-02-10 20:41:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:01,286 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1080 transitions. [2020-02-10 20:41:01,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1080 transitions. [2020-02-10 20:41:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:01,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:01,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:01,287 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:01,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2004251154, now seen corresponding path program 123 times [2020-02-10 20:41:01,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:01,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039636387] [2020-02-10 20:41:01,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:01,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039636387] [2020-02-10 20:41:01,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:01,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:01,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642803774] [2020-02-10 20:41:01,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:01,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:01,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:01,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:01,499 INFO L87 Difference]: Start difference. First operand 338 states and 1080 transitions. Second operand 8 states. [2020-02-10 20:41:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:01,566 INFO L93 Difference]: Finished difference Result 679 states and 1906 transitions. [2020-02-10 20:41:01,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:01,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:01,568 INFO L225 Difference]: With dead ends: 679 [2020-02-10 20:41:01,568 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 20:41:01,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 20:41:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 344. [2020-02-10 20:41:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:41:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1091 transitions. [2020-02-10 20:41:01,576 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1091 transitions. Word has length 19 [2020-02-10 20:41:01,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:01,576 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1091 transitions. [2020-02-10 20:41:01,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1091 transitions. [2020-02-10 20:41:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:01,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:01,577 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:01,577 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:01,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:01,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1028046404, now seen corresponding path program 124 times [2020-02-10 20:41:01,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:01,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357333911] [2020-02-10 20:41:01,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:01,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357333911] [2020-02-10 20:41:01,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:01,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:01,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873097918] [2020-02-10 20:41:01,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:01,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:01,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:01,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:01,786 INFO L87 Difference]: Start difference. First operand 344 states and 1091 transitions. Second operand 8 states. [2020-02-10 20:41:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:01,871 INFO L93 Difference]: Finished difference Result 684 states and 1918 transitions. [2020-02-10 20:41:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:01,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:01,872 INFO L225 Difference]: With dead ends: 684 [2020-02-10 20:41:01,873 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:41:01,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:41:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 338. [2020-02-10 20:41:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 20:41:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1074 transitions. [2020-02-10 20:41:01,881 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1074 transitions. Word has length 19 [2020-02-10 20:41:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:01,882 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1074 transitions. [2020-02-10 20:41:01,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1074 transitions. [2020-02-10 20:41:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:01,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:01,885 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:01,887 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1100948602, now seen corresponding path program 125 times [2020-02-10 20:41:01,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:01,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766379819] [2020-02-10 20:41:01,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:02,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766379819] [2020-02-10 20:41:02,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:02,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:02,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651459997] [2020-02-10 20:41:02,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:02,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:02,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:02,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:02,104 INFO L87 Difference]: Start difference. First operand 338 states and 1074 transitions. Second operand 8 states. [2020-02-10 20:41:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:02,185 INFO L93 Difference]: Finished difference Result 703 states and 1986 transitions. [2020-02-10 20:41:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:02,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:02,187 INFO L225 Difference]: With dead ends: 703 [2020-02-10 20:41:02,187 INFO L226 Difference]: Without dead ends: 663 [2020-02-10 20:41:02,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-02-10 20:41:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 350. [2020-02-10 20:41:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 20:41:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1105 transitions. [2020-02-10 20:41:02,195 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1105 transitions. Word has length 19 [2020-02-10 20:41:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:02,196 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1105 transitions. [2020-02-10 20:41:02,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1105 transitions. [2020-02-10 20:41:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:02,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:02,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:02,197 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash -242668718, now seen corresponding path program 126 times [2020-02-10 20:41:02,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:02,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406821905] [2020-02-10 20:41:02,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:02,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406821905] [2020-02-10 20:41:02,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:02,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:02,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047051186] [2020-02-10 20:41:02,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:02,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:02,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:02,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:02,405 INFO L87 Difference]: Start difference. First operand 350 states and 1105 transitions. Second operand 8 states. [2020-02-10 20:41:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:02,493 INFO L93 Difference]: Finished difference Result 699 states and 1962 transitions. [2020-02-10 20:41:02,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:02,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:02,495 INFO L225 Difference]: With dead ends: 699 [2020-02-10 20:41:02,495 INFO L226 Difference]: Without dead ends: 643 [2020-02-10 20:41:02,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-02-10 20:41:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 330. [2020-02-10 20:41:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 20:41:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1054 transitions. [2020-02-10 20:41:02,503 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1054 transitions. Word has length 19 [2020-02-10 20:41:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:02,503 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1054 transitions. [2020-02-10 20:41:02,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1054 transitions. [2020-02-10 20:41:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:02,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:02,504 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:02,504 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:02,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1565948490, now seen corresponding path program 127 times [2020-02-10 20:41:02,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:02,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597043748] [2020-02-10 20:41:02,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:02,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597043748] [2020-02-10 20:41:02,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:02,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:02,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549863602] [2020-02-10 20:41:02,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:02,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:02,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:02,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:02,718 INFO L87 Difference]: Start difference. First operand 330 states and 1054 transitions. Second operand 8 states. [2020-02-10 20:41:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:02,778 INFO L93 Difference]: Finished difference Result 676 states and 1893 transitions. [2020-02-10 20:41:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:02,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:02,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:02,779 INFO L225 Difference]: With dead ends: 676 [2020-02-10 20:41:02,780 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 20:41:02,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 20:41:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 344. [2020-02-10 20:41:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:41:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1089 transitions. [2020-02-10 20:41:02,786 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1089 transitions. Word has length 19 [2020-02-10 20:41:02,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:02,787 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1089 transitions. [2020-02-10 20:41:02,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1089 transitions. [2020-02-10 20:41:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:02,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:02,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:02,787 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1940599676, now seen corresponding path program 128 times [2020-02-10 20:41:02,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:02,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890373138] [2020-02-10 20:41:02,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:03,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890373138] [2020-02-10 20:41:03,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:03,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:03,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64955647] [2020-02-10 20:41:03,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:03,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:03,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:03,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:03,028 INFO L87 Difference]: Start difference. First operand 344 states and 1089 transitions. Second operand 8 states. [2020-02-10 20:41:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:03,105 INFO L93 Difference]: Finished difference Result 685 states and 1916 transitions. [2020-02-10 20:41:03,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:03,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:03,107 INFO L225 Difference]: With dead ends: 685 [2020-02-10 20:41:03,107 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 20:41:03,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 20:41:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 336. [2020-02-10 20:41:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-02-10 20:41:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1069 transitions. [2020-02-10 20:41:03,116 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1069 transitions. Word has length 19 [2020-02-10 20:41:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:03,116 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 1069 transitions. [2020-02-10 20:41:03,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1069 transitions. [2020-02-10 20:41:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:03,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:03,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:03,117 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:03,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:03,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1873225276, now seen corresponding path program 129 times [2020-02-10 20:41:03,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:03,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110091418] [2020-02-10 20:41:03,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:03,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110091418] [2020-02-10 20:41:03,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:03,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:03,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737208898] [2020-02-10 20:41:03,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:03,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:03,329 INFO L87 Difference]: Start difference. First operand 336 states and 1069 transitions. Second operand 8 states. [2020-02-10 20:41:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:03,391 INFO L93 Difference]: Finished difference Result 666 states and 1859 transitions. [2020-02-10 20:41:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:03,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:03,393 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:41:03,393 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 20:41:03,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 20:41:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 341. [2020-02-10 20:41:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:41:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1078 transitions. [2020-02-10 20:41:03,400 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1078 transitions. Word has length 19 [2020-02-10 20:41:03,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:03,400 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1078 transitions. [2020-02-10 20:41:03,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1078 transitions. [2020-02-10 20:41:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:03,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:03,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:03,401 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1670679926, now seen corresponding path program 130 times [2020-02-10 20:41:03,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:03,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872470548] [2020-02-10 20:41:03,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:03,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872470548] [2020-02-10 20:41:03,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:03,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:03,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772410588] [2020-02-10 20:41:03,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:03,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:03,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:03,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:03,602 INFO L87 Difference]: Start difference. First operand 341 states and 1078 transitions. Second operand 8 states. [2020-02-10 20:41:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:03,679 INFO L93 Difference]: Finished difference Result 668 states and 1863 transitions. [2020-02-10 20:41:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:03,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:03,681 INFO L225 Difference]: With dead ends: 668 [2020-02-10 20:41:03,681 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:41:03,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:41:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 336. [2020-02-10 20:41:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-02-10 20:41:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1064 transitions. [2020-02-10 20:41:03,689 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1064 transitions. Word has length 19 [2020-02-10 20:41:03,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:03,689 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 1064 transitions. [2020-02-10 20:41:03,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1064 transitions. [2020-02-10 20:41:03,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:03,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:03,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:03,690 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:03,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:03,690 INFO L82 PathProgramCache]: Analyzing trace with hash 400559450, now seen corresponding path program 131 times [2020-02-10 20:41:03,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:03,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227076464] [2020-02-10 20:41:03,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:03,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227076464] [2020-02-10 20:41:03,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:03,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:03,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283682656] [2020-02-10 20:41:03,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:03,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:03,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:03,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:03,888 INFO L87 Difference]: Start difference. First operand 336 states and 1064 transitions. Second operand 8 states. [2020-02-10 20:41:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:03,969 INFO L93 Difference]: Finished difference Result 688 states and 1931 transitions. [2020-02-10 20:41:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:03,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:03,970 INFO L225 Difference]: With dead ends: 688 [2020-02-10 20:41:03,971 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 20:41:03,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 20:41:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 345. [2020-02-10 20:41:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:41:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1086 transitions. [2020-02-10 20:41:03,979 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1086 transitions. Word has length 19 [2020-02-10 20:41:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:03,979 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1086 transitions. [2020-02-10 20:41:03,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1086 transitions. [2020-02-10 20:41:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:03,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:03,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:03,980 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash 399964804, now seen corresponding path program 132 times [2020-02-10 20:41:03,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:03,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144188092] [2020-02-10 20:41:03,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:04,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144188092] [2020-02-10 20:41:04,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:04,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:04,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277023322] [2020-02-10 20:41:04,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:04,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:04,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:04,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:04,181 INFO L87 Difference]: Start difference. First operand 345 states and 1086 transitions. Second operand 8 states. [2020-02-10 20:41:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:04,261 INFO L93 Difference]: Finished difference Result 681 states and 1901 transitions. [2020-02-10 20:41:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:04,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:04,263 INFO L225 Difference]: With dead ends: 681 [2020-02-10 20:41:04,263 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:41:04,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:41:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 330. [2020-02-10 20:41:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 20:41:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1048 transitions. [2020-02-10 20:41:04,270 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1048 transitions. Word has length 19 [2020-02-10 20:41:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:04,270 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1048 transitions. [2020-02-10 20:41:04,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1048 transitions. [2020-02-10 20:41:04,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:04,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:04,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:04,271 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:04,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:04,271 INFO L82 PathProgramCache]: Analyzing trace with hash 390118730, now seen corresponding path program 133 times [2020-02-10 20:41:04,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:04,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741921781] [2020-02-10 20:41:04,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:04,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741921781] [2020-02-10 20:41:04,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:04,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:04,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791730585] [2020-02-10 20:41:04,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:04,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:04,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:04,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:04,478 INFO L87 Difference]: Start difference. First operand 330 states and 1048 transitions. Second operand 8 states. [2020-02-10 20:41:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:04,543 INFO L93 Difference]: Finished difference Result 658 states and 1838 transitions. [2020-02-10 20:41:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:04,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:04,544 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:41:04,544 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:41:04,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:41:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 340. [2020-02-10 20:41:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 20:41:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1076 transitions. [2020-02-10 20:41:04,551 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1076 transitions. Word has length 19 [2020-02-10 20:41:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:04,552 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1076 transitions. [2020-02-10 20:41:04,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1076 transitions. [2020-02-10 20:41:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:04,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:04,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:04,552 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:04,553 INFO L82 PathProgramCache]: Analyzing trace with hash -360943364, now seen corresponding path program 134 times [2020-02-10 20:41:04,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:04,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073965514] [2020-02-10 20:41:04,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:04,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073965514] [2020-02-10 20:41:04,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:04,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:04,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643049364] [2020-02-10 20:41:04,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:04,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:04,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:04,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:04,771 INFO L87 Difference]: Start difference. First operand 340 states and 1076 transitions. Second operand 8 states. [2020-02-10 20:41:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:04,853 INFO L93 Difference]: Finished difference Result 660 states and 1842 transitions. [2020-02-10 20:41:04,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:04,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:04,855 INFO L225 Difference]: With dead ends: 660 [2020-02-10 20:41:04,855 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:41:04,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:41:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 335. [2020-02-10 20:41:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 20:41:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1062 transitions. [2020-02-10 20:41:04,862 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1062 transitions. Word has length 19 [2020-02-10 20:41:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:04,862 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1062 transitions. [2020-02-10 20:41:04,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1062 transitions. [2020-02-10 20:41:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:04,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:04,863 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:04,863 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:04,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1210319124, now seen corresponding path program 135 times [2020-02-10 20:41:04,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:04,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647457427] [2020-02-10 20:41:04,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:05,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647457427] [2020-02-10 20:41:05,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:05,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:05,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945201003] [2020-02-10 20:41:05,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:05,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:05,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:05,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:05,082 INFO L87 Difference]: Start difference. First operand 335 states and 1062 transitions. Second operand 8 states. [2020-02-10 20:41:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:05,147 INFO L93 Difference]: Finished difference Result 662 states and 1845 transitions. [2020-02-10 20:41:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:05,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:05,148 INFO L225 Difference]: With dead ends: 662 [2020-02-10 20:41:05,149 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:41:05,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:41:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 341. [2020-02-10 20:41:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:41:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1073 transitions. [2020-02-10 20:41:05,156 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1073 transitions. Word has length 19 [2020-02-10 20:41:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:05,156 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1073 transitions. [2020-02-10 20:41:05,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1073 transitions. [2020-02-10 20:41:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:05,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:05,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:05,156 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2108443422, now seen corresponding path program 136 times [2020-02-10 20:41:05,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:05,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503036498] [2020-02-10 20:41:05,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:05,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503036498] [2020-02-10 20:41:05,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:05,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:05,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138122216] [2020-02-10 20:41:05,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:05,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:05,369 INFO L87 Difference]: Start difference. First operand 341 states and 1073 transitions. Second operand 8 states. [2020-02-10 20:41:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:05,465 INFO L93 Difference]: Finished difference Result 667 states and 1857 transitions. [2020-02-10 20:41:05,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:05,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:05,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:05,467 INFO L225 Difference]: With dead ends: 667 [2020-02-10 20:41:05,467 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:41:05,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:41:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 335. [2020-02-10 20:41:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 20:41:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1057 transitions. [2020-02-10 20:41:05,474 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1057 transitions. Word has length 19 [2020-02-10 20:41:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:05,475 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1057 transitions. [2020-02-10 20:41:05,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1057 transitions. [2020-02-10 20:41:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:05,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:05,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:05,475 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash -558519542, now seen corresponding path program 137 times [2020-02-10 20:41:05,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:05,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878254339] [2020-02-10 20:41:05,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:05,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878254339] [2020-02-10 20:41:05,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:05,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:05,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497589777] [2020-02-10 20:41:05,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:05,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:05,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:05,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:05,679 INFO L87 Difference]: Start difference. First operand 335 states and 1057 transitions. Second operand 8 states. [2020-02-10 20:41:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:05,773 INFO L93 Difference]: Finished difference Result 668 states and 1869 transitions. [2020-02-10 20:41:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:05,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:05,775 INFO L225 Difference]: With dead ends: 668 [2020-02-10 20:41:05,775 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 20:41:05,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 20:41:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 343. [2020-02-10 20:41:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:41:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1077 transitions. [2020-02-10 20:41:05,783 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1077 transitions. Word has length 19 [2020-02-10 20:41:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:05,783 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1077 transitions. [2020-02-10 20:41:05,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1077 transitions. [2020-02-10 20:41:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:05,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:05,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:05,784 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:05,784 INFO L82 PathProgramCache]: Analyzing trace with hash 300354988, now seen corresponding path program 138 times [2020-02-10 20:41:05,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:05,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464853716] [2020-02-10 20:41:05,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:05,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464853716] [2020-02-10 20:41:05,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:05,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:05,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116493277] [2020-02-10 20:41:05,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:05,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:05,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:05,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:05,991 INFO L87 Difference]: Start difference. First operand 343 states and 1077 transitions. Second operand 8 states. [2020-02-10 20:41:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:06,084 INFO L93 Difference]: Finished difference Result 671 states and 1870 transitions. [2020-02-10 20:41:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:06,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:06,086 INFO L225 Difference]: With dead ends: 671 [2020-02-10 20:41:06,086 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:41:06,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:41:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 330. [2020-02-10 20:41:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 20:41:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1043 transitions. [2020-02-10 20:41:06,093 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1043 transitions. Word has length 19 [2020-02-10 20:41:06,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:06,093 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1043 transitions. [2020-02-10 20:41:06,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1043 transitions. [2020-02-10 20:41:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:06,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:06,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:06,094 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2132260642, now seen corresponding path program 139 times [2020-02-10 20:41:06,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:06,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861184415] [2020-02-10 20:41:06,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:06,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861184415] [2020-02-10 20:41:06,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:06,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:06,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784559454] [2020-02-10 20:41:06,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:06,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:06,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:06,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:06,293 INFO L87 Difference]: Start difference. First operand 330 states and 1043 transitions. Second operand 8 states. [2020-02-10 20:41:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:06,375 INFO L93 Difference]: Finished difference Result 702 states and 2000 transitions. [2020-02-10 20:41:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:06,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:06,377 INFO L225 Difference]: With dead ends: 702 [2020-02-10 20:41:06,377 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 20:41:06,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 20:41:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 347. [2020-02-10 20:41:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:41:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1101 transitions. [2020-02-10 20:41:06,384 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1101 transitions. Word has length 19 [2020-02-10 20:41:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:06,384 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1101 transitions. [2020-02-10 20:41:06,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1101 transitions. [2020-02-10 20:41:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:06,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:06,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:06,385 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:06,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2132855288, now seen corresponding path program 140 times [2020-02-10 20:41:06,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:06,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212305149] [2020-02-10 20:41:06,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:06,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212305149] [2020-02-10 20:41:06,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:06,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:06,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510460073] [2020-02-10 20:41:06,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:06,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:06,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:06,589 INFO L87 Difference]: Start difference. First operand 347 states and 1101 transitions. Second operand 8 states. [2020-02-10 20:41:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:06,686 INFO L93 Difference]: Finished difference Result 695 states and 1970 transitions. [2020-02-10 20:41:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:06,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:06,688 INFO L225 Difference]: With dead ends: 695 [2020-02-10 20:41:06,688 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:41:06,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:41:06,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 338. [2020-02-10 20:41:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 20:41:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1071 transitions. [2020-02-10 20:41:06,696 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1071 transitions. Word has length 19 [2020-02-10 20:41:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:06,696 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1071 transitions. [2020-02-10 20:41:06,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1071 transitions. [2020-02-10 20:41:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:06,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:06,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:06,697 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1276953988, now seen corresponding path program 141 times [2020-02-10 20:41:06,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:06,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224292790] [2020-02-10 20:41:06,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:06,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224292790] [2020-02-10 20:41:06,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:06,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:06,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579648360] [2020-02-10 20:41:06,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:06,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:06,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:06,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:06,896 INFO L87 Difference]: Start difference. First operand 338 states and 1071 transitions. Second operand 8 states. [2020-02-10 20:41:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:06,983 INFO L93 Difference]: Finished difference Result 708 states and 2013 transitions. [2020-02-10 20:41:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:06,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:06,984 INFO L225 Difference]: With dead ends: 708 [2020-02-10 20:41:06,984 INFO L226 Difference]: Without dead ends: 668 [2020-02-10 20:41:06,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-02-10 20:41:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 350. [2020-02-10 20:41:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 20:41:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1102 transitions. [2020-02-10 20:41:06,991 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1102 transitions. Word has length 19 [2020-02-10 20:41:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:06,991 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1102 transitions. [2020-02-10 20:41:06,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1102 transitions. [2020-02-10 20:41:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:06,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:06,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:06,992 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:06,992 INFO L82 PathProgramCache]: Analyzing trace with hash -418674104, now seen corresponding path program 142 times [2020-02-10 20:41:06,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:06,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734894184] [2020-02-10 20:41:06,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:07,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734894184] [2020-02-10 20:41:07,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:07,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:07,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440610389] [2020-02-10 20:41:07,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:07,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:07,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:07,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:07,213 INFO L87 Difference]: Start difference. First operand 350 states and 1102 transitions. Second operand 8 states. [2020-02-10 20:41:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:07,309 INFO L93 Difference]: Finished difference Result 704 states and 1989 transitions. [2020-02-10 20:41:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:07,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:07,311 INFO L225 Difference]: With dead ends: 704 [2020-02-10 20:41:07,311 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:41:07,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:41:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 338. [2020-02-10 20:41:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 20:41:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1063 transitions. [2020-02-10 20:41:07,319 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1063 transitions. Word has length 19 [2020-02-10 20:41:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:07,319 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1063 transitions. [2020-02-10 20:41:07,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1063 transitions. [2020-02-10 20:41:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:07,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:07,320 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:07,320 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:07,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1295982660, now seen corresponding path program 143 times [2020-02-10 20:41:07,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:07,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31239150] [2020-02-10 20:41:07,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:07,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31239150] [2020-02-10 20:41:07,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:07,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:07,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502599423] [2020-02-10 20:41:07,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:07,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:07,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:07,524 INFO L87 Difference]: Start difference. First operand 338 states and 1063 transitions. Second operand 8 states. [2020-02-10 20:41:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:07,609 INFO L93 Difference]: Finished difference Result 690 states and 1948 transitions. [2020-02-10 20:41:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:07,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:07,611 INFO L225 Difference]: With dead ends: 690 [2020-02-10 20:41:07,611 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 20:41:07,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 20:41:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 346. [2020-02-10 20:41:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:41:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1083 transitions. [2020-02-10 20:41:07,619 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1083 transitions. Word has length 19 [2020-02-10 20:41:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:07,619 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1083 transitions. [2020-02-10 20:41:07,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1083 transitions. [2020-02-10 20:41:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:07,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:07,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:07,620 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash -437108130, now seen corresponding path program 144 times [2020-02-10 20:41:07,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:07,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691068916] [2020-02-10 20:41:07,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:07,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691068916] [2020-02-10 20:41:07,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:07,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:07,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778942514] [2020-02-10 20:41:07,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:07,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:07,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:07,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:07,833 INFO L87 Difference]: Start difference. First operand 346 states and 1083 transitions. Second operand 8 states. [2020-02-10 20:41:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:07,921 INFO L93 Difference]: Finished difference Result 693 states and 1949 transitions. [2020-02-10 20:41:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:07,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:07,923 INFO L225 Difference]: With dead ends: 693 [2020-02-10 20:41:07,923 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:41:07,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:41:07,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 322. [2020-02-10 20:41:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-02-10 20:41:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1025 transitions. [2020-02-10 20:41:07,930 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 1025 transitions. Word has length 19 [2020-02-10 20:41:07,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:07,931 INFO L479 AbstractCegarLoop]: Abstraction has 322 states and 1025 transitions. [2020-02-10 20:41:07,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 1025 transitions. [2020-02-10 20:41:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:07,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:07,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:07,931 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:07,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:07,932 INFO L82 PathProgramCache]: Analyzing trace with hash -570692880, now seen corresponding path program 145 times [2020-02-10 20:41:07,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:07,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807764787] [2020-02-10 20:41:07,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:08,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807764787] [2020-02-10 20:41:08,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:08,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:08,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714612825] [2020-02-10 20:41:08,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:08,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:08,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:08,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:08,169 INFO L87 Difference]: Start difference. First operand 322 states and 1025 transitions. Second operand 8 states. [2020-02-10 20:41:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:08,247 INFO L93 Difference]: Finished difference Result 656 states and 1808 transitions. [2020-02-10 20:41:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:08,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:08,249 INFO L225 Difference]: With dead ends: 656 [2020-02-10 20:41:08,249 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:41:08,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:41:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 343. [2020-02-10 20:41:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:41:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1083 transitions. [2020-02-10 20:41:08,259 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1083 transitions. Word has length 19 [2020-02-10 20:41:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:08,259 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1083 transitions. [2020-02-10 20:41:08,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1083 transitions. [2020-02-10 20:41:08,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:08,260 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:08,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:08,260 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash -196041694, now seen corresponding path program 146 times [2020-02-10 20:41:08,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:08,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712902814] [2020-02-10 20:41:08,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:08,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712902814] [2020-02-10 20:41:08,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:08,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:08,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018346747] [2020-02-10 20:41:08,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:08,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:08,476 INFO L87 Difference]: Start difference. First operand 343 states and 1083 transitions. Second operand 8 states. [2020-02-10 20:41:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:08,558 INFO L93 Difference]: Finished difference Result 665 states and 1831 transitions. [2020-02-10 20:41:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:08,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:08,559 INFO L225 Difference]: With dead ends: 665 [2020-02-10 20:41:08,560 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:41:08,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:41:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 335. [2020-02-10 20:41:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 20:41:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1062 transitions. [2020-02-10 20:41:08,566 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1062 transitions. Word has length 19 [2020-02-10 20:41:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:08,566 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1062 transitions. [2020-02-10 20:41:08,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1062 transitions. [2020-02-10 20:41:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:08,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:08,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:08,567 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:08,567 INFO L82 PathProgramCache]: Analyzing trace with hash 610696874, now seen corresponding path program 147 times [2020-02-10 20:41:08,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:08,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76140530] [2020-02-10 20:41:08,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:08,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76140530] [2020-02-10 20:41:08,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:08,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:08,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419543409] [2020-02-10 20:41:08,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:08,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:08,774 INFO L87 Difference]: Start difference. First operand 335 states and 1062 transitions. Second operand 8 states. [2020-02-10 20:41:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:08,850 INFO L93 Difference]: Finished difference Result 650 states and 1785 transitions. [2020-02-10 20:41:08,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:08,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:08,852 INFO L225 Difference]: With dead ends: 650 [2020-02-10 20:41:08,852 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:41:08,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:41:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 341. [2020-02-10 20:41:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:41:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1073 transitions. [2020-02-10 20:41:08,859 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1073 transitions. Word has length 19 [2020-02-10 20:41:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:08,860 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1073 transitions. [2020-02-10 20:41:08,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1073 transitions. [2020-02-10 20:41:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:08,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:08,860 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:08,860 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash -365507876, now seen corresponding path program 148 times [2020-02-10 20:41:08,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:08,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319233245] [2020-02-10 20:41:08,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:09,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319233245] [2020-02-10 20:41:09,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:09,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:09,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304507623] [2020-02-10 20:41:09,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:09,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:09,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:09,059 INFO L87 Difference]: Start difference. First operand 341 states and 1073 transitions. Second operand 8 states. [2020-02-10 20:41:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:09,148 INFO L93 Difference]: Finished difference Result 655 states and 1797 transitions. [2020-02-10 20:41:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:09,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:09,150 INFO L225 Difference]: With dead ends: 655 [2020-02-10 20:41:09,150 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:41:09,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:41:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 335. [2020-02-10 20:41:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 20:41:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1056 transitions. [2020-02-10 20:41:09,158 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1056 transitions. Word has length 19 [2020-02-10 20:41:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:09,158 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1056 transitions. [2020-02-10 20:41:09,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1056 transitions. [2020-02-10 20:41:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:09,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:09,159 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:09,159 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1800464414, now seen corresponding path program 149 times [2020-02-10 20:41:09,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:09,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724556267] [2020-02-10 20:41:09,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:09,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724556267] [2020-02-10 20:41:09,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:09,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:09,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645603720] [2020-02-10 20:41:09,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:09,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:09,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:09,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:09,418 INFO L87 Difference]: Start difference. First operand 335 states and 1056 transitions. Second operand 8 states. [2020-02-10 20:41:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:09,507 INFO L93 Difference]: Finished difference Result 674 states and 1865 transitions. [2020-02-10 20:41:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:09,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:09,509 INFO L225 Difference]: With dead ends: 674 [2020-02-10 20:41:09,509 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:41:09,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:41:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 347. [2020-02-10 20:41:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:41:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1087 transitions. [2020-02-10 20:41:09,517 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1087 transitions. Word has length 19 [2020-02-10 20:41:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:09,517 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1087 transitions. [2020-02-10 20:41:09,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1087 transitions. [2020-02-10 20:41:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:09,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:09,518 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:09,518 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:09,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1636222998, now seen corresponding path program 150 times [2020-02-10 20:41:09,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:09,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391947673] [2020-02-10 20:41:09,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:09,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391947673] [2020-02-10 20:41:09,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:09,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:09,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093831392] [2020-02-10 20:41:09,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:09,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:09,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:09,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:09,722 INFO L87 Difference]: Start difference. First operand 347 states and 1087 transitions. Second operand 8 states. [2020-02-10 20:41:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:09,817 INFO L93 Difference]: Finished difference Result 670 states and 1841 transitions. [2020-02-10 20:41:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:09,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:09,819 INFO L225 Difference]: With dead ends: 670 [2020-02-10 20:41:09,819 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:41:09,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:41:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 327. [2020-02-10 20:41:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-02-10 20:41:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 1038 transitions. [2020-02-10 20:41:09,828 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 1038 transitions. Word has length 19 [2020-02-10 20:41:09,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:09,828 INFO L479 AbstractCegarLoop]: Abstraction has 327 states and 1038 transitions. [2020-02-10 20:41:09,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 1038 transitions. [2020-02-10 20:41:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:09,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:09,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:09,829 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:09,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:09,829 INFO L82 PathProgramCache]: Analyzing trace with hash 807035554, now seen corresponding path program 151 times [2020-02-10 20:41:09,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:09,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601009058] [2020-02-10 20:41:09,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:10,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601009058] [2020-02-10 20:41:10,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:10,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:10,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796526442] [2020-02-10 20:41:10,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:10,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:10,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:10,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:10,031 INFO L87 Difference]: Start difference. First operand 327 states and 1038 transitions. Second operand 8 states. [2020-02-10 20:41:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:10,103 INFO L93 Difference]: Finished difference Result 629 states and 1714 transitions. [2020-02-10 20:41:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:10,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:10,104 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:41:10,104 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:41:10,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:10,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:41:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 339. [2020-02-10 20:41:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-02-10 20:41:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1064 transitions. [2020-02-10 20:41:10,111 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1064 transitions. Word has length 19 [2020-02-10 20:41:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:10,111 INFO L479 AbstractCegarLoop]: Abstraction has 339 states and 1064 transitions. [2020-02-10 20:41:10,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1064 transitions. [2020-02-10 20:41:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:10,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:10,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:10,112 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:10,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1181686740, now seen corresponding path program 152 times [2020-02-10 20:41:10,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:10,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653203543] [2020-02-10 20:41:10,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:10,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653203543] [2020-02-10 20:41:10,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:10,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:10,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304588771] [2020-02-10 20:41:10,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:10,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:10,333 INFO L87 Difference]: Start difference. First operand 339 states and 1064 transitions. Second operand 8 states. [2020-02-10 20:41:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:10,414 INFO L93 Difference]: Finished difference Result 638 states and 1737 transitions. [2020-02-10 20:41:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:10,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:10,415 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:41:10,415 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:41:10,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:10,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:41:10,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 331. [2020-02-10 20:41:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-02-10 20:41:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1046 transitions. [2020-02-10 20:41:10,423 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1046 transitions. Word has length 19 [2020-02-10 20:41:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:10,423 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 1046 transitions. [2020-02-10 20:41:10,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1046 transitions. [2020-02-10 20:41:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:10,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:10,424 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:10,424 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:10,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1337232860, now seen corresponding path program 153 times [2020-02-10 20:41:10,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:10,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990836696] [2020-02-10 20:41:10,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:10,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990836696] [2020-02-10 20:41:10,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:10,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:10,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093993641] [2020-02-10 20:41:10,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:10,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:10,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:10,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:10,608 INFO L87 Difference]: Start difference. First operand 331 states and 1046 transitions. Second operand 8 states. [2020-02-10 20:41:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:10,676 INFO L93 Difference]: Finished difference Result 606 states and 1650 transitions. [2020-02-10 20:41:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:10,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:10,678 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:41:10,678 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:41:10,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:41:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 334. [2020-02-10 20:41:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-02-10 20:41:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1050 transitions. [2020-02-10 20:41:10,684 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1050 transitions. Word has length 19 [2020-02-10 20:41:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:10,684 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 1050 transitions. [2020-02-10 20:41:10,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1050 transitions. [2020-02-10 20:41:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:10,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:10,685 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:10,685 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:10,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1693132272, now seen corresponding path program 1 times [2020-02-10 20:41:10,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:10,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001064883] [2020-02-10 20:41:10,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:10,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001064883] [2020-02-10 20:41:10,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:10,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:41:10,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459415585] [2020-02-10 20:41:10,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:41:10,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:10,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:41:10,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:41:10,696 INFO L87 Difference]: Start difference. First operand 334 states and 1050 transitions. Second operand 3 states. [2020-02-10 20:41:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:10,699 INFO L93 Difference]: Finished difference Result 220 states and 662 transitions. [2020-02-10 20:41:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:41:10,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 20:41:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:10,700 INFO L225 Difference]: With dead ends: 220 [2020-02-10 20:41:10,700 INFO L226 Difference]: Without dead ends: 220 [2020-02-10 20:41:10,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:41:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-02-10 20:41:10,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-02-10 20:41:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 20:41:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 662 transitions. [2020-02-10 20:41:10,705 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 662 transitions. Word has length 19 [2020-02-10 20:41:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:10,705 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 662 transitions. [2020-02-10 20:41:10,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:41:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 662 transitions. [2020-02-10 20:41:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:10,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:10,705 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:10,706 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1596291086, now seen corresponding path program 154 times [2020-02-10 20:41:10,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:10,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254093843] [2020-02-10 20:41:10,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:10,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254093843] [2020-02-10 20:41:10,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:10,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:10,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484977886] [2020-02-10 20:41:10,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:10,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:10,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:10,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:10,915 INFO L87 Difference]: Start difference. First operand 220 states and 662 transitions. Second operand 8 states. [2020-02-10 20:41:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:10,979 INFO L93 Difference]: Finished difference Result 336 states and 884 transitions. [2020-02-10 20:41:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:10,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:10,980 INFO L225 Difference]: With dead ends: 336 [2020-02-10 20:41:10,980 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 20:41:10,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 20:41:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 217. [2020-02-10 20:41:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:41:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 655 transitions. [2020-02-10 20:41:10,986 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 655 transitions. Word has length 19 [2020-02-10 20:41:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:10,986 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 655 transitions. [2020-02-10 20:41:10,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 655 transitions. [2020-02-10 20:41:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:10,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:10,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:10,987 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1035428716, now seen corresponding path program 155 times [2020-02-10 20:41:10,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:10,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776462257] [2020-02-10 20:41:10,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:11,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776462257] [2020-02-10 20:41:11,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:11,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:11,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203677470] [2020-02-10 20:41:11,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:11,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:11,201 INFO L87 Difference]: Start difference. First operand 217 states and 655 transitions. Second operand 8 states. [2020-02-10 20:41:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:11,291 INFO L93 Difference]: Finished difference Result 348 states and 900 transitions. [2020-02-10 20:41:11,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:11,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:11,292 INFO L225 Difference]: With dead ends: 348 [2020-02-10 20:41:11,292 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 20:41:11,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 20:41:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 219. [2020-02-10 20:41:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 20:41:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 658 transitions. [2020-02-10 20:41:11,297 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 658 transitions. Word has length 19 [2020-02-10 20:41:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:11,297 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 658 transitions. [2020-02-10 20:41:11,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 658 transitions. [2020-02-10 20:41:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:11,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:11,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:11,298 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:11,298 INFO L82 PathProgramCache]: Analyzing trace with hash 84701114, now seen corresponding path program 156 times [2020-02-10 20:41:11,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:11,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72722950] [2020-02-10 20:41:11,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:11,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72722950] [2020-02-10 20:41:11,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:11,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:11,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888638560] [2020-02-10 20:41:11,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:11,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:11,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:11,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:11,484 INFO L87 Difference]: Start difference. First operand 219 states and 658 transitions. Second operand 8 states. [2020-02-10 20:41:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:11,549 INFO L93 Difference]: Finished difference Result 335 states and 880 transitions. [2020-02-10 20:41:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:11,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:11,550 INFO L225 Difference]: With dead ends: 335 [2020-02-10 20:41:11,550 INFO L226 Difference]: Without dead ends: 319 [2020-02-10 20:41:11,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-02-10 20:41:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 213. [2020-02-10 20:41:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 20:41:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 646 transitions. [2020-02-10 20:41:11,556 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 646 transitions. Word has length 19 [2020-02-10 20:41:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:11,556 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 646 transitions. [2020-02-10 20:41:11,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 646 transitions. [2020-02-10 20:41:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:11,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:11,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:11,557 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash -694390430, now seen corresponding path program 157 times [2020-02-10 20:41:11,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:11,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228512067] [2020-02-10 20:41:11,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:11,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228512067] [2020-02-10 20:41:11,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:11,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:11,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109458784] [2020-02-10 20:41:11,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:11,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:11,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:11,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:11,750 INFO L87 Difference]: Start difference. First operand 213 states and 646 transitions. Second operand 8 states. [2020-02-10 20:41:11,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:11,824 INFO L93 Difference]: Finished difference Result 363 states and 936 transitions. [2020-02-10 20:41:11,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:11,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:11,826 INFO L225 Difference]: With dead ends: 363 [2020-02-10 20:41:11,826 INFO L226 Difference]: Without dead ends: 347 [2020-02-10 20:41:11,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-02-10 20:41:11,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 219. [2020-02-10 20:41:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 20:41:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 660 transitions. [2020-02-10 20:41:11,831 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 660 transitions. Word has length 19 [2020-02-10 20:41:11,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:11,831 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 660 transitions. [2020-02-10 20:41:11,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:11,832 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 660 transitions. [2020-02-10 20:41:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:11,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:11,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:11,832 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash -435332204, now seen corresponding path program 158 times [2020-02-10 20:41:11,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:11,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274158519] [2020-02-10 20:41:11,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:12,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274158519] [2020-02-10 20:41:12,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:12,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:12,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285069417] [2020-02-10 20:41:12,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:12,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:12,037 INFO L87 Difference]: Start difference. First operand 219 states and 660 transitions. Second operand 8 states. [2020-02-10 20:41:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:12,104 INFO L93 Difference]: Finished difference Result 357 states and 921 transitions. [2020-02-10 20:41:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:12,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:12,105 INFO L225 Difference]: With dead ends: 357 [2020-02-10 20:41:12,105 INFO L226 Difference]: Without dead ends: 344 [2020-02-10 20:41:12,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-02-10 20:41:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 216. [2020-02-10 20:41:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 653 transitions. [2020-02-10 20:41:12,111 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 653 transitions. Word has length 19 [2020-02-10 20:41:12,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:12,111 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 653 transitions. [2020-02-10 20:41:12,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 653 transitions. [2020-02-10 20:41:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:12,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:12,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:12,112 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:12,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash 399701158, now seen corresponding path program 159 times [2020-02-10 20:41:12,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:12,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428141957] [2020-02-10 20:41:12,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:12,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428141957] [2020-02-10 20:41:12,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:12,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:12,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985326222] [2020-02-10 20:41:12,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:12,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:12,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:12,314 INFO L87 Difference]: Start difference. First operand 216 states and 653 transitions. Second operand 8 states. [2020-02-10 20:41:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:12,384 INFO L93 Difference]: Finished difference Result 363 states and 933 transitions. [2020-02-10 20:41:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:12,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:12,385 INFO L225 Difference]: With dead ends: 363 [2020-02-10 20:41:12,386 INFO L226 Difference]: Without dead ends: 347 [2020-02-10 20:41:12,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-02-10 20:41:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 222. [2020-02-10 20:41:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-02-10 20:41:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 664 transitions. [2020-02-10 20:41:12,390 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 664 transitions. Word has length 19 [2020-02-10 20:41:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:12,391 INFO L479 AbstractCegarLoop]: Abstraction has 222 states and 664 transitions. [2020-02-10 20:41:12,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 664 transitions. [2020-02-10 20:41:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:12,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:12,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:12,392 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash -576503592, now seen corresponding path program 160 times [2020-02-10 20:41:12,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:12,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916538690] [2020-02-10 20:41:12,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:12,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916538690] [2020-02-10 20:41:12,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:12,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:12,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042764504] [2020-02-10 20:41:12,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:12,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:12,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:12,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:12,600 INFO L87 Difference]: Start difference. First operand 222 states and 664 transitions. Second operand 8 states. [2020-02-10 20:41:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:12,685 INFO L93 Difference]: Finished difference Result 360 states and 922 transitions. [2020-02-10 20:41:12,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:12,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:12,687 INFO L225 Difference]: With dead ends: 360 [2020-02-10 20:41:12,687 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 20:41:12,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 20:41:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 216. [2020-02-10 20:41:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 650 transitions. [2020-02-10 20:41:12,693 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 650 transitions. Word has length 19 [2020-02-10 20:41:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:12,693 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 650 transitions. [2020-02-10 20:41:12,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 650 transitions. [2020-02-10 20:41:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:12,693 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:12,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:12,694 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1883903552, now seen corresponding path program 161 times [2020-02-10 20:41:12,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:12,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916776788] [2020-02-10 20:41:12,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:12,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916776788] [2020-02-10 20:41:12,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:12,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:12,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679334897] [2020-02-10 20:41:12,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:12,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:12,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:12,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:12,894 INFO L87 Difference]: Start difference. First operand 216 states and 650 transitions. Second operand 8 states. [2020-02-10 20:41:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:12,957 INFO L93 Difference]: Finished difference Result 347 states and 894 transitions. [2020-02-10 20:41:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:12,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:12,959 INFO L225 Difference]: With dead ends: 347 [2020-02-10 20:41:12,959 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 20:41:12,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 20:41:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 218. [2020-02-10 20:41:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:41:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2020-02-10 20:41:12,964 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2020-02-10 20:41:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:12,965 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2020-02-10 20:41:12,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2020-02-10 20:41:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:12,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:12,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:12,965 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash -394498556, now seen corresponding path program 162 times [2020-02-10 20:41:12,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:12,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643599834] [2020-02-10 20:41:12,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:13,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643599834] [2020-02-10 20:41:13,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:13,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:13,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240337453] [2020-02-10 20:41:13,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:13,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:13,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:13,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:13,157 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand 8 states. [2020-02-10 20:41:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:13,244 INFO L93 Difference]: Finished difference Result 345 states and 889 transitions. [2020-02-10 20:41:13,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:13,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:13,246 INFO L225 Difference]: With dead ends: 345 [2020-02-10 20:41:13,246 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 20:41:13,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 20:41:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 213. [2020-02-10 20:41:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 20:41:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 643 transitions. [2020-02-10 20:41:13,251 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 643 transitions. Word has length 19 [2020-02-10 20:41:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:13,251 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 643 transitions. [2020-02-10 20:41:13,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 643 transitions. [2020-02-10 20:41:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:13,252 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:13,252 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:13,252 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:13,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:13,252 INFO L82 PathProgramCache]: Analyzing trace with hash 600573882, now seen corresponding path program 163 times [2020-02-10 20:41:13,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:13,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696910427] [2020-02-10 20:41:13,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:13,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696910427] [2020-02-10 20:41:13,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:13,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:13,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646032426] [2020-02-10 20:41:13,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:13,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:13,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:13,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:13,451 INFO L87 Difference]: Start difference. First operand 213 states and 643 transitions. Second operand 8 states. [2020-02-10 20:41:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:13,534 INFO L93 Difference]: Finished difference Result 353 states and 915 transitions. [2020-02-10 20:41:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:13,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:13,535 INFO L225 Difference]: With dead ends: 353 [2020-02-10 20:41:13,535 INFO L226 Difference]: Without dead ends: 339 [2020-02-10 20:41:13,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-02-10 20:41:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 217. [2020-02-10 20:41:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:41:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 653 transitions. [2020-02-10 20:41:13,541 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 653 transitions. Word has length 19 [2020-02-10 20:41:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:13,541 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 653 transitions. [2020-02-10 20:41:13,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 653 transitions. [2020-02-10 20:41:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:13,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:13,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:13,542 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:13,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1720703712, now seen corresponding path program 164 times [2020-02-10 20:41:13,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:13,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282551576] [2020-02-10 20:41:13,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:13,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282551576] [2020-02-10 20:41:13,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:13,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:13,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434509330] [2020-02-10 20:41:13,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:13,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:13,735 INFO L87 Difference]: Start difference. First operand 217 states and 653 transitions. Second operand 8 states. [2020-02-10 20:41:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:13,810 INFO L93 Difference]: Finished difference Result 349 states and 904 transitions. [2020-02-10 20:41:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:13,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:13,811 INFO L225 Difference]: With dead ends: 349 [2020-02-10 20:41:13,812 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 20:41:13,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 20:41:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 215. [2020-02-10 20:41:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:41:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 648 transitions. [2020-02-10 20:41:13,816 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 648 transitions. Word has length 19 [2020-02-10 20:41:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:13,816 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 648 transitions. [2020-02-10 20:41:13,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 648 transitions. [2020-02-10 20:41:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:13,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:13,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:13,817 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:13,817 INFO L82 PathProgramCache]: Analyzing trace with hash -472511498, now seen corresponding path program 165 times [2020-02-10 20:41:13,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:13,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980213213] [2020-02-10 20:41:13,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:14,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980213213] [2020-02-10 20:41:14,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:14,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:14,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787833358] [2020-02-10 20:41:14,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:14,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:14,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:14,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:14,020 INFO L87 Difference]: Start difference. First operand 215 states and 648 transitions. Second operand 8 states. [2020-02-10 20:41:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:14,101 INFO L93 Difference]: Finished difference Result 354 states and 915 transitions. [2020-02-10 20:41:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:14,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:14,102 INFO L225 Difference]: With dead ends: 354 [2020-02-10 20:41:14,102 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:41:14,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:41:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2020-02-10 20:41:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 20:41:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 658 transitions. [2020-02-10 20:41:14,107 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 658 transitions. Word has length 19 [2020-02-10 20:41:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:14,108 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 658 transitions. [2020-02-10 20:41:14,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 658 transitions. [2020-02-10 20:41:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:14,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:14,108 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:14,108 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:14,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1114568416, now seen corresponding path program 166 times [2020-02-10 20:41:14,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:14,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006616894] [2020-02-10 20:41:14,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:14,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006616894] [2020-02-10 20:41:14,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:14,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:14,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382510763] [2020-02-10 20:41:14,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:14,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:14,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:14,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:14,333 INFO L87 Difference]: Start difference. First operand 220 states and 658 transitions. Second operand 8 states. [2020-02-10 20:41:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:14,414 INFO L93 Difference]: Finished difference Result 353 states and 908 transitions. [2020-02-10 20:41:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:14,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:14,416 INFO L225 Difference]: With dead ends: 353 [2020-02-10 20:41:14,416 INFO L226 Difference]: Without dead ends: 335 [2020-02-10 20:41:14,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:14,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-02-10 20:41:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2020-02-10 20:41:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:41:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 646 transitions. [2020-02-10 20:41:14,421 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 646 transitions. Word has length 19 [2020-02-10 20:41:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:14,421 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 646 transitions. [2020-02-10 20:41:14,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 646 transitions. [2020-02-10 20:41:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:14,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:14,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:14,422 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:14,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:14,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1498552428, now seen corresponding path program 167 times [2020-02-10 20:41:14,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:14,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280658637] [2020-02-10 20:41:14,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:14,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280658637] [2020-02-10 20:41:14,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:14,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:14,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929520126] [2020-02-10 20:41:14,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:14,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:14,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:14,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:14,624 INFO L87 Difference]: Start difference. First operand 215 states and 646 transitions. Second operand 8 states. [2020-02-10 20:41:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:14,697 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2020-02-10 20:41:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:14,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:14,698 INFO L225 Difference]: With dead ends: 343 [2020-02-10 20:41:14,698 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 20:41:14,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 20:41:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 217. [2020-02-10 20:41:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:41:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 649 transitions. [2020-02-10 20:41:14,703 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 649 transitions. Word has length 19 [2020-02-10 20:41:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:14,704 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 649 transitions. [2020-02-10 20:41:14,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 649 transitions. [2020-02-10 20:41:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:14,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:14,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:14,704 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash -9147432, now seen corresponding path program 168 times [2020-02-10 20:41:14,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:14,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476923947] [2020-02-10 20:41:14,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:14,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476923947] [2020-02-10 20:41:14,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:14,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:14,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959526905] [2020-02-10 20:41:14,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:14,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:14,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:14,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:14,898 INFO L87 Difference]: Start difference. First operand 217 states and 649 transitions. Second operand 8 states. [2020-02-10 20:41:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:14,980 INFO L93 Difference]: Finished difference Result 341 states and 880 transitions. [2020-02-10 20:41:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:14,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:14,981 INFO L225 Difference]: With dead ends: 341 [2020-02-10 20:41:14,981 INFO L226 Difference]: Without dead ends: 319 [2020-02-10 20:41:14,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-02-10 20:41:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 208. [2020-02-10 20:41:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 20:41:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 632 transitions. [2020-02-10 20:41:14,986 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 632 transitions. Word has length 19 [2020-02-10 20:41:14,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:14,986 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 632 transitions. [2020-02-10 20:41:14,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 632 transitions. [2020-02-10 20:41:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:14,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:14,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:14,987 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1927068432, now seen corresponding path program 169 times [2020-02-10 20:41:14,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:14,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629545337] [2020-02-10 20:41:14,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:15,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629545337] [2020-02-10 20:41:15,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:15,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:15,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224719077] [2020-02-10 20:41:15,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:15,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:15,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:15,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:15,276 INFO L87 Difference]: Start difference. First operand 208 states and 632 transitions. Second operand 8 states. [2020-02-10 20:41:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:15,348 INFO L93 Difference]: Finished difference Result 378 states and 982 transitions. [2020-02-10 20:41:15,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:15,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:15,349 INFO L225 Difference]: With dead ends: 378 [2020-02-10 20:41:15,349 INFO L226 Difference]: Without dead ends: 362 [2020-02-10 20:41:15,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-02-10 20:41:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 224. [2020-02-10 20:41:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-02-10 20:41:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 674 transitions. [2020-02-10 20:41:15,356 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 674 transitions. Word has length 19 [2020-02-10 20:41:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:15,357 INFO L479 AbstractCegarLoop]: Abstraction has 224 states and 674 transitions. [2020-02-10 20:41:15,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 674 transitions. [2020-02-10 20:41:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:15,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:15,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:15,358 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1552417246, now seen corresponding path program 170 times [2020-02-10 20:41:15,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:15,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762990190] [2020-02-10 20:41:15,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:15,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762990190] [2020-02-10 20:41:15,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:15,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:15,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392853020] [2020-02-10 20:41:15,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:15,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:15,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:15,545 INFO L87 Difference]: Start difference. First operand 224 states and 674 transitions. Second operand 8 states. [2020-02-10 20:41:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:15,623 INFO L93 Difference]: Finished difference Result 376 states and 972 transitions. [2020-02-10 20:41:15,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:15,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:15,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:15,624 INFO L225 Difference]: With dead ends: 376 [2020-02-10 20:41:15,624 INFO L226 Difference]: Without dead ends: 354 [2020-02-10 20:41:15,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-02-10 20:41:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 216. [2020-02-10 20:41:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 656 transitions. [2020-02-10 20:41:15,629 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 656 transitions. Word has length 19 [2020-02-10 20:41:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:15,629 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 656 transitions. [2020-02-10 20:41:15,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 656 transitions. [2020-02-10 20:41:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:15,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:15,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:15,630 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1396871126, now seen corresponding path program 171 times [2020-02-10 20:41:15,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:15,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847691868] [2020-02-10 20:41:15,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:15,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847691868] [2020-02-10 20:41:15,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:15,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:15,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128531703] [2020-02-10 20:41:15,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:15,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:15,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:15,816 INFO L87 Difference]: Start difference. First operand 216 states and 656 transitions. Second operand 8 states. [2020-02-10 20:41:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:15,894 INFO L93 Difference]: Finished difference Result 369 states and 955 transitions. [2020-02-10 20:41:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:15,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:15,895 INFO L225 Difference]: With dead ends: 369 [2020-02-10 20:41:15,895 INFO L226 Difference]: Without dead ends: 353 [2020-02-10 20:41:15,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-02-10 20:41:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 219. [2020-02-10 20:41:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 20:41:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 660 transitions. [2020-02-10 20:41:15,900 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 660 transitions. Word has length 19 [2020-02-10 20:41:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:15,900 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 660 transitions. [2020-02-10 20:41:15,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 660 transitions. [2020-02-10 20:41:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:15,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:15,901 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:15,901 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:15,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:15,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1137812900, now seen corresponding path program 172 times [2020-02-10 20:41:15,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:15,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17378084] [2020-02-10 20:41:15,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:16,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17378084] [2020-02-10 20:41:16,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:16,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:16,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538228797] [2020-02-10 20:41:16,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:16,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:16,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:16,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:16,140 INFO L87 Difference]: Start difference. First operand 219 states and 660 transitions. Second operand 8 states. [2020-02-10 20:41:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:16,235 INFO L93 Difference]: Finished difference Result 363 states and 940 transitions. [2020-02-10 20:41:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:16,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:16,237 INFO L225 Difference]: With dead ends: 363 [2020-02-10 20:41:16,237 INFO L226 Difference]: Without dead ends: 350 [2020-02-10 20:41:16,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:16,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-02-10 20:41:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 216. [2020-02-10 20:41:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 653 transitions. [2020-02-10 20:41:16,247 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 653 transitions. Word has length 19 [2020-02-10 20:41:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:16,247 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 653 transitions. [2020-02-10 20:41:16,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 653 transitions. [2020-02-10 20:41:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:16,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:16,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:16,249 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:16,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:16,249 INFO L82 PathProgramCache]: Analyzing trace with hash 525434594, now seen corresponding path program 173 times [2020-02-10 20:41:16,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:16,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551945999] [2020-02-10 20:41:16,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:16,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551945999] [2020-02-10 20:41:16,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:16,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:16,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137431889] [2020-02-10 20:41:16,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:16,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:16,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:16,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:16,522 INFO L87 Difference]: Start difference. First operand 216 states and 653 transitions. Second operand 8 states. [2020-02-10 20:41:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:16,654 INFO L93 Difference]: Finished difference Result 364 states and 944 transitions. [2020-02-10 20:41:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:16,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:16,656 INFO L225 Difference]: With dead ends: 364 [2020-02-10 20:41:16,656 INFO L226 Difference]: Without dead ends: 350 [2020-02-10 20:41:16,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-02-10 20:41:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 218. [2020-02-10 20:41:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:41:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 656 transitions. [2020-02-10 20:41:16,665 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 656 transitions. Word has length 19 [2020-02-10 20:41:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:16,665 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 656 transitions. [2020-02-10 20:41:16,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 656 transitions. [2020-02-10 20:41:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:16,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:16,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:16,667 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:16,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1645564424, now seen corresponding path program 174 times [2020-02-10 20:41:16,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:16,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309247900] [2020-02-10 20:41:16,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:16,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309247900] [2020-02-10 20:41:16,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:16,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:16,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600461712] [2020-02-10 20:41:16,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:16,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:16,914 INFO L87 Difference]: Start difference. First operand 218 states and 656 transitions. Second operand 8 states. [2020-02-10 20:41:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:16,977 INFO L93 Difference]: Finished difference Result 360 states and 933 transitions. [2020-02-10 20:41:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:16,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:16,979 INFO L225 Difference]: With dead ends: 360 [2020-02-10 20:41:16,979 INFO L226 Difference]: Without dead ends: 344 [2020-02-10 20:41:16,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-02-10 20:41:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 212. [2020-02-10 20:41:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:41:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 644 transitions. [2020-02-10 20:41:16,984 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 644 transitions. Word has length 19 [2020-02-10 20:41:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:16,984 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 644 transitions. [2020-02-10 20:41:16,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 644 transitions. [2020-02-10 20:41:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:16,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:16,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:16,985 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:16,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1945413138, now seen corresponding path program 175 times [2020-02-10 20:41:16,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:16,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783106119] [2020-02-10 20:41:16,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:17,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783106119] [2020-02-10 20:41:17,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:17,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:17,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362063333] [2020-02-10 20:41:17,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:17,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:17,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:17,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:17,185 INFO L87 Difference]: Start difference. First operand 212 states and 644 transitions. Second operand 8 states. [2020-02-10 20:41:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:17,243 INFO L93 Difference]: Finished difference Result 380 states and 985 transitions. [2020-02-10 20:41:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:17,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:17,244 INFO L225 Difference]: With dead ends: 380 [2020-02-10 20:41:17,244 INFO L226 Difference]: Without dead ends: 364 [2020-02-10 20:41:17,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-02-10 20:41:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 226. [2020-02-10 20:41:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-02-10 20:41:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 679 transitions. [2020-02-10 20:41:17,250 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 679 transitions. Word has length 19 [2020-02-10 20:41:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:17,250 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 679 transitions. [2020-02-10 20:41:17,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 679 transitions. [2020-02-10 20:41:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:17,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:17,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:17,251 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1974902972, now seen corresponding path program 176 times [2020-02-10 20:41:17,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:17,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435535397] [2020-02-10 20:41:17,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:17,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435535397] [2020-02-10 20:41:17,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:17,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:17,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319496679] [2020-02-10 20:41:17,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:17,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:17,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:17,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:17,468 INFO L87 Difference]: Start difference. First operand 226 states and 679 transitions. Second operand 8 states. [2020-02-10 20:41:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:17,551 INFO L93 Difference]: Finished difference Result 378 states and 975 transitions. [2020-02-10 20:41:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:17,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:17,553 INFO L225 Difference]: With dead ends: 378 [2020-02-10 20:41:17,553 INFO L226 Difference]: Without dead ends: 356 [2020-02-10 20:41:17,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-02-10 20:41:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 218. [2020-02-10 20:41:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:41:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 659 transitions. [2020-02-10 20:41:17,558 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 659 transitions. Word has length 19 [2020-02-10 20:41:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:17,558 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 659 transitions. [2020-02-10 20:41:17,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 659 transitions. [2020-02-10 20:41:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:17,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:17,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:17,559 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:17,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:17,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1493760628, now seen corresponding path program 177 times [2020-02-10 20:41:17,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:17,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535121365] [2020-02-10 20:41:17,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:17,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535121365] [2020-02-10 20:41:17,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:17,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:17,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742445338] [2020-02-10 20:41:17,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:17,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:17,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:17,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:17,783 INFO L87 Difference]: Start difference. First operand 218 states and 659 transitions. Second operand 8 states. [2020-02-10 20:41:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:17,852 INFO L93 Difference]: Finished difference Result 375 states and 968 transitions. [2020-02-10 20:41:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:17,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:17,854 INFO L225 Difference]: With dead ends: 375 [2020-02-10 20:41:17,854 INFO L226 Difference]: Without dead ends: 359 [2020-02-10 20:41:17,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-02-10 20:41:17,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 223. [2020-02-10 20:41:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-02-10 20:41:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 668 transitions. [2020-02-10 20:41:17,860 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 668 transitions. Word has length 19 [2020-02-10 20:41:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:17,860 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 668 transitions. [2020-02-10 20:41:17,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 668 transitions. [2020-02-10 20:41:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:17,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:17,860 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:17,860 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:17,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:17,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2050144574, now seen corresponding path program 178 times [2020-02-10 20:41:17,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:17,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855551780] [2020-02-10 20:41:17,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:18,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855551780] [2020-02-10 20:41:18,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:18,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:18,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5662221] [2020-02-10 20:41:18,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:18,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:18,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:18,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:18,062 INFO L87 Difference]: Start difference. First operand 223 states and 668 transitions. Second operand 8 states. [2020-02-10 20:41:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:18,145 INFO L93 Difference]: Finished difference Result 371 states and 956 transitions. [2020-02-10 20:41:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:18,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:18,146 INFO L225 Difference]: With dead ends: 371 [2020-02-10 20:41:18,146 INFO L226 Difference]: Without dead ends: 354 [2020-02-10 20:41:18,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-02-10 20:41:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 218. [2020-02-10 20:41:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:41:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-02-10 20:41:18,152 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-02-10 20:41:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:18,152 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-02-10 20:41:18,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-02-10 20:41:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:18,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:18,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:18,152 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:18,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:18,153 INFO L82 PathProgramCache]: Analyzing trace with hash 780024098, now seen corresponding path program 179 times [2020-02-10 20:41:18,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:18,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509877019] [2020-02-10 20:41:18,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:18,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509877019] [2020-02-10 20:41:18,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:18,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:18,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195851299] [2020-02-10 20:41:18,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:18,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:18,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:18,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:18,339 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-02-10 20:41:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:18,429 INFO L93 Difference]: Finished difference Result 370 states and 955 transitions. [2020-02-10 20:41:18,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:18,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:18,430 INFO L225 Difference]: With dead ends: 370 [2020-02-10 20:41:18,430 INFO L226 Difference]: Without dead ends: 356 [2020-02-10 20:41:18,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-02-10 20:41:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 222. [2020-02-10 20:41:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-02-10 20:41:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 662 transitions. [2020-02-10 20:41:18,436 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 662 transitions. Word has length 19 [2020-02-10 20:41:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:18,436 INFO L479 AbstractCegarLoop]: Abstraction has 222 states and 662 transitions. [2020-02-10 20:41:18,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 662 transitions. [2020-02-10 20:41:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:18,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:18,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:18,437 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:18,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash 779429452, now seen corresponding path program 180 times [2020-02-10 20:41:18,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:18,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706745771] [2020-02-10 20:41:18,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:18,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706745771] [2020-02-10 20:41:18,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:18,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:18,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233497505] [2020-02-10 20:41:18,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:18,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:18,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:18,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:18,624 INFO L87 Difference]: Start difference. First operand 222 states and 662 transitions. Second operand 8 states. [2020-02-10 20:41:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:18,712 INFO L93 Difference]: Finished difference Result 368 states and 947 transitions. [2020-02-10 20:41:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:18,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:18,714 INFO L225 Difference]: With dead ends: 368 [2020-02-10 20:41:18,714 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 20:41:18,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 20:41:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 212. [2020-02-10 20:41:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:41:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 640 transitions. [2020-02-10 20:41:18,719 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 640 transitions. Word has length 19 [2020-02-10 20:41:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:18,719 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 640 transitions. [2020-02-10 20:41:18,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 640 transitions. [2020-02-10 20:41:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:18,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:18,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:18,719 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash -637075472, now seen corresponding path program 181 times [2020-02-10 20:41:18,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:18,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127156103] [2020-02-10 20:41:18,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:18,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127156103] [2020-02-10 20:41:18,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:18,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:18,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125830934] [2020-02-10 20:41:18,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:18,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:18,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:18,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:18,910 INFO L87 Difference]: Start difference. First operand 212 states and 640 transitions. Second operand 8 states. [2020-02-10 20:41:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:18,980 INFO L93 Difference]: Finished difference Result 357 states and 917 transitions. [2020-02-10 20:41:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:18,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:18,981 INFO L225 Difference]: With dead ends: 357 [2020-02-10 20:41:18,981 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 20:41:18,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 20:41:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 218. [2020-02-10 20:41:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:41:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-02-10 20:41:18,987 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-02-10 20:41:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:18,987 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-02-10 20:41:18,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-02-10 20:41:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:18,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:18,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:18,987 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:18,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:18,988 INFO L82 PathProgramCache]: Analyzing trace with hash -378017246, now seen corresponding path program 182 times [2020-02-10 20:41:18,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:18,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135412150] [2020-02-10 20:41:18,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:19,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135412150] [2020-02-10 20:41:19,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:19,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:19,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133819386] [2020-02-10 20:41:19,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:19,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:19,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:19,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:19,210 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-02-10 20:41:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:19,277 INFO L93 Difference]: Finished difference Result 351 states and 902 transitions. [2020-02-10 20:41:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:19,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:19,278 INFO L225 Difference]: With dead ends: 351 [2020-02-10 20:41:19,279 INFO L226 Difference]: Without dead ends: 338 [2020-02-10 20:41:19,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-02-10 20:41:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 215. [2020-02-10 20:41:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:41:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 647 transitions. [2020-02-10 20:41:19,284 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 647 transitions. Word has length 19 [2020-02-10 20:41:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:19,284 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 647 transitions. [2020-02-10 20:41:19,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 647 transitions. [2020-02-10 20:41:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:19,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:19,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:19,285 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:19,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:19,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2057453970, now seen corresponding path program 183 times [2020-02-10 20:41:19,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:19,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004566175] [2020-02-10 20:41:19,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:19,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004566175] [2020-02-10 20:41:19,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:19,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:19,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694296112] [2020-02-10 20:41:19,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:19,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:19,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:19,498 INFO L87 Difference]: Start difference. First operand 215 states and 647 transitions. Second operand 8 states. [2020-02-10 20:41:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:19,569 INFO L93 Difference]: Finished difference Result 356 states and 912 transitions. [2020-02-10 20:41:19,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:19,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:19,570 INFO L225 Difference]: With dead ends: 356 [2020-02-10 20:41:19,570 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:41:19,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:41:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2020-02-10 20:41:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 20:41:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 656 transitions. [2020-02-10 20:41:19,575 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 656 transitions. Word has length 19 [2020-02-10 20:41:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:19,575 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 656 transitions. [2020-02-10 20:41:19,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 656 transitions. [2020-02-10 20:41:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:19,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:19,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:19,576 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:19,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1306391876, now seen corresponding path program 184 times [2020-02-10 20:41:19,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:19,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449615746] [2020-02-10 20:41:19,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:19,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449615746] [2020-02-10 20:41:19,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:19,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:19,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133973562] [2020-02-10 20:41:19,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:19,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:19,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:19,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:19,770 INFO L87 Difference]: Start difference. First operand 220 states and 656 transitions. Second operand 8 states. [2020-02-10 20:41:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:19,864 INFO L93 Difference]: Finished difference Result 352 states and 900 transitions. [2020-02-10 20:41:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:19,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:19,865 INFO L225 Difference]: With dead ends: 352 [2020-02-10 20:41:19,865 INFO L226 Difference]: Without dead ends: 335 [2020-02-10 20:41:19,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-02-10 20:41:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2020-02-10 20:41:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:41:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2020-02-10 20:41:19,870 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2020-02-10 20:41:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:19,870 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2020-02-10 20:41:19,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2020-02-10 20:41:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:19,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:19,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:19,871 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:19,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:19,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1837091698, now seen corresponding path program 185 times [2020-02-10 20:41:19,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:19,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558785913] [2020-02-10 20:41:19,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:20,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558785913] [2020-02-10 20:41:20,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:20,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:20,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452665204] [2020-02-10 20:41:20,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:20,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:20,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:20,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:20,068 INFO L87 Difference]: Start difference. First operand 215 states and 644 transitions. Second operand 8 states. [2020-02-10 20:41:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:20,129 INFO L93 Difference]: Finished difference Result 341 states and 876 transitions. [2020-02-10 20:41:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:20,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:20,130 INFO L225 Difference]: With dead ends: 341 [2020-02-10 20:41:20,130 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 20:41:20,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 20:41:20,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 217. [2020-02-10 20:41:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:41:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 647 transitions. [2020-02-10 20:41:20,136 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 647 transitions. Word has length 19 [2020-02-10 20:41:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:20,136 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 647 transitions. [2020-02-10 20:41:20,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 647 transitions. [2020-02-10 20:41:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:20,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:20,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:20,137 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:20,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:20,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1602568944, now seen corresponding path program 186 times [2020-02-10 20:41:20,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:20,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895955499] [2020-02-10 20:41:20,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:20,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895955499] [2020-02-10 20:41:20,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:20,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:20,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617381115] [2020-02-10 20:41:20,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:20,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:20,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:20,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:20,345 INFO L87 Difference]: Start difference. First operand 217 states and 647 transitions. Second operand 8 states. [2020-02-10 20:41:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:20,436 INFO L93 Difference]: Finished difference Result 339 states and 871 transitions. [2020-02-10 20:41:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:20,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:20,438 INFO L225 Difference]: With dead ends: 339 [2020-02-10 20:41:20,438 INFO L226 Difference]: Without dead ends: 322 [2020-02-10 20:41:20,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-02-10 20:41:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2020-02-10 20:41:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:41:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-02-10 20:41:20,446 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-02-10 20:41:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:20,447 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-02-10 20:41:20,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-02-10 20:41:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:20,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:20,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:20,448 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2036640602, now seen corresponding path program 187 times [2020-02-10 20:41:20,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:20,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410346477] [2020-02-10 20:41:20,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:20,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410346477] [2020-02-10 20:41:20,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:20,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:20,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581798631] [2020-02-10 20:41:20,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:20,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:20,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:20,682 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-02-10 20:41:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:20,770 INFO L93 Difference]: Finished difference Result 347 states and 896 transitions. [2020-02-10 20:41:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:20,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:20,771 INFO L225 Difference]: With dead ends: 347 [2020-02-10 20:41:20,771 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 20:41:20,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:20,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 20:41:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 216. [2020-02-10 20:41:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 647 transitions. [2020-02-10 20:41:20,776 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 647 transitions. Word has length 19 [2020-02-10 20:41:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:20,776 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 647 transitions. [2020-02-10 20:41:20,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 647 transitions. [2020-02-10 20:41:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:20,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:20,777 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:20,777 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:20,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:20,778 INFO L82 PathProgramCache]: Analyzing trace with hash -916510772, now seen corresponding path program 188 times [2020-02-10 20:41:20,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:20,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299012532] [2020-02-10 20:41:20,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:20,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299012532] [2020-02-10 20:41:20,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:20,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:20,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294659821] [2020-02-10 20:41:20,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:20,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:20,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:20,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:20,960 INFO L87 Difference]: Start difference. First operand 216 states and 647 transitions. Second operand 8 states. [2020-02-10 20:41:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:21,022 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2020-02-10 20:41:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:21,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:21,023 INFO L225 Difference]: With dead ends: 343 [2020-02-10 20:41:21,023 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 20:41:21,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 20:41:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 214. [2020-02-10 20:41:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 20:41:21,029 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 20:41:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:21,029 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 20:41:21,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 20:41:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:21,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:21,030 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:21,030 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1513624196, now seen corresponding path program 189 times [2020-02-10 20:41:21,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:21,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054683710] [2020-02-10 20:41:21,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:21,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054683710] [2020-02-10 20:41:21,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:21,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:21,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993109503] [2020-02-10 20:41:21,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:21,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:21,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:21,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:21,210 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 20:41:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:21,301 INFO L93 Difference]: Finished difference Result 347 states and 894 transitions. [2020-02-10 20:41:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:21,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:21,303 INFO L225 Difference]: With dead ends: 347 [2020-02-10 20:41:21,303 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 20:41:21,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 20:41:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2020-02-10 20:41:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:41:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 650 transitions. [2020-02-10 20:41:21,309 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 650 transitions. Word has length 19 [2020-02-10 20:41:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:21,310 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 650 transitions. [2020-02-10 20:41:21,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 650 transitions. [2020-02-10 20:41:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:21,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:21,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:21,311 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:21,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash 768327052, now seen corresponding path program 190 times [2020-02-10 20:41:21,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:21,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996579380] [2020-02-10 20:41:21,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:21,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996579380] [2020-02-10 20:41:21,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:21,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:21,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203298654] [2020-02-10 20:41:21,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:21,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:21,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:21,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:21,500 INFO L87 Difference]: Start difference. First operand 218 states and 650 transitions. Second operand 8 states. [2020-02-10 20:41:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:21,581 INFO L93 Difference]: Finished difference Result 345 states and 886 transitions. [2020-02-10 20:41:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:21,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:21,582 INFO L225 Difference]: With dead ends: 345 [2020-02-10 20:41:21,582 INFO L226 Difference]: Without dead ends: 329 [2020-02-10 20:41:21,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-02-10 20:41:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 214. [2020-02-10 20:41:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2020-02-10 20:41:21,587 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 19 [2020-02-10 20:41:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:21,588 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2020-02-10 20:41:21,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2020-02-10 20:41:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:21,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:21,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:21,588 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:21,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:21,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1451740574, now seen corresponding path program 191 times [2020-02-10 20:41:21,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:21,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666862921] [2020-02-10 20:41:21,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:21,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666862921] [2020-02-10 20:41:21,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:21,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:21,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96961497] [2020-02-10 20:41:21,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:21,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:21,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:21,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:21,788 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand 8 states. [2020-02-10 20:41:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:21,848 INFO L93 Difference]: Finished difference Result 337 states and 867 transitions. [2020-02-10 20:41:21,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:21,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:21,850 INFO L225 Difference]: With dead ends: 337 [2020-02-10 20:41:21,850 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 20:41:21,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 20:41:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 216. [2020-02-10 20:41:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 643 transitions. [2020-02-10 20:41:21,854 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 643 transitions. Word has length 19 [2020-02-10 20:41:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:21,855 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 643 transitions. [2020-02-10 20:41:21,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 643 transitions. [2020-02-10 20:41:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:21,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:21,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:21,855 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:21,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1987920068, now seen corresponding path program 192 times [2020-02-10 20:41:21,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:21,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480221247] [2020-02-10 20:41:21,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:22,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480221247] [2020-02-10 20:41:22,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:22,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:22,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791008837] [2020-02-10 20:41:22,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:22,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:22,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:22,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:22,043 INFO L87 Difference]: Start difference. First operand 216 states and 643 transitions. Second operand 8 states. [2020-02-10 20:41:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:22,126 INFO L93 Difference]: Finished difference Result 335 states and 862 transitions. [2020-02-10 20:41:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:22,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:22,128 INFO L225 Difference]: With dead ends: 335 [2020-02-10 20:41:22,128 INFO L226 Difference]: Without dead ends: 315 [2020-02-10 20:41:22,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-02-10 20:41:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 208. [2020-02-10 20:41:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 20:41:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 628 transitions. [2020-02-10 20:41:22,133 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 628 transitions. Word has length 19 [2020-02-10 20:41:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:22,133 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 628 transitions. [2020-02-10 20:41:22,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 628 transitions. [2020-02-10 20:41:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:22,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:22,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:22,134 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:22,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash 807111978, now seen corresponding path program 193 times [2020-02-10 20:41:22,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:22,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598753120] [2020-02-10 20:41:22,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:22,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598753120] [2020-02-10 20:41:22,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:22,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:22,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147759993] [2020-02-10 20:41:22,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:22,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:22,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:22,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:22,335 INFO L87 Difference]: Start difference. First operand 208 states and 628 transitions. Second operand 8 states. [2020-02-10 20:41:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:22,393 INFO L93 Difference]: Finished difference Result 357 states and 929 transitions. [2020-02-10 20:41:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:22,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:22,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:22,394 INFO L225 Difference]: With dead ends: 357 [2020-02-10 20:41:22,394 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 20:41:22,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 20:41:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 217. [2020-02-10 20:41:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:41:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 655 transitions. [2020-02-10 20:41:22,399 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 655 transitions. Word has length 19 [2020-02-10 20:41:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:22,399 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 655 transitions. [2020-02-10 20:41:22,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 655 transitions. [2020-02-10 20:41:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:22,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:22,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:22,400 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1066170204, now seen corresponding path program 194 times [2020-02-10 20:41:22,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:22,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989466172] [2020-02-10 20:41:22,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:22,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989466172] [2020-02-10 20:41:22,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:22,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:22,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678474304] [2020-02-10 20:41:22,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:22,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:22,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:22,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:22,602 INFO L87 Difference]: Start difference. First operand 217 states and 655 transitions. Second operand 8 states. [2020-02-10 20:41:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:22,666 INFO L93 Difference]: Finished difference Result 351 states and 914 transitions. [2020-02-10 20:41:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:22,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:22,667 INFO L225 Difference]: With dead ends: 351 [2020-02-10 20:41:22,667 INFO L226 Difference]: Without dead ends: 338 [2020-02-10 20:41:22,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-02-10 20:41:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 214. [2020-02-10 20:41:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 648 transitions. [2020-02-10 20:41:22,673 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 648 transitions. Word has length 19 [2020-02-10 20:41:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:22,673 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 648 transitions. [2020-02-10 20:41:22,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 648 transitions. [2020-02-10 20:41:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:22,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:22,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:22,674 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:22,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:22,674 INFO L82 PathProgramCache]: Analyzing trace with hash -793325876, now seen corresponding path program 195 times [2020-02-10 20:41:22,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:22,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773360804] [2020-02-10 20:41:22,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:22,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773360804] [2020-02-10 20:41:22,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:22,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:22,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790353094] [2020-02-10 20:41:22,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:22,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:22,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:22,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:22,875 INFO L87 Difference]: Start difference. First operand 214 states and 648 transitions. Second operand 8 states. [2020-02-10 20:41:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:22,951 INFO L93 Difference]: Finished difference Result 361 states and 938 transitions. [2020-02-10 20:41:22,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:22,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:22,952 INFO L225 Difference]: With dead ends: 361 [2020-02-10 20:41:22,952 INFO L226 Difference]: Without dead ends: 345 [2020-02-10 20:41:22,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-02-10 20:41:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 219. [2020-02-10 20:41:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 20:41:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 657 transitions. [2020-02-10 20:41:22,957 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 657 transitions. Word has length 19 [2020-02-10 20:41:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:22,957 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 657 transitions. [2020-02-10 20:41:22,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 657 transitions. [2020-02-10 20:41:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:22,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:22,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:22,958 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1544387970, now seen corresponding path program 196 times [2020-02-10 20:41:22,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:22,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135875897] [2020-02-10 20:41:22,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:23,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135875897] [2020-02-10 20:41:23,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:23,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:23,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190222512] [2020-02-10 20:41:23,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:23,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:23,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:23,171 INFO L87 Difference]: Start difference. First operand 219 states and 657 transitions. Second operand 8 states. [2020-02-10 20:41:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:23,257 INFO L93 Difference]: Finished difference Result 357 states and 926 transitions. [2020-02-10 20:41:23,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:23,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:23,259 INFO L225 Difference]: With dead ends: 357 [2020-02-10 20:41:23,259 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:41:23,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:41:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 214. [2020-02-10 20:41:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 645 transitions. [2020-02-10 20:41:23,266 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 645 transitions. Word has length 19 [2020-02-10 20:41:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:23,266 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 645 transitions. [2020-02-10 20:41:23,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 645 transitions. [2020-02-10 20:41:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:23,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:23,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:23,267 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:23,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:23,267 INFO L82 PathProgramCache]: Analyzing trace with hash -392904248, now seen corresponding path program 197 times [2020-02-10 20:41:23,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:23,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902324042] [2020-02-10 20:41:23,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:23,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902324042] [2020-02-10 20:41:23,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:23,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:23,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157472067] [2020-02-10 20:41:23,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:23,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:23,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:23,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:23,471 INFO L87 Difference]: Start difference. First operand 214 states and 645 transitions. Second operand 8 states. [2020-02-10 20:41:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:23,541 INFO L93 Difference]: Finished difference Result 346 states and 902 transitions. [2020-02-10 20:41:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:23,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:23,542 INFO L225 Difference]: With dead ends: 346 [2020-02-10 20:41:23,542 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 20:41:23,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 20:41:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 216. [2020-02-10 20:41:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 648 transitions. [2020-02-10 20:41:23,548 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 648 transitions. Word has length 19 [2020-02-10 20:41:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:23,548 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 648 transitions. [2020-02-10 20:41:23,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 648 transitions. [2020-02-10 20:41:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:23,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:23,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:23,549 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:23,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:23,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1248210902, now seen corresponding path program 198 times [2020-02-10 20:41:23,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:23,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876811312] [2020-02-10 20:41:23,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:23,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876811312] [2020-02-10 20:41:23,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:23,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:23,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415449131] [2020-02-10 20:41:23,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:23,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:23,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:23,747 INFO L87 Difference]: Start difference. First operand 216 states and 648 transitions. Second operand 8 states. [2020-02-10 20:41:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:23,834 INFO L93 Difference]: Finished difference Result 348 states and 905 transitions. [2020-02-10 20:41:23,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:23,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:23,836 INFO L225 Difference]: With dead ends: 348 [2020-02-10 20:41:23,836 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 20:41:23,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 20:41:23,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 211. [2020-02-10 20:41:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 20:41:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 638 transitions. [2020-02-10 20:41:23,841 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 638 transitions. Word has length 19 [2020-02-10 20:41:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:23,841 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 638 transitions. [2020-02-10 20:41:23,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 638 transitions. [2020-02-10 20:41:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:23,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:23,842 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:23,842 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:23,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:23,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1561821240, now seen corresponding path program 199 times [2020-02-10 20:41:23,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:23,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313538040] [2020-02-10 20:41:23,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:24,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313538040] [2020-02-10 20:41:24,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:24,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:24,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953831413] [2020-02-10 20:41:24,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:24,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:24,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:24,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:24,049 INFO L87 Difference]: Start difference. First operand 211 states and 638 transitions. Second operand 8 states. [2020-02-10 20:41:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:24,107 INFO L93 Difference]: Finished difference Result 359 states and 931 transitions. [2020-02-10 20:41:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:24,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:24,108 INFO L225 Difference]: With dead ends: 359 [2020-02-10 20:41:24,108 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 20:41:24,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 20:41:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 217. [2020-02-10 20:41:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:41:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 652 transitions. [2020-02-10 20:41:24,114 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 652 transitions. Word has length 19 [2020-02-10 20:41:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:24,114 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 652 transitions. [2020-02-10 20:41:24,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 652 transitions. [2020-02-10 20:41:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:24,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:24,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:24,115 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1302763014, now seen corresponding path program 200 times [2020-02-10 20:41:24,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:24,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480971250] [2020-02-10 20:41:24,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:24,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480971250] [2020-02-10 20:41:24,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:24,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:24,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912196205] [2020-02-10 20:41:24,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:24,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:24,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:24,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:24,310 INFO L87 Difference]: Start difference. First operand 217 states and 652 transitions. Second operand 8 states. [2020-02-10 20:41:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:24,368 INFO L93 Difference]: Finished difference Result 353 states and 916 transitions. [2020-02-10 20:41:24,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:24,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:24,369 INFO L225 Difference]: With dead ends: 353 [2020-02-10 20:41:24,369 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:41:24,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:41:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 214. [2020-02-10 20:41:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 645 transitions. [2020-02-10 20:41:24,374 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 645 transitions. Word has length 19 [2020-02-10 20:41:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:24,375 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 645 transitions. [2020-02-10 20:41:24,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 645 transitions. [2020-02-10 20:41:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:24,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:24,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:24,375 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash -467729652, now seen corresponding path program 201 times [2020-02-10 20:41:24,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:24,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714993814] [2020-02-10 20:41:24,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:24,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714993814] [2020-02-10 20:41:24,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:24,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:24,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840654728] [2020-02-10 20:41:24,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:24,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:24,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:24,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:24,592 INFO L87 Difference]: Start difference. First operand 214 states and 645 transitions. Second operand 8 states. [2020-02-10 20:41:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:24,654 INFO L93 Difference]: Finished difference Result 365 states and 945 transitions. [2020-02-10 20:41:24,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:24,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:24,656 INFO L225 Difference]: With dead ends: 365 [2020-02-10 20:41:24,656 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 20:41:24,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 20:41:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 220. [2020-02-10 20:41:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 20:41:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 656 transitions. [2020-02-10 20:41:24,661 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 656 transitions. Word has length 19 [2020-02-10 20:41:24,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:24,662 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 656 transitions. [2020-02-10 20:41:24,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 656 transitions. [2020-02-10 20:41:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:24,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:24,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:24,662 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:24,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:24,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1443934402, now seen corresponding path program 202 times [2020-02-10 20:41:24,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:24,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485527201] [2020-02-10 20:41:24,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:24,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485527201] [2020-02-10 20:41:24,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:24,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:24,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618401815] [2020-02-10 20:41:24,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:24,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:24,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:24,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:24,851 INFO L87 Difference]: Start difference. First operand 220 states and 656 transitions. Second operand 8 states. [2020-02-10 20:41:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:24,940 INFO L93 Difference]: Finished difference Result 362 states and 934 transitions. [2020-02-10 20:41:24,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:24,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:24,941 INFO L225 Difference]: With dead ends: 362 [2020-02-10 20:41:24,941 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 20:41:24,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 20:41:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 214. [2020-02-10 20:41:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 20:41:24,946 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 20:41:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:24,947 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 20:41:24,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 20:41:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:24,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:24,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:24,948 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:24,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1543632934, now seen corresponding path program 203 times [2020-02-10 20:41:24,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:24,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223944094] [2020-02-10 20:41:24,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:25,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223944094] [2020-02-10 20:41:25,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:25,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:25,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354101997] [2020-02-10 20:41:25,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:25,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:25,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:25,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:25,138 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 20:41:25,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:25,205 INFO L93 Difference]: Finished difference Result 349 states and 906 transitions. [2020-02-10 20:41:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:25,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:25,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:25,206 INFO L225 Difference]: With dead ends: 349 [2020-02-10 20:41:25,206 INFO L226 Difference]: Without dead ends: 339 [2020-02-10 20:41:25,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-02-10 20:41:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 216. [2020-02-10 20:41:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 645 transitions. [2020-02-10 20:41:25,211 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 645 transitions. Word has length 19 [2020-02-10 20:41:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:25,212 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 645 transitions. [2020-02-10 20:41:25,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 645 transitions. [2020-02-10 20:41:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:25,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:25,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:25,212 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:25,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1261929366, now seen corresponding path program 204 times [2020-02-10 20:41:25,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:25,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57078903] [2020-02-10 20:41:25,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:25,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57078903] [2020-02-10 20:41:25,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:25,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:25,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125877118] [2020-02-10 20:41:25,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:25,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:25,398 INFO L87 Difference]: Start difference. First operand 216 states and 645 transitions. Second operand 8 states. [2020-02-10 20:41:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:25,475 INFO L93 Difference]: Finished difference Result 352 states and 911 transitions. [2020-02-10 20:41:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:25,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:25,477 INFO L225 Difference]: With dead ends: 352 [2020-02-10 20:41:25,477 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 20:41:25,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 20:41:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 211. [2020-02-10 20:41:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 20:41:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 635 transitions. [2020-02-10 20:41:25,482 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 635 transitions. Word has length 19 [2020-02-10 20:41:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:25,482 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 635 transitions. [2020-02-10 20:41:25,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 635 transitions. [2020-02-10 20:41:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:25,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:25,483 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:25,483 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1236225016, now seen corresponding path program 205 times [2020-02-10 20:41:25,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:25,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077927819] [2020-02-10 20:41:25,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:25,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077927819] [2020-02-10 20:41:25,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:25,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:25,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562956630] [2020-02-10 20:41:25,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:25,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:25,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:25,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:25,684 INFO L87 Difference]: Start difference. First operand 211 states and 635 transitions. Second operand 8 states. [2020-02-10 20:41:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:25,741 INFO L93 Difference]: Finished difference Result 366 states and 949 transitions. [2020-02-10 20:41:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:25,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:25,743 INFO L225 Difference]: With dead ends: 366 [2020-02-10 20:41:25,743 INFO L226 Difference]: Without dead ends: 350 [2020-02-10 20:41:25,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-02-10 20:41:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 221. [2020-02-10 20:41:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-02-10 20:41:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 663 transitions. [2020-02-10 20:41:25,748 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 663 transitions. Word has length 19 [2020-02-10 20:41:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:25,748 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 663 transitions. [2020-02-10 20:41:25,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 663 transitions. [2020-02-10 20:41:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:25,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:25,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:25,749 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:25,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1987287110, now seen corresponding path program 206 times [2020-02-10 20:41:25,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:25,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205778530] [2020-02-10 20:41:25,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:25,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205778530] [2020-02-10 20:41:25,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:25,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:25,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149909967] [2020-02-10 20:41:25,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:25,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:25,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:25,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:25,945 INFO L87 Difference]: Start difference. First operand 221 states and 663 transitions. Second operand 8 states. [2020-02-10 20:41:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:26,019 INFO L93 Difference]: Finished difference Result 362 states and 937 transitions. [2020-02-10 20:41:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:26,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:26,020 INFO L225 Difference]: With dead ends: 362 [2020-02-10 20:41:26,020 INFO L226 Difference]: Without dead ends: 345 [2020-02-10 20:41:26,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-02-10 20:41:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 216. [2020-02-10 20:41:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 649 transitions. [2020-02-10 20:41:26,026 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 649 transitions. Word has length 19 [2020-02-10 20:41:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:26,026 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 649 transitions. [2020-02-10 20:41:26,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 649 transitions. [2020-02-10 20:41:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:26,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:26,026 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:26,026 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:26,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1458304426, now seen corresponding path program 207 times [2020-02-10 20:41:26,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:26,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136196645] [2020-02-10 20:41:26,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:26,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136196645] [2020-02-10 20:41:26,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:26,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:26,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326632720] [2020-02-10 20:41:26,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:26,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:26,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:26,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:26,225 INFO L87 Difference]: Start difference. First operand 216 states and 649 transitions. Second operand 8 states. [2020-02-10 20:41:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:26,288 INFO L93 Difference]: Finished difference Result 368 states and 949 transitions. [2020-02-10 20:41:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:26,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:26,289 INFO L225 Difference]: With dead ends: 368 [2020-02-10 20:41:26,290 INFO L226 Difference]: Without dead ends: 352 [2020-02-10 20:41:26,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-02-10 20:41:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 222. [2020-02-10 20:41:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-02-10 20:41:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 660 transitions. [2020-02-10 20:41:26,295 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 660 transitions. Word has length 19 [2020-02-10 20:41:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:26,295 INFO L479 AbstractCegarLoop]: Abstraction has 222 states and 660 transitions. [2020-02-10 20:41:26,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 660 transitions. [2020-02-10 20:41:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:26,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:26,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:26,296 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash 482099676, now seen corresponding path program 208 times [2020-02-10 20:41:26,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:26,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10070855] [2020-02-10 20:41:26,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:26,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10070855] [2020-02-10 20:41:26,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:26,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:26,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715707359] [2020-02-10 20:41:26,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:26,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:26,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:26,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:26,481 INFO L87 Difference]: Start difference. First operand 222 states and 660 transitions. Second operand 8 states. [2020-02-10 20:41:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:26,559 INFO L93 Difference]: Finished difference Result 365 states and 938 transitions. [2020-02-10 20:41:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:26,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:26,560 INFO L225 Difference]: With dead ends: 365 [2020-02-10 20:41:26,560 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 20:41:26,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 20:41:26,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 216. [2020-02-10 20:41:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 644 transitions. [2020-02-10 20:41:26,565 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 644 transitions. Word has length 19 [2020-02-10 20:41:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:26,565 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 644 transitions. [2020-02-10 20:41:26,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 644 transitions. [2020-02-10 20:41:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:26,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:26,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:26,566 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:26,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:26,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2110104008, now seen corresponding path program 209 times [2020-02-10 20:41:26,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:26,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515976400] [2020-02-10 20:41:26,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:26,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515976400] [2020-02-10 20:41:26,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:26,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:26,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789206550] [2020-02-10 20:41:26,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:26,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:26,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:26,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:26,758 INFO L87 Difference]: Start difference. First operand 216 states and 644 transitions. Second operand 8 states. [2020-02-10 20:41:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:26,833 INFO L93 Difference]: Finished difference Result 358 states and 925 transitions. [2020-02-10 20:41:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:26,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:26,835 INFO L225 Difference]: With dead ends: 358 [2020-02-10 20:41:26,835 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 20:41:26,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 20:41:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 220. [2020-02-10 20:41:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 20:41:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 652 transitions. [2020-02-10 20:41:26,840 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 652 transitions. Word has length 19 [2020-02-10 20:41:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:26,841 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 652 transitions. [2020-02-10 20:41:26,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 652 transitions. [2020-02-10 20:41:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:26,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:26,841 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:26,841 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1325988758, now seen corresponding path program 210 times [2020-02-10 20:41:26,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:26,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949760723] [2020-02-10 20:41:26,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:27,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949760723] [2020-02-10 20:41:27,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:27,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:27,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531473174] [2020-02-10 20:41:27,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:27,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:27,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:27,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:27,032 INFO L87 Difference]: Start difference. First operand 220 states and 652 transitions. Second operand 8 states. [2020-02-10 20:41:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:27,113 INFO L93 Difference]: Finished difference Result 359 states and 923 transitions. [2020-02-10 20:41:27,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:27,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:27,115 INFO L225 Difference]: With dead ends: 359 [2020-02-10 20:41:27,115 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 20:41:27,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 20:41:27,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 211. [2020-02-10 20:41:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 20:41:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 632 transitions. [2020-02-10 20:41:27,120 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 632 transitions. Word has length 19 [2020-02-10 20:41:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:27,120 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 632 transitions. [2020-02-10 20:41:27,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 632 transitions. [2020-02-10 20:41:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:27,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:27,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:27,121 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:27,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:27,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1946024220, now seen corresponding path program 211 times [2020-02-10 20:41:27,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:27,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424208329] [2020-02-10 20:41:27,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:27,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424208329] [2020-02-10 20:41:27,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:27,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:27,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579994725] [2020-02-10 20:41:27,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:27,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:27,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:27,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:27,319 INFO L87 Difference]: Start difference. First operand 211 states and 632 transitions. Second operand 8 states. [2020-02-10 20:41:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:27,376 INFO L93 Difference]: Finished difference Result 335 states and 868 transitions. [2020-02-10 20:41:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:27,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:27,377 INFO L225 Difference]: With dead ends: 335 [2020-02-10 20:41:27,378 INFO L226 Difference]: Without dead ends: 325 [2020-02-10 20:41:27,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-02-10 20:41:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 215. [2020-02-10 20:41:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:41:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 642 transitions. [2020-02-10 20:41:27,383 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 642 transitions. Word has length 19 [2020-02-10 20:41:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:27,383 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 642 transitions. [2020-02-10 20:41:27,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 642 transitions. [2020-02-10 20:41:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:27,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:27,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:27,384 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1090717566, now seen corresponding path program 212 times [2020-02-10 20:41:27,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:27,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494337417] [2020-02-10 20:41:27,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:27,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494337417] [2020-02-10 20:41:27,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:27,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:27,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327215503] [2020-02-10 20:41:27,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:27,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:27,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:27,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:27,574 INFO L87 Difference]: Start difference. First operand 215 states and 642 transitions. Second operand 8 states. [2020-02-10 20:41:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:27,659 INFO L93 Difference]: Finished difference Result 337 states and 871 transitions. [2020-02-10 20:41:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:27,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:27,660 INFO L225 Difference]: With dead ends: 337 [2020-02-10 20:41:27,661 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 20:41:27,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 20:41:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 213. [2020-02-10 20:41:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 20:41:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 637 transitions. [2020-02-10 20:41:27,666 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 637 transitions. Word has length 19 [2020-02-10 20:41:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:27,666 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 637 transitions. [2020-02-10 20:41:27,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 637 transitions. [2020-02-10 20:41:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:27,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:27,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:27,667 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:27,667 INFO L82 PathProgramCache]: Analyzing trace with hash -738002118, now seen corresponding path program 213 times [2020-02-10 20:41:27,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:27,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455104916] [2020-02-10 20:41:27,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:27,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455104916] [2020-02-10 20:41:27,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:27,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:27,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534455875] [2020-02-10 20:41:27,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:27,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:27,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:27,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:27,862 INFO L87 Difference]: Start difference. First operand 213 states and 637 transitions. Second operand 8 states. [2020-02-10 20:41:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:27,924 INFO L93 Difference]: Finished difference Result 336 states and 868 transitions. [2020-02-10 20:41:27,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:27,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:27,925 INFO L225 Difference]: With dead ends: 336 [2020-02-10 20:41:27,926 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 20:41:27,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 20:41:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 215. [2020-02-10 20:41:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:41:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 640 transitions. [2020-02-10 20:41:27,932 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 640 transitions. Word has length 19 [2020-02-10 20:41:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:27,932 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 640 transitions. [2020-02-10 20:41:27,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 640 transitions. [2020-02-10 20:41:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:27,933 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:27,933 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:27,933 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:27,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash 751402878, now seen corresponding path program 214 times [2020-02-10 20:41:27,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:27,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876452940] [2020-02-10 20:41:27,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:28,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876452940] [2020-02-10 20:41:28,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:28,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:28,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409088357] [2020-02-10 20:41:28,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:28,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:28,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:28,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:28,147 INFO L87 Difference]: Start difference. First operand 215 states and 640 transitions. Second operand 8 states. [2020-02-10 20:41:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:28,231 INFO L93 Difference]: Finished difference Result 339 states and 873 transitions. [2020-02-10 20:41:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:28,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:28,232 INFO L225 Difference]: With dead ends: 339 [2020-02-10 20:41:28,232 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 20:41:28,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 20:41:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 213. [2020-02-10 20:41:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 20:41:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 635 transitions. [2020-02-10 20:41:28,238 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 635 transitions. Word has length 19 [2020-02-10 20:41:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:28,238 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 635 transitions. [2020-02-10 20:41:28,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 635 transitions. [2020-02-10 20:41:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:28,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:28,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:28,239 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:28,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:28,239 INFO L82 PathProgramCache]: Analyzing trace with hash 17632186, now seen corresponding path program 215 times [2020-02-10 20:41:28,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:28,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389743721] [2020-02-10 20:41:28,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:28,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389743721] [2020-02-10 20:41:28,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:28,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:28,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980326260] [2020-02-10 20:41:28,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:28,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:28,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:28,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:28,427 INFO L87 Difference]: Start difference. First operand 213 states and 635 transitions. Second operand 8 states. [2020-02-10 20:41:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:28,514 INFO L93 Difference]: Finished difference Result 338 states and 871 transitions. [2020-02-10 20:41:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:28,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:28,516 INFO L225 Difference]: With dead ends: 338 [2020-02-10 20:41:28,516 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 20:41:28,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 20:41:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 217. [2020-02-10 20:41:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:41:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 643 transitions. [2020-02-10 20:41:28,522 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 643 transitions. Word has length 19 [2020-02-10 20:41:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:28,522 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 643 transitions. [2020-02-10 20:41:28,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 643 transitions. [2020-02-10 20:41:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:28,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:28,527 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:28,527 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash -738002118, now seen corresponding path program 216 times [2020-02-10 20:41:28,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:28,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323824740] [2020-02-10 20:41:28,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:28,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323824740] [2020-02-10 20:41:28,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:28,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:28,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015690411] [2020-02-10 20:41:28,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:28,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:28,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:28,726 INFO L87 Difference]: Start difference. First operand 217 states and 643 transitions. Second operand 8 states. [2020-02-10 20:41:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:28,808 INFO L93 Difference]: Finished difference Result 339 states and 869 transitions. [2020-02-10 20:41:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:28,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:28,809 INFO L225 Difference]: With dead ends: 339 [2020-02-10 20:41:28,809 INFO L226 Difference]: Without dead ends: 317 [2020-02-10 20:41:28,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-02-10 20:41:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 208. [2020-02-10 20:41:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 20:41:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 625 transitions. [2020-02-10 20:41:28,814 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 625 transitions. Word has length 19 [2020-02-10 20:41:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:28,814 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 625 transitions. [2020-02-10 20:41:28,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 625 transitions. [2020-02-10 20:41:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:28,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:28,814 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:28,814 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:28,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1434799680, now seen corresponding path program 217 times [2020-02-10 20:41:28,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:28,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146802801] [2020-02-10 20:41:28,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:28,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146802801] [2020-02-10 20:41:28,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:28,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:28,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436329795] [2020-02-10 20:41:28,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:28,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:28,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:28,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:28,991 INFO L87 Difference]: Start difference. First operand 208 states and 625 transitions. Second operand 8 states. [2020-02-10 20:41:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:29,066 INFO L93 Difference]: Finished difference Result 338 states and 886 transitions. [2020-02-10 20:41:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:29,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:29,067 INFO L225 Difference]: With dead ends: 338 [2020-02-10 20:41:29,067 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 20:41:29,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 20:41:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 214. [2020-02-10 20:41:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 644 transitions. [2020-02-10 20:41:29,072 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 644 transitions. Word has length 19 [2020-02-10 20:41:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:29,072 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 644 transitions. [2020-02-10 20:41:29,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 644 transitions. [2020-02-10 20:41:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:29,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:29,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:29,073 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:29,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:29,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1740037786, now seen corresponding path program 218 times [2020-02-10 20:41:29,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:29,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810488990] [2020-02-10 20:41:29,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:29,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810488990] [2020-02-10 20:41:29,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:29,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:29,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741731827] [2020-02-10 20:41:29,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:29,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:29,250 INFO L87 Difference]: Start difference. First operand 214 states and 644 transitions. Second operand 8 states. [2020-02-10 20:41:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:29,307 INFO L93 Difference]: Finished difference Result 334 states and 875 transitions. [2020-02-10 20:41:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:29,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:29,308 INFO L225 Difference]: With dead ends: 334 [2020-02-10 20:41:29,309 INFO L226 Difference]: Without dead ends: 322 [2020-02-10 20:41:29,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-02-10 20:41:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2020-02-10 20:41:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:41:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 639 transitions. [2020-02-10 20:41:29,314 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 639 transitions. Word has length 19 [2020-02-10 20:41:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:29,314 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 639 transitions. [2020-02-10 20:41:29,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 639 transitions. [2020-02-10 20:41:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:29,314 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:29,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:29,315 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash 690097182, now seen corresponding path program 219 times [2020-02-10 20:41:29,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:29,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960291388] [2020-02-10 20:41:29,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:29,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960291388] [2020-02-10 20:41:29,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:29,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:29,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194474994] [2020-02-10 20:41:29,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:29,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:29,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:29,485 INFO L87 Difference]: Start difference. First operand 212 states and 639 transitions. Second operand 8 states. [2020-02-10 20:41:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:29,559 INFO L93 Difference]: Finished difference Result 342 states and 896 transitions. [2020-02-10 20:41:29,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:29,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:29,561 INFO L225 Difference]: With dead ends: 342 [2020-02-10 20:41:29,561 INFO L226 Difference]: Without dead ends: 328 [2020-02-10 20:41:29,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-02-10 20:41:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 216. [2020-02-10 20:41:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 647 transitions. [2020-02-10 20:41:29,566 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 647 transitions. Word has length 19 [2020-02-10 20:41:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:29,567 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 647 transitions. [2020-02-10 20:41:29,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 647 transitions. [2020-02-10 20:41:29,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:29,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:29,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:29,567 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:29,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:29,567 INFO L82 PathProgramCache]: Analyzing trace with hash -55199962, now seen corresponding path program 220 times [2020-02-10 20:41:29,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:29,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084902134] [2020-02-10 20:41:29,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:29,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084902134] [2020-02-10 20:41:29,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:29,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:29,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132712251] [2020-02-10 20:41:29,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:29,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:29,737 INFO L87 Difference]: Start difference. First operand 216 states and 647 transitions. Second operand 8 states. [2020-02-10 20:41:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:29,814 INFO L93 Difference]: Finished difference Result 340 states and 888 transitions. [2020-02-10 20:41:29,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:29,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:29,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:29,816 INFO L225 Difference]: With dead ends: 340 [2020-02-10 20:41:29,816 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 20:41:29,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 20:41:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2020-02-10 20:41:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:41:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-02-10 20:41:29,821 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-02-10 20:41:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:29,821 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-02-10 20:41:29,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-02-10 20:41:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:29,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:29,822 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:29,822 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:29,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2019699708, now seen corresponding path program 221 times [2020-02-10 20:41:29,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:29,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994616889] [2020-02-10 20:41:29,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:30,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994616889] [2020-02-10 20:41:30,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:30,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:30,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298447681] [2020-02-10 20:41:30,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:30,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:30,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:30,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:30,004 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-02-10 20:41:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:30,063 INFO L93 Difference]: Finished difference Result 332 states and 869 transitions. [2020-02-10 20:41:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:30,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:30,064 INFO L225 Difference]: With dead ends: 332 [2020-02-10 20:41:30,064 INFO L226 Difference]: Without dead ends: 322 [2020-02-10 20:41:30,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-02-10 20:41:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 214. [2020-02-10 20:41:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2020-02-10 20:41:30,070 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 19 [2020-02-10 20:41:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:30,070 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2020-02-10 20:41:30,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2020-02-10 20:41:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:30,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:30,070 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:30,070 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:30,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1164393054, now seen corresponding path program 222 times [2020-02-10 20:41:30,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:30,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778644318] [2020-02-10 20:41:30,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:30,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778644318] [2020-02-10 20:41:30,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:30,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:30,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946253261] [2020-02-10 20:41:30,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:30,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:30,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:30,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:30,249 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand 8 states. [2020-02-10 20:41:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:30,324 INFO L93 Difference]: Finished difference Result 334 states and 872 transitions. [2020-02-10 20:41:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:30,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:30,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:30,326 INFO L225 Difference]: With dead ends: 334 [2020-02-10 20:41:30,326 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 20:41:30,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 20:41:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 210. [2020-02-10 20:41:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 20:41:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 632 transitions. [2020-02-10 20:41:30,331 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 632 transitions. Word has length 19 [2020-02-10 20:41:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:30,331 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 632 transitions. [2020-02-10 20:41:30,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 632 transitions. [2020-02-10 20:41:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:30,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:30,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:30,332 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash -165638174, now seen corresponding path program 223 times [2020-02-10 20:41:30,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:30,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023566203] [2020-02-10 20:41:30,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:30,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023566203] [2020-02-10 20:41:30,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:30,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:30,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29572107] [2020-02-10 20:41:30,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:30,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:30,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:30,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:30,512 INFO L87 Difference]: Start difference. First operand 210 states and 632 transitions. Second operand 8 states. [2020-02-10 20:41:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:30,586 INFO L93 Difference]: Finished difference Result 340 states and 889 transitions. [2020-02-10 20:41:30,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:30,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:30,588 INFO L225 Difference]: With dead ends: 340 [2020-02-10 20:41:30,588 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 20:41:30,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 20:41:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 214. [2020-02-10 20:41:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 20:41:30,593 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 20:41:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:30,593 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 20:41:30,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 20:41:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:30,594 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:30,594 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:30,594 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:30,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:30,594 INFO L82 PathProgramCache]: Analyzing trace with hash 954491656, now seen corresponding path program 224 times [2020-02-10 20:41:30,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:30,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008223621] [2020-02-10 20:41:30,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:30,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008223621] [2020-02-10 20:41:30,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:30,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:30,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684979057] [2020-02-10 20:41:30,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:30,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:30,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:30,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:30,776 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 20:41:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:30,839 INFO L93 Difference]: Finished difference Result 336 states and 878 transitions. [2020-02-10 20:41:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:30,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:30,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:30,841 INFO L225 Difference]: With dead ends: 336 [2020-02-10 20:41:30,841 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 20:41:30,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 20:41:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2020-02-10 20:41:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:41:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-02-10 20:41:30,846 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-02-10 20:41:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:30,847 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-02-10 20:41:30,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-02-10 20:41:30,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:30,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:30,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:30,847 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:30,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:30,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1238723554, now seen corresponding path program 225 times [2020-02-10 20:41:30,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:30,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235264989] [2020-02-10 20:41:30,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:31,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235264989] [2020-02-10 20:41:31,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:31,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:31,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325101260] [2020-02-10 20:41:31,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:31,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:31,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:31,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:31,032 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-02-10 20:41:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:31,111 INFO L93 Difference]: Finished difference Result 346 states and 904 transitions. [2020-02-10 20:41:31,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:31,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:31,112 INFO L225 Difference]: With dead ends: 346 [2020-02-10 20:41:31,112 INFO L226 Difference]: Without dead ends: 332 [2020-02-10 20:41:31,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-02-10 20:41:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 217. [2020-02-10 20:41:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:41:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 647 transitions. [2020-02-10 20:41:31,119 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 647 transitions. Word has length 19 [2020-02-10 20:41:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:31,119 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 647 transitions. [2020-02-10 20:41:31,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 647 transitions. [2020-02-10 20:41:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:31,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:31,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:31,119 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:31,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1880780472, now seen corresponding path program 226 times [2020-02-10 20:41:31,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:31,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775286479] [2020-02-10 20:41:31,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:31,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775286479] [2020-02-10 20:41:31,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:31,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:31,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165680149] [2020-02-10 20:41:31,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:31,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:31,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:31,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:31,307 INFO L87 Difference]: Start difference. First operand 217 states and 647 transitions. Second operand 8 states. [2020-02-10 20:41:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:31,390 INFO L93 Difference]: Finished difference Result 345 states and 897 transitions. [2020-02-10 20:41:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:31,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:31,392 INFO L225 Difference]: With dead ends: 345 [2020-02-10 20:41:31,392 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 20:41:31,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:31,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 20:41:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 212. [2020-02-10 20:41:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:41:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 635 transitions. [2020-02-10 20:41:31,397 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 635 transitions. Word has length 19 [2020-02-10 20:41:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:31,397 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 635 transitions. [2020-02-10 20:41:31,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 635 transitions. [2020-02-10 20:41:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:31,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:31,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:31,398 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:31,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:31,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2030202812, now seen corresponding path program 227 times [2020-02-10 20:41:31,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:31,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776164877] [2020-02-10 20:41:31,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:31,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776164877] [2020-02-10 20:41:31,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:31,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:31,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657758782] [2020-02-10 20:41:31,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:31,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:31,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:31,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:31,585 INFO L87 Difference]: Start difference. First operand 212 states and 635 transitions. Second operand 8 states. [2020-02-10 20:41:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:31,639 INFO L93 Difference]: Finished difference Result 335 states and 874 transitions. [2020-02-10 20:41:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:31,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:31,641 INFO L225 Difference]: With dead ends: 335 [2020-02-10 20:41:31,641 INFO L226 Difference]: Without dead ends: 325 [2020-02-10 20:41:31,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-02-10 20:41:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 214. [2020-02-10 20:41:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-02-10 20:41:31,647 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-02-10 20:41:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:31,647 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-02-10 20:41:31,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-02-10 20:41:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:31,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:31,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:31,648 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:31,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash -775359488, now seen corresponding path program 228 times [2020-02-10 20:41:31,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:31,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575055392] [2020-02-10 20:41:31,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:31,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575055392] [2020-02-10 20:41:31,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:31,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:31,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082691745] [2020-02-10 20:41:31,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:31,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:31,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:31,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:31,829 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-02-10 20:41:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:31,911 INFO L93 Difference]: Finished difference Result 338 states and 879 transitions. [2020-02-10 20:41:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:31,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:31,912 INFO L225 Difference]: With dead ends: 338 [2020-02-10 20:41:31,912 INFO L226 Difference]: Without dead ends: 321 [2020-02-10 20:41:31,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-02-10 20:41:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 210. [2020-02-10 20:41:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 20:41:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 630 transitions. [2020-02-10 20:41:31,918 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 630 transitions. Word has length 19 [2020-02-10 20:41:31,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:31,918 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 630 transitions. [2020-02-10 20:41:31,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 630 transitions. [2020-02-10 20:41:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:31,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:31,919 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:31,919 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:31,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:31,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1784188770, now seen corresponding path program 229 times [2020-02-10 20:41:31,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:31,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615558089] [2020-02-10 20:41:31,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:32,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615558089] [2020-02-10 20:41:32,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:32,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:32,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907159620] [2020-02-10 20:41:32,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:32,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:32,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:32,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:32,108 INFO L87 Difference]: Start difference. First operand 210 states and 630 transitions. Second operand 8 states. [2020-02-10 20:41:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:32,187 INFO L93 Difference]: Finished difference Result 348 states and 911 transitions. [2020-02-10 20:41:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:32,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:32,188 INFO L225 Difference]: With dead ends: 348 [2020-02-10 20:41:32,189 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 20:41:32,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 20:41:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 218. [2020-02-10 20:41:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:41:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-02-10 20:41:32,194 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-02-10 20:41:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:32,195 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-02-10 20:41:32,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-02-10 20:41:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:32,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:32,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:32,195 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1038891626, now seen corresponding path program 230 times [2020-02-10 20:41:32,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:32,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103646563] [2020-02-10 20:41:32,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:32,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103646563] [2020-02-10 20:41:32,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:32,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:32,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416334641] [2020-02-10 20:41:32,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:32,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:32,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:32,382 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-02-10 20:41:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:32,456 INFO L93 Difference]: Finished difference Result 346 states and 903 transitions. [2020-02-10 20:41:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:32,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:32,457 INFO L225 Difference]: With dead ends: 346 [2020-02-10 20:41:32,457 INFO L226 Difference]: Without dead ends: 330 [2020-02-10 20:41:32,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-02-10 20:41:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 214. [2020-02-10 20:41:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 20:41:32,462 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 20:41:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:32,462 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 20:41:32,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 20:41:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:32,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:32,463 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:32,463 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:32,463 INFO L82 PathProgramCache]: Analyzing trace with hash -165638174, now seen corresponding path program 231 times [2020-02-10 20:41:32,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:32,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975384101] [2020-02-10 20:41:32,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:32,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975384101] [2020-02-10 20:41:32,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:32,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:32,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142165800] [2020-02-10 20:41:32,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:32,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:32,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:32,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:32,657 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 20:41:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:32,730 INFO L93 Difference]: Finished difference Result 350 states and 912 transitions. [2020-02-10 20:41:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:32,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:32,732 INFO L225 Difference]: With dead ends: 350 [2020-02-10 20:41:32,732 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 20:41:32,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 20:41:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 219. [2020-02-10 20:41:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 20:41:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 652 transitions. [2020-02-10 20:41:32,737 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 652 transitions. Word has length 19 [2020-02-10 20:41:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:32,738 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 652 transitions. [2020-02-10 20:41:32,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 652 transitions. [2020-02-10 20:41:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:32,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:32,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:32,738 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:32,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash 803245866, now seen corresponding path program 232 times [2020-02-10 20:41:32,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:32,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206642916] [2020-02-10 20:41:32,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:32,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206642916] [2020-02-10 20:41:32,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:32,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:32,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852695907] [2020-02-10 20:41:32,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:32,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:32,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:32,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:32,931 INFO L87 Difference]: Start difference. First operand 219 states and 652 transitions. Second operand 8 states. [2020-02-10 20:41:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:33,012 INFO L93 Difference]: Finished difference Result 349 states and 905 transitions. [2020-02-10 20:41:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:33,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:33,013 INFO L225 Difference]: With dead ends: 349 [2020-02-10 20:41:33,013 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 20:41:33,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 20:41:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 214. [2020-02-10 20:41:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-02-10 20:41:33,018 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-02-10 20:41:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:33,018 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-02-10 20:41:33,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-02-10 20:41:33,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:33,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:33,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:33,019 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:33,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:33,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1685003648, now seen corresponding path program 233 times [2020-02-10 20:41:33,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:33,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600561407] [2020-02-10 20:41:33,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:33,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600561407] [2020-02-10 20:41:33,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:33,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:33,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601174015] [2020-02-10 20:41:33,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:33,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:33,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:33,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:33,211 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-02-10 20:41:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:33,285 INFO L93 Difference]: Finished difference Result 345 states and 897 transitions. [2020-02-10 20:41:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:33,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:33,286 INFO L225 Difference]: With dead ends: 345 [2020-02-10 20:41:33,286 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 20:41:33,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 20:41:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2020-02-10 20:41:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:41:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 646 transitions. [2020-02-10 20:41:33,291 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 646 transitions. Word has length 19 [2020-02-10 20:41:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:33,291 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 646 transitions. [2020-02-10 20:41:33,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 646 transitions. [2020-02-10 20:41:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:33,292 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:33,292 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:33,292 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash -826129118, now seen corresponding path program 234 times [2020-02-10 20:41:33,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:33,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934566761] [2020-02-10 20:41:33,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:33,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934566761] [2020-02-10 20:41:33,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:33,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:33,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176529223] [2020-02-10 20:41:33,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:33,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:33,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:33,484 INFO L87 Difference]: Start difference. First operand 218 states and 646 transitions. Second operand 8 states. [2020-02-10 20:41:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:33,562 INFO L93 Difference]: Finished difference Result 346 states and 895 transitions. [2020-02-10 20:41:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:33,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:33,564 INFO L225 Difference]: With dead ends: 346 [2020-02-10 20:41:33,564 INFO L226 Difference]: Without dead ends: 325 [2020-02-10 20:41:33,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-02-10 20:41:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2020-02-10 20:41:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 20:41:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 628 transitions. [2020-02-10 20:41:33,569 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 628 transitions. Word has length 19 [2020-02-10 20:41:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:33,569 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 628 transitions. [2020-02-10 20:41:33,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 628 transitions. [2020-02-10 20:41:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:33,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:33,570 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:33,570 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:33,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:33,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1007007176, now seen corresponding path program 235 times [2020-02-10 20:41:33,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:33,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769508911] [2020-02-10 20:41:33,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:33,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769508911] [2020-02-10 20:41:33,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:33,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:33,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984136466] [2020-02-10 20:41:33,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:33,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:33,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:33,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:33,775 INFO L87 Difference]: Start difference. First operand 210 states and 628 transitions. Second operand 8 states. [2020-02-10 20:41:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:33,829 INFO L93 Difference]: Finished difference Result 327 states and 849 transitions. [2020-02-10 20:41:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:33,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:33,830 INFO L225 Difference]: With dead ends: 327 [2020-02-10 20:41:33,831 INFO L226 Difference]: Without dead ends: 317 [2020-02-10 20:41:33,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:33,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-02-10 20:41:33,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 214. [2020-02-10 20:41:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-02-10 20:41:33,836 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-02-10 20:41:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:33,836 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-02-10 20:41:33,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-02-10 20:41:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:33,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:33,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:33,837 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:33,837 INFO L82 PathProgramCache]: Analyzing trace with hash 151700522, now seen corresponding path program 236 times [2020-02-10 20:41:33,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:33,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981403466] [2020-02-10 20:41:33,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:34,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981403466] [2020-02-10 20:41:34,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:34,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:34,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25750194] [2020-02-10 20:41:34,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:34,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:34,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:34,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:34,029 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-02-10 20:41:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:34,109 INFO L93 Difference]: Finished difference Result 329 states and 852 transitions. [2020-02-10 20:41:34,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:34,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:34,110 INFO L225 Difference]: With dead ends: 329 [2020-02-10 20:41:34,110 INFO L226 Difference]: Without dead ends: 315 [2020-02-10 20:41:34,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-02-10 20:41:34,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 212. [2020-02-10 20:41:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:41:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 633 transitions. [2020-02-10 20:41:34,116 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 633 transitions. Word has length 19 [2020-02-10 20:41:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:34,116 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 633 transitions. [2020-02-10 20:41:34,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 633 transitions. [2020-02-10 20:41:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:34,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:34,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:34,117 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:34,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:34,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1677019162, now seen corresponding path program 237 times [2020-02-10 20:41:34,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:34,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218767324] [2020-02-10 20:41:34,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:34,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218767324] [2020-02-10 20:41:34,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:34,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:34,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970882862] [2020-02-10 20:41:34,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:34,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:34,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:34,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:34,305 INFO L87 Difference]: Start difference. First operand 212 states and 633 transitions. Second operand 8 states. [2020-02-10 20:41:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:34,360 INFO L93 Difference]: Finished difference Result 328 states and 849 transitions. [2020-02-10 20:41:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:34,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:34,362 INFO L225 Difference]: With dead ends: 328 [2020-02-10 20:41:34,362 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 20:41:34,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 20:41:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 214. [2020-02-10 20:41:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 636 transitions. [2020-02-10 20:41:34,367 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 636 transitions. Word has length 19 [2020-02-10 20:41:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:34,367 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 636 transitions. [2020-02-10 20:41:34,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 636 transitions. [2020-02-10 20:41:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:34,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:34,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:34,368 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:34,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:34,368 INFO L82 PathProgramCache]: Analyzing trace with hash -187614166, now seen corresponding path program 238 times [2020-02-10 20:41:34,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:34,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720476610] [2020-02-10 20:41:34,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:34,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720476610] [2020-02-10 20:41:34,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:34,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:34,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005920039] [2020-02-10 20:41:34,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:34,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:34,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:34,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:34,559 INFO L87 Difference]: Start difference. First operand 214 states and 636 transitions. Second operand 8 states. [2020-02-10 20:41:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:34,640 INFO L93 Difference]: Finished difference Result 331 states and 854 transitions. [2020-02-10 20:41:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:34,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:34,641 INFO L225 Difference]: With dead ends: 331 [2020-02-10 20:41:34,641 INFO L226 Difference]: Without dead ends: 316 [2020-02-10 20:41:34,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-02-10 20:41:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 212. [2020-02-10 20:41:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:41:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 631 transitions. [2020-02-10 20:41:34,646 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 631 transitions. Word has length 19 [2020-02-10 20:41:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:34,646 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 631 transitions. [2020-02-10 20:41:34,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 631 transitions. [2020-02-10 20:41:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:34,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:34,647 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:34,647 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:34,648 INFO L82 PathProgramCache]: Analyzing trace with hash -921384858, now seen corresponding path program 239 times [2020-02-10 20:41:34,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:34,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142256737] [2020-02-10 20:41:34,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:34,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142256737] [2020-02-10 20:41:34,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:34,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:34,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871237071] [2020-02-10 20:41:34,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:34,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:34,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:34,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:34,836 INFO L87 Difference]: Start difference. First operand 212 states and 631 transitions. Second operand 8 states. [2020-02-10 20:41:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:34,908 INFO L93 Difference]: Finished difference Result 330 states and 852 transitions. [2020-02-10 20:41:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:34,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:34,910 INFO L225 Difference]: With dead ends: 330 [2020-02-10 20:41:34,910 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 20:41:34,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 20:41:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 216. [2020-02-10 20:41:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 639 transitions. [2020-02-10 20:41:34,914 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 639 transitions. Word has length 19 [2020-02-10 20:41:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:34,914 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 639 transitions. [2020-02-10 20:41:34,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 639 transitions. [2020-02-10 20:41:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:34,915 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:34,915 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:34,915 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1677019162, now seen corresponding path program 240 times [2020-02-10 20:41:34,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:34,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711437632] [2020-02-10 20:41:34,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:35,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711437632] [2020-02-10 20:41:35,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:35,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:35,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098785871] [2020-02-10 20:41:35,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:35,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:35,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:35,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:35,108 INFO L87 Difference]: Start difference. First operand 216 states and 639 transitions. Second operand 8 states. [2020-02-10 20:41:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:35,187 INFO L93 Difference]: Finished difference Result 331 states and 850 transitions. [2020-02-10 20:41:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:35,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:35,188 INFO L225 Difference]: With dead ends: 331 [2020-02-10 20:41:35,188 INFO L226 Difference]: Without dead ends: 304 [2020-02-10 20:41:35,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-02-10 20:41:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 202. [2020-02-10 20:41:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 20:41:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 613 transitions. [2020-02-10 20:41:35,194 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 613 transitions. Word has length 19 [2020-02-10 20:41:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:35,194 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 613 transitions. [2020-02-10 20:41:35,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 613 transitions. [2020-02-10 20:41:35,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:35,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:35,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:35,195 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:35,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1614896374, now seen corresponding path program 241 times [2020-02-10 20:41:35,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:35,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119991806] [2020-02-10 20:41:35,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:35,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119991806] [2020-02-10 20:41:35,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:35,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:35,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231911114] [2020-02-10 20:41:35,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:35,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:35,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:35,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:35,403 INFO L87 Difference]: Start difference. First operand 202 states and 613 transitions. Second operand 8 states. [2020-02-10 20:41:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:35,459 INFO L93 Difference]: Finished difference Result 378 states and 975 transitions. [2020-02-10 20:41:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:35,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:35,461 INFO L225 Difference]: With dead ends: 378 [2020-02-10 20:41:35,461 INFO L226 Difference]: Without dead ends: 362 [2020-02-10 20:41:35,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-02-10 20:41:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 218. [2020-02-10 20:41:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:41:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2020-02-10 20:41:35,465 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2020-02-10 20:41:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:35,465 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2020-02-10 20:41:35,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2020-02-10 20:41:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:35,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:35,466 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:35,466 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:35,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1989547560, now seen corresponding path program 242 times [2020-02-10 20:41:35,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:35,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548694494] [2020-02-10 20:41:35,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:35,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548694494] [2020-02-10 20:41:35,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:35,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:35,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294736704] [2020-02-10 20:41:35,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:35,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:35,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:35,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:35,692 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand 8 states. [2020-02-10 20:41:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:35,767 INFO L93 Difference]: Finished difference Result 376 states and 965 transitions. [2020-02-10 20:41:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:35,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:35,768 INFO L225 Difference]: With dead ends: 376 [2020-02-10 20:41:35,768 INFO L226 Difference]: Without dead ends: 354 [2020-02-10 20:41:35,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-02-10 20:41:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 210. [2020-02-10 20:41:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 20:41:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 632 transitions. [2020-02-10 20:41:35,773 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 632 transitions. Word has length 19 [2020-02-10 20:41:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:35,773 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 632 transitions. [2020-02-10 20:41:35,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 632 transitions. [2020-02-10 20:41:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:35,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:35,774 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:35,774 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1498681168, now seen corresponding path program 243 times [2020-02-10 20:41:35,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:35,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754103148] [2020-02-10 20:41:35,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:35,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754103148] [2020-02-10 20:41:35,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:35,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:35,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588365423] [2020-02-10 20:41:35,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:35,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:35,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:35,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:35,974 INFO L87 Difference]: Start difference. First operand 210 states and 632 transitions. Second operand 8 states. [2020-02-10 20:41:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:36,044 INFO L93 Difference]: Finished difference Result 375 states and 962 transitions. [2020-02-10 20:41:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:36,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:36,046 INFO L225 Difference]: With dead ends: 375 [2020-02-10 20:41:36,046 INFO L226 Difference]: Without dead ends: 359 [2020-02-10 20:41:36,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-02-10 20:41:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 216. [2020-02-10 20:41:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:41:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 643 transitions. [2020-02-10 20:41:36,051 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 643 transitions. Word has length 19 [2020-02-10 20:41:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:36,051 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 643 transitions. [2020-02-10 20:41:36,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 643 transitions. [2020-02-10 20:41:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:36,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:36,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:36,051 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:36,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1820081378, now seen corresponding path program 244 times [2020-02-10 20:41:36,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:36,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862296411] [2020-02-10 20:41:36,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:36,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862296411] [2020-02-10 20:41:36,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:36,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:36,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365729019] [2020-02-10 20:41:36,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:36,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:36,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:36,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:36,246 INFO L87 Difference]: Start difference. First operand 216 states and 643 transitions. Second operand 8 states. [2020-02-10 20:41:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:36,321 INFO L93 Difference]: Finished difference Result 372 states and 951 transitions. [2020-02-10 20:41:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:36,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:36,322 INFO L225 Difference]: With dead ends: 372 [2020-02-10 20:41:36,323 INFO L226 Difference]: Without dead ends: 353 [2020-02-10 20:41:36,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-02-10 20:41:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 210. [2020-02-10 20:41:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 20:41:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 626 transitions. [2020-02-10 20:41:36,328 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 626 transitions. Word has length 19 [2020-02-10 20:41:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:36,328 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 626 transitions. [2020-02-10 20:41:36,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 626 transitions. [2020-02-10 20:41:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:36,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:36,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:36,329 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:36,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:36,329 INFO L82 PathProgramCache]: Analyzing trace with hash -308913628, now seen corresponding path program 245 times [2020-02-10 20:41:36,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:36,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237201144] [2020-02-10 20:41:36,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:36,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237201144] [2020-02-10 20:41:36,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:36,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:36,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48590799] [2020-02-10 20:41:36,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:36,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:36,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:36,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:36,554 INFO L87 Difference]: Start difference. First operand 210 states and 626 transitions. Second operand 8 states. [2020-02-10 20:41:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:36,627 INFO L93 Difference]: Finished difference Result 370 states and 948 transitions. [2020-02-10 20:41:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:36,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:36,628 INFO L225 Difference]: With dead ends: 370 [2020-02-10 20:41:36,628 INFO L226 Difference]: Without dead ends: 356 [2020-02-10 20:41:36,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-02-10 20:41:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 215. [2020-02-10 20:41:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:41:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 636 transitions. [2020-02-10 20:41:36,634 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 636 transitions. Word has length 19 [2020-02-10 20:41:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:36,634 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 636 transitions. [2020-02-10 20:41:36,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 636 transitions. [2020-02-10 20:41:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:36,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:36,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:36,635 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:36,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:36,635 INFO L82 PathProgramCache]: Analyzing trace with hash 549366256, now seen corresponding path program 246 times [2020-02-10 20:41:36,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:36,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927262191] [2020-02-10 20:41:36,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:36,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927262191] [2020-02-10 20:41:36,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:36,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:36,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925977493] [2020-02-10 20:41:36,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:36,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:36,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:36,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:36,828 INFO L87 Difference]: Start difference. First operand 215 states and 636 transitions. Second operand 8 states. [2020-02-10 20:41:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:36,902 INFO L93 Difference]: Finished difference Result 369 states and 941 transitions. [2020-02-10 20:41:36,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:36,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:36,904 INFO L225 Difference]: With dead ends: 369 [2020-02-10 20:41:36,904 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 20:41:36,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 20:41:36,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 202. [2020-02-10 20:41:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 20:41:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 608 transitions. [2020-02-10 20:41:36,909 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 608 transitions. Word has length 19 [2020-02-10 20:41:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:36,909 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 608 transitions. [2020-02-10 20:41:36,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 608 transitions. [2020-02-10 20:41:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:36,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:36,910 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:36,910 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:36,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash -667701144, now seen corresponding path program 247 times [2020-02-10 20:41:36,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:36,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421986207] [2020-02-10 20:41:36,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:37,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421986207] [2020-02-10 20:41:37,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:37,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:37,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23591107] [2020-02-10 20:41:37,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:37,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:37,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:37,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:37,108 INFO L87 Difference]: Start difference. First operand 202 states and 608 transitions. Second operand 8 states. [2020-02-10 20:41:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:37,167 INFO L93 Difference]: Finished difference Result 365 states and 929 transitions. [2020-02-10 20:41:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:37,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:37,168 INFO L225 Difference]: With dead ends: 365 [2020-02-10 20:41:37,168 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 20:41:37,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 20:41:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 214. [2020-02-10 20:41:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:41:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 634 transitions. [2020-02-10 20:41:37,174 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 634 transitions. Word has length 19 [2020-02-10 20:41:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:37,174 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 634 transitions. [2020-02-10 20:41:37,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 634 transitions. [2020-02-10 20:41:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:37,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:37,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:37,174 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash -293049958, now seen corresponding path program 248 times [2020-02-10 20:41:37,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:37,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333022321] [2020-02-10 20:41:37,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:37,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333022321] [2020-02-10 20:41:37,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:37,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:37,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185396247] [2020-02-10 20:41:37,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:37,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:37,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:37,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:37,371 INFO L87 Difference]: Start difference. First operand 214 states and 634 transitions. Second operand 8 states. [2020-02-10 20:41:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:37,451 INFO L93 Difference]: Finished difference Result 363 states and 919 transitions. [2020-02-10 20:41:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:37,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:37,452 INFO L225 Difference]: With dead ends: 363 [2020-02-10 20:41:37,452 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 20:41:37,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 20:41:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 206. [2020-02-10 20:41:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 20:41:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 616 transitions. [2020-02-10 20:41:37,457 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 616 transitions. Word has length 19 [2020-02-10 20:41:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:37,457 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 616 transitions. [2020-02-10 20:41:37,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 616 transitions. [2020-02-10 20:41:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:37,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:37,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:37,458 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:37,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash -463100062, now seen corresponding path program 249 times [2020-02-10 20:41:37,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:37,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689829801] [2020-02-10 20:41:37,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:37,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689829801] [2020-02-10 20:41:37,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:37,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:37,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102308327] [2020-02-10 20:41:37,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:37,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:37,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:37,640 INFO L87 Difference]: Start difference. First operand 206 states and 616 transitions. Second operand 8 states. [2020-02-10 20:41:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:37,699 INFO L93 Difference]: Finished difference Result 356 states and 902 transitions. [2020-02-10 20:41:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:37,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:37,700 INFO L225 Difference]: With dead ends: 356 [2020-02-10 20:41:37,700 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:41:37,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:41:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 209. [2020-02-10 20:41:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-02-10 20:41:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 620 transitions. [2020-02-10 20:41:37,705 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 620 transitions. Word has length 19 [2020-02-10 20:41:37,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:37,705 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 620 transitions. [2020-02-10 20:41:37,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 620 transitions. [2020-02-10 20:41:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:37,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:37,705 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:37,705 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:37,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1680140688, now seen corresponding path program 250 times [2020-02-10 20:41:37,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:37,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898059089] [2020-02-10 20:41:37,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:37,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898059089] [2020-02-10 20:41:37,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:37,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:37,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052296602] [2020-02-10 20:41:37,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:37,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:37,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:37,890 INFO L87 Difference]: Start difference. First operand 209 states and 620 transitions. Second operand 8 states. [2020-02-10 20:41:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:37,970 INFO L93 Difference]: Finished difference Result 350 states and 887 transitions. [2020-02-10 20:41:37,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:37,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:37,972 INFO L225 Difference]: With dead ends: 350 [2020-02-10 20:41:37,972 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 20:41:37,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 20:41:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 206. [2020-02-10 20:41:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 20:41:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 613 transitions. [2020-02-10 20:41:37,978 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 613 transitions. Word has length 19 [2020-02-10 20:41:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:37,978 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 613 transitions. [2020-02-10 20:41:37,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 613 transitions. [2020-02-10 20:41:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:37,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:37,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:37,979 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:37,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:37,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1861116096, now seen corresponding path program 251 times [2020-02-10 20:41:37,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:37,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870589132] [2020-02-10 20:41:37,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:38,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870589132] [2020-02-10 20:41:38,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:38,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:38,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567276145] [2020-02-10 20:41:38,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:38,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:38,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:38,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:38,157 INFO L87 Difference]: Start difference. First operand 206 states and 613 transitions. Second operand 8 states. [2020-02-10 20:41:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:38,231 INFO L93 Difference]: Finished difference Result 351 states and 891 transitions. [2020-02-10 20:41:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:38,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:38,232 INFO L225 Difference]: With dead ends: 351 [2020-02-10 20:41:38,233 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 20:41:38,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 20:41:38,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 208. [2020-02-10 20:41:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 20:41:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 616 transitions. [2020-02-10 20:41:38,238 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 616 transitions. Word has length 19 [2020-02-10 20:41:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:38,238 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 616 transitions. [2020-02-10 20:41:38,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 616 transitions. [2020-02-10 20:41:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:38,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:38,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:38,239 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:38,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1559515874, now seen corresponding path program 252 times [2020-02-10 20:41:38,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:38,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131801038] [2020-02-10 20:41:38,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:38,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131801038] [2020-02-10 20:41:38,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:38,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:38,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316076212] [2020-02-10 20:41:38,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:38,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:38,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:38,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:38,422 INFO L87 Difference]: Start difference. First operand 208 states and 616 transitions. Second operand 8 states. [2020-02-10 20:41:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:38,500 INFO L93 Difference]: Finished difference Result 347 states and 880 transitions. [2020-02-10 20:41:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:38,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:38,503 INFO L225 Difference]: With dead ends: 347 [2020-02-10 20:41:38,504 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 20:41:38,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 20:41:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 202. [2020-02-10 20:41:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 20:41:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 604 transitions. [2020-02-10 20:41:38,509 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 604 transitions. Word has length 19 [2020-02-10 20:41:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:38,509 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 604 transitions. [2020-02-10 20:41:38,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 604 transitions. [2020-02-10 20:41:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:38,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:38,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:38,510 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:38,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1800243944, now seen corresponding path program 253 times [2020-02-10 20:41:38,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:38,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854906804] [2020-02-10 20:41:38,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:38,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854906804] [2020-02-10 20:41:38,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:38,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:38,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157675617] [2020-02-10 20:41:38,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:38,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:38,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:38,686 INFO L87 Difference]: Start difference. First operand 202 states and 604 transitions. Second operand 8 states. [2020-02-10 20:41:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:38,742 INFO L93 Difference]: Finished difference Result 352 states and 894 transitions. [2020-02-10 20:41:38,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:38,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:38,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:38,743 INFO L225 Difference]: With dead ends: 352 [2020-02-10 20:41:38,743 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 20:41:38,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 20:41:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 208. [2020-02-10 20:41:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 20:41:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 618 transitions. [2020-02-10 20:41:38,749 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 618 transitions. Word has length 19 [2020-02-10 20:41:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:38,749 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 618 transitions. [2020-02-10 20:41:38,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 618 transitions. [2020-02-10 20:41:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:38,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:38,750 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:38,750 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:38,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:38,751 INFO L82 PathProgramCache]: Analyzing trace with hash -351482602, now seen corresponding path program 254 times [2020-02-10 20:41:38,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:38,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868963100] [2020-02-10 20:41:38,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:38,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868963100] [2020-02-10 20:41:38,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:38,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:38,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442292625] [2020-02-10 20:41:38,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:38,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:38,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:38,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:38,941 INFO L87 Difference]: Start difference. First operand 208 states and 618 transitions. Second operand 8 states. [2020-02-10 20:41:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:39,022 INFO L93 Difference]: Finished difference Result 346 states and 879 transitions. [2020-02-10 20:41:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:39,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:39,023 INFO L225 Difference]: With dead ends: 346 [2020-02-10 20:41:39,023 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 20:41:39,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 20:41:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 205. [2020-02-10 20:41:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-02-10 20:41:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 611 transitions. [2020-02-10 20:41:39,028 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 611 transitions. Word has length 19 [2020-02-10 20:41:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:39,028 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 611 transitions. [2020-02-10 20:41:39,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 611 transitions. [2020-02-10 20:41:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:39,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:39,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:39,029 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1293897678, now seen corresponding path program 255 times [2020-02-10 20:41:39,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:39,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297152514] [2020-02-10 20:41:39,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:39,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297152514] [2020-02-10 20:41:39,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:39,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:39,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683288076] [2020-02-10 20:41:39,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:39,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:39,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:39,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:39,220 INFO L87 Difference]: Start difference. First operand 205 states and 611 transitions. Second operand 8 states. [2020-02-10 20:41:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:39,278 INFO L93 Difference]: Finished difference Result 358 states and 908 transitions. [2020-02-10 20:41:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:39,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:39,280 INFO L225 Difference]: With dead ends: 358 [2020-02-10 20:41:39,280 INFO L226 Difference]: Without dead ends: 342 [2020-02-10 20:41:39,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-02-10 20:41:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 211. [2020-02-10 20:41:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 20:41:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 622 transitions. [2020-02-10 20:41:39,285 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 622 transitions. Word has length 19 [2020-02-10 20:41:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:39,285 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 622 transitions. [2020-02-10 20:41:39,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 622 transitions. [2020-02-10 20:41:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:39,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:39,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:39,286 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash 317692928, now seen corresponding path program 256 times [2020-02-10 20:41:39,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:39,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097973084] [2020-02-10 20:41:39,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:39,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097973084] [2020-02-10 20:41:39,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:39,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:39,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673886834] [2020-02-10 20:41:39,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:39,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:39,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:39,465 INFO L87 Difference]: Start difference. First operand 211 states and 622 transitions. Second operand 8 states. [2020-02-10 20:41:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:39,541 INFO L93 Difference]: Finished difference Result 355 states and 897 transitions. [2020-02-10 20:41:39,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:39,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:39,542 INFO L225 Difference]: With dead ends: 355 [2020-02-10 20:41:39,542 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 20:41:39,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 20:41:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 205. [2020-02-10 20:41:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-02-10 20:41:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 608 transitions. [2020-02-10 20:41:39,547 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 608 transitions. Word has length 19 [2020-02-10 20:41:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:39,547 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 608 transitions. [2020-02-10 20:41:39,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 608 transitions. [2020-02-10 20:41:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:39,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:39,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:39,548 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash -235841100, now seen corresponding path program 257 times [2020-02-10 20:41:39,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:39,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575725943] [2020-02-10 20:41:39,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:39,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575725943] [2020-02-10 20:41:39,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:39,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:39,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807793584] [2020-02-10 20:41:39,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:39,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:39,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:39,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:39,721 INFO L87 Difference]: Start difference. First operand 205 states and 608 transitions. Second operand 8 states. [2020-02-10 20:41:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:39,806 INFO L93 Difference]: Finished difference Result 342 states and 869 transitions. [2020-02-10 20:41:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:39,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:39,810 INFO L225 Difference]: With dead ends: 342 [2020-02-10 20:41:39,811 INFO L226 Difference]: Without dead ends: 332 [2020-02-10 20:41:39,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-02-10 20:41:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 207. [2020-02-10 20:41:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-02-10 20:41:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 611 transitions. [2020-02-10 20:41:39,815 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 611 transitions. Word has length 19 [2020-02-10 20:41:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:39,815 INFO L479 AbstractCegarLoop]: Abstraction has 207 states and 611 transitions. [2020-02-10 20:41:39,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 611 transitions. [2020-02-10 20:41:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:39,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:39,816 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:39,816 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1964888434, now seen corresponding path program 258 times [2020-02-10 20:41:39,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:39,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852574571] [2020-02-10 20:41:39,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:39,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852574571] [2020-02-10 20:41:39,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:39,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:39,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613878019] [2020-02-10 20:41:39,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:39,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:39,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:39,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:39,988 INFO L87 Difference]: Start difference. First operand 207 states and 611 transitions. Second operand 8 states. [2020-02-10 20:41:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:40,067 INFO L93 Difference]: Finished difference Result 345 states and 874 transitions. [2020-02-10 20:41:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:40,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:40,069 INFO L225 Difference]: With dead ends: 345 [2020-02-10 20:41:40,069 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 20:41:40,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 20:41:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 202. [2020-02-10 20:41:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 20:41:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 601 transitions. [2020-02-10 20:41:40,075 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 601 transitions. Word has length 19 [2020-02-10 20:41:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:40,075 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 601 transitions. [2020-02-10 20:41:40,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 601 transitions. [2020-02-10 20:41:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:40,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:40,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:40,076 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1020844596, now seen corresponding path program 259 times [2020-02-10 20:41:40,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:40,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628077622] [2020-02-10 20:41:40,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:40,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628077622] [2020-02-10 20:41:40,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:40,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:40,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014826833] [2020-02-10 20:41:40,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:40,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:40,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:40,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:40,250 INFO L87 Difference]: Start difference. First operand 202 states and 601 transitions. Second operand 8 states. [2020-02-10 20:41:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:40,327 INFO L93 Difference]: Finished difference Result 342 states and 873 transitions. [2020-02-10 20:41:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:40,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:40,328 INFO L225 Difference]: With dead ends: 342 [2020-02-10 20:41:40,328 INFO L226 Difference]: Without dead ends: 328 [2020-02-10 20:41:40,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-02-10 20:41:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 206. [2020-02-10 20:41:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 20:41:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 611 transitions. [2020-02-10 20:41:40,333 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 611 transitions. Word has length 19 [2020-02-10 20:41:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:40,333 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 611 transitions. [2020-02-10 20:41:40,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 611 transitions. [2020-02-10 20:41:40,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:40,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:40,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:40,333 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:40,334 INFO L82 PathProgramCache]: Analyzing trace with hash 146509270, now seen corresponding path program 260 times [2020-02-10 20:41:40,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:40,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692928710] [2020-02-10 20:41:40,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:40,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692928710] [2020-02-10 20:41:40,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:40,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:40,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212512749] [2020-02-10 20:41:40,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:40,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:40,503 INFO L87 Difference]: Start difference. First operand 206 states and 611 transitions. Second operand 8 states. [2020-02-10 20:41:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:40,580 INFO L93 Difference]: Finished difference Result 338 states and 862 transitions. [2020-02-10 20:41:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:40,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:40,581 INFO L225 Difference]: With dead ends: 338 [2020-02-10 20:41:40,581 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 20:41:40,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 20:41:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 204. [2020-02-10 20:41:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-02-10 20:41:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 606 transitions. [2020-02-10 20:41:40,586 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 606 transitions. Word has length 19 [2020-02-10 20:41:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:40,586 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 606 transitions. [2020-02-10 20:41:40,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 606 transitions. [2020-02-10 20:41:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:40,586 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:40,587 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:40,587 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:40,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1040015206, now seen corresponding path program 261 times [2020-02-10 20:41:40,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:40,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26517067] [2020-02-10 20:41:40,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:40,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26517067] [2020-02-10 20:41:40,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:40,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:40,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646387495] [2020-02-10 20:41:40,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:40,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:40,765 INFO L87 Difference]: Start difference. First operand 204 states and 606 transitions. Second operand 8 states. [2020-02-10 20:41:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:40,842 INFO L93 Difference]: Finished difference Result 348 states and 888 transitions. [2020-02-10 20:41:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:40,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:40,843 INFO L225 Difference]: With dead ends: 348 [2020-02-10 20:41:40,843 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 20:41:40,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 20:41:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 209. [2020-02-10 20:41:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-02-10 20:41:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 616 transitions. [2020-02-10 20:41:40,849 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 616 transitions. Word has length 19 [2020-02-10 20:41:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:40,849 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 616 transitions. [2020-02-10 20:41:40,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 616 transitions. [2020-02-10 20:41:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:40,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:40,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:40,849 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash -71131166, now seen corresponding path program 262 times [2020-02-10 20:41:40,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:40,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993037795] [2020-02-10 20:41:40,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:41,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993037795] [2020-02-10 20:41:41,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:41,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:41,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070083071] [2020-02-10 20:41:41,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:41,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:41,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:41,026 INFO L87 Difference]: Start difference. First operand 209 states and 616 transitions. Second operand 8 states. [2020-02-10 20:41:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:41,105 INFO L93 Difference]: Finished difference Result 347 states and 881 transitions. [2020-02-10 20:41:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:41,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:41,106 INFO L225 Difference]: With dead ends: 347 [2020-02-10 20:41:41,106 INFO L226 Difference]: Without dead ends: 329 [2020-02-10 20:41:41,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-02-10 20:41:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 204. [2020-02-10 20:41:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-02-10 20:41:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 604 transitions. [2020-02-10 20:41:41,112 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 604 transitions. Word has length 19 [2020-02-10 20:41:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:41,112 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 604 transitions. [2020-02-10 20:41:41,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 604 transitions. [2020-02-10 20:41:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:41,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:41,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:41,113 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash 319756962, now seen corresponding path program 263 times [2020-02-10 20:41:41,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:41,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399119650] [2020-02-10 20:41:41,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:41,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399119650] [2020-02-10 20:41:41,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:41,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:41,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309892033] [2020-02-10 20:41:41,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:41,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:41,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:41,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:41,313 INFO L87 Difference]: Start difference. First operand 204 states and 604 transitions. Second operand 8 states. [2020-02-10 20:41:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:41,385 INFO L93 Difference]: Finished difference Result 337 states and 858 transitions. [2020-02-10 20:41:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:41,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:41,387 INFO L225 Difference]: With dead ends: 337 [2020-02-10 20:41:41,387 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 20:41:41,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 20:41:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 206. [2020-02-10 20:41:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 20:41:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 607 transitions. [2020-02-10 20:41:41,393 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 607 transitions. Word has length 19 [2020-02-10 20:41:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:41,393 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 607 transitions. [2020-02-10 20:41:41,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 607 transitions. [2020-02-10 20:41:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:41,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:41,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:41,394 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:41,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1409290372, now seen corresponding path program 264 times [2020-02-10 20:41:41,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:41,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259626026] [2020-02-10 20:41:41,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:41,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259626026] [2020-02-10 20:41:41,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:41,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:41,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610319720] [2020-02-10 20:41:41,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:41,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:41,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:41,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:41,573 INFO L87 Difference]: Start difference. First operand 206 states and 607 transitions. Second operand 8 states. [2020-02-10 20:41:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:41,654 INFO L93 Difference]: Finished difference Result 340 states and 863 transitions. [2020-02-10 20:41:41,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:41,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:41,655 INFO L225 Difference]: With dead ends: 340 [2020-02-10 20:41:41,655 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 20:41:41,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 20:41:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 197. [2020-02-10 20:41:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-02-10 20:41:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 591 transitions. [2020-02-10 20:41:41,660 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 591 transitions. Word has length 19 [2020-02-10 20:41:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:41,661 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 591 transitions. [2020-02-10 20:41:41,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 591 transitions. [2020-02-10 20:41:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:41,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:41,661 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:41,661 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash -666960488, now seen corresponding path program 265 times [2020-02-10 20:41:41,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:41,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902761367] [2020-02-10 20:41:41,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:41,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902761367] [2020-02-10 20:41:41,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:41,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:41,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074994458] [2020-02-10 20:41:41,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:41,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:41,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:41,898 INFO L87 Difference]: Start difference. First operand 197 states and 591 transitions. Second operand 8 states. [2020-02-10 20:41:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:41,952 INFO L93 Difference]: Finished difference Result 365 states and 927 transitions. [2020-02-10 20:41:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:41,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:41,954 INFO L225 Difference]: With dead ends: 365 [2020-02-10 20:41:41,954 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 20:41:41,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 20:41:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 205. [2020-02-10 20:41:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-02-10 20:41:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 605 transitions. [2020-02-10 20:41:41,960 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 605 transitions. Word has length 19 [2020-02-10 20:41:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:41,960 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 605 transitions. [2020-02-10 20:41:41,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 605 transitions. [2020-02-10 20:41:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:41,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:41,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:41,961 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash -292309302, now seen corresponding path program 266 times [2020-02-10 20:41:41,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:41,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954301694] [2020-02-10 20:41:41,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:42,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954301694] [2020-02-10 20:41:42,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:42,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:42,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141535578] [2020-02-10 20:41:42,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:42,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:42,166 INFO L87 Difference]: Start difference. First operand 205 states and 605 transitions. Second operand 8 states. [2020-02-10 20:41:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:42,239 INFO L93 Difference]: Finished difference Result 363 states and 917 transitions. [2020-02-10 20:41:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:42,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:42,240 INFO L225 Difference]: With dead ends: 363 [2020-02-10 20:41:42,240 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 20:41:42,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 20:41:42,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 197. [2020-02-10 20:41:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-02-10 20:41:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 584 transitions. [2020-02-10 20:41:42,246 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 584 transitions. Word has length 19 [2020-02-10 20:41:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:42,246 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 584 transitions. [2020-02-10 20:41:42,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 584 transitions. [2020-02-10 20:41:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:42,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:42,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:42,246 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:42,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:42,247 INFO L82 PathProgramCache]: Analyzing trace with hash 514429266, now seen corresponding path program 267 times [2020-02-10 20:41:42,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:42,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619600866] [2020-02-10 20:41:42,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:42,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619600866] [2020-02-10 20:41:42,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:42,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:42,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672921322] [2020-02-10 20:41:42,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:42,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:42,451 INFO L87 Difference]: Start difference. First operand 197 states and 584 transitions. Second operand 8 states. [2020-02-10 20:41:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:42,504 INFO L93 Difference]: Finished difference Result 362 states and 914 transitions. [2020-02-10 20:41:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:42,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:42,505 INFO L225 Difference]: With dead ends: 362 [2020-02-10 20:41:42,506 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 20:41:42,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 20:41:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 203. [2020-02-10 20:41:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-02-10 20:41:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 595 transitions. [2020-02-10 20:41:42,511 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 595 transitions. Word has length 19 [2020-02-10 20:41:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:42,511 INFO L479 AbstractCegarLoop]: Abstraction has 203 states and 595 transitions. [2020-02-10 20:41:42,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 595 transitions. [2020-02-10 20:41:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:42,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:42,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:42,512 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:42,512 INFO L82 PathProgramCache]: Analyzing trace with hash -461775484, now seen corresponding path program 268 times [2020-02-10 20:41:42,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:42,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271024887] [2020-02-10 20:41:42,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:42,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271024887] [2020-02-10 20:41:42,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:42,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:42,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568636348] [2020-02-10 20:41:42,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:42,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:42,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:42,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:42,723 INFO L87 Difference]: Start difference. First operand 203 states and 595 transitions. Second operand 8 states. [2020-02-10 20:41:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:42,797 INFO L93 Difference]: Finished difference Result 359 states and 903 transitions. [2020-02-10 20:41:42,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:42,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:42,799 INFO L225 Difference]: With dead ends: 359 [2020-02-10 20:41:42,799 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:41:42,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:41:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 197. [2020-02-10 20:41:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-02-10 20:41:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 578 transitions. [2020-02-10 20:41:42,804 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 578 transitions. Word has length 19 [2020-02-10 20:41:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:42,804 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 578 transitions. [2020-02-10 20:41:42,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 578 transitions. [2020-02-10 20:41:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:42,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:42,805 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:42,805 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:42,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1704196806, now seen corresponding path program 269 times [2020-02-10 20:41:42,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:42,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167158715] [2020-02-10 20:41:42,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:43,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167158715] [2020-02-10 20:41:43,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:43,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:43,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974387232] [2020-02-10 20:41:43,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:43,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:43,003 INFO L87 Difference]: Start difference. First operand 197 states and 578 transitions. Second operand 8 states. [2020-02-10 20:41:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:43,083 INFO L93 Difference]: Finished difference Result 357 states and 900 transitions. [2020-02-10 20:41:43,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:43,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:43,084 INFO L225 Difference]: With dead ends: 357 [2020-02-10 20:41:43,085 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 20:41:43,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 20:41:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 202. [2020-02-10 20:41:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 20:41:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 588 transitions. [2020-02-10 20:41:43,089 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 588 transitions. Word has length 19 [2020-02-10 20:41:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:43,089 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 588 transitions. [2020-02-10 20:41:43,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 588 transitions. [2020-02-10 20:41:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:43,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:43,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:43,090 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1732490606, now seen corresponding path program 270 times [2020-02-10 20:41:43,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:43,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128451171] [2020-02-10 20:41:43,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:43,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128451171] [2020-02-10 20:41:43,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:43,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:43,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195748340] [2020-02-10 20:41:43,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:43,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:43,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:43,289 INFO L87 Difference]: Start difference. First operand 202 states and 588 transitions. Second operand 8 states. [2020-02-10 20:41:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:43,366 INFO L93 Difference]: Finished difference Result 356 states and 893 transitions. [2020-02-10 20:41:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:43,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:43,367 INFO L225 Difference]: With dead ends: 356 [2020-02-10 20:41:43,368 INFO L226 Difference]: Without dead ends: 330 [2020-02-10 20:41:43,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-02-10 20:41:43,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 189. [2020-02-10 20:41:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 560 transitions. [2020-02-10 20:41:43,372 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 560 transitions. Word has length 19 [2020-02-10 20:41:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:43,372 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 560 transitions. [2020-02-10 20:41:43,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 560 transitions. [2020-02-10 20:41:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:43,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:43,373 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:43,373 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash 710767946, now seen corresponding path program 271 times [2020-02-10 20:41:43,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:43,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546917360] [2020-02-10 20:41:43,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:43,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546917360] [2020-02-10 20:41:43,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:43,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:43,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717859401] [2020-02-10 20:41:43,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:43,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:43,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:43,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:43,592 INFO L87 Difference]: Start difference. First operand 189 states and 560 transitions. Second operand 8 states. [2020-02-10 20:41:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:43,648 INFO L93 Difference]: Finished difference Result 344 states and 860 transitions. [2020-02-10 20:41:43,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:43,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:43,650 INFO L225 Difference]: With dead ends: 344 [2020-02-10 20:41:43,650 INFO L226 Difference]: Without dead ends: 328 [2020-02-10 20:41:43,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-02-10 20:41:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 201. [2020-02-10 20:41:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-02-10 20:41:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 586 transitions. [2020-02-10 20:41:43,655 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 586 transitions. Word has length 19 [2020-02-10 20:41:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:43,656 INFO L479 AbstractCegarLoop]: Abstraction has 201 states and 586 transitions. [2020-02-10 20:41:43,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 586 transitions. [2020-02-10 20:41:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:43,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:43,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:43,656 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1085419132, now seen corresponding path program 272 times [2020-02-10 20:41:43,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:43,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522899252] [2020-02-10 20:41:43,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:43,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522899252] [2020-02-10 20:41:43,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:43,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:43,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306625181] [2020-02-10 20:41:43,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:43,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:43,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:43,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:43,858 INFO L87 Difference]: Start difference. First operand 201 states and 586 transitions. Second operand 8 states. [2020-02-10 20:41:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:43,938 INFO L93 Difference]: Finished difference Result 342 states and 850 transitions. [2020-02-10 20:41:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:43,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:43,940 INFO L225 Difference]: With dead ends: 342 [2020-02-10 20:41:43,940 INFO L226 Difference]: Without dead ends: 320 [2020-02-10 20:41:43,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-02-10 20:41:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 193. [2020-02-10 20:41:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:41:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 568 transitions. [2020-02-10 20:41:43,944 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 568 transitions. Word has length 19 [2020-02-10 20:41:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:43,944 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 568 transitions. [2020-02-10 20:41:43,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 568 transitions. [2020-02-10 20:41:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:43,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:43,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:43,945 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:43,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1240965252, now seen corresponding path program 273 times [2020-02-10 20:41:43,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:43,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359422427] [2020-02-10 20:41:43,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:44,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359422427] [2020-02-10 20:41:44,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:44,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:44,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891495676] [2020-02-10 20:41:44,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:44,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:44,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:44,150 INFO L87 Difference]: Start difference. First operand 193 states and 568 transitions. Second operand 8 states. [2020-02-10 20:41:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:44,210 INFO L93 Difference]: Finished difference Result 327 states and 818 transitions. [2020-02-10 20:41:44,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:44,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:44,211 INFO L225 Difference]: With dead ends: 327 [2020-02-10 20:41:44,211 INFO L226 Difference]: Without dead ends: 311 [2020-02-10 20:41:44,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-02-10 20:41:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 196. [2020-02-10 20:41:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-02-10 20:41:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 572 transitions. [2020-02-10 20:41:44,215 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 572 transitions. Word has length 19 [2020-02-10 20:41:44,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:44,216 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 572 transitions. [2020-02-10 20:41:44,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 572 transitions. [2020-02-10 20:41:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:44,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:44,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:44,216 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:44,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1500023478, now seen corresponding path program 274 times [2020-02-10 20:41:44,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:44,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302690295] [2020-02-10 20:41:44,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:44,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302690295] [2020-02-10 20:41:44,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:44,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:44,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897145814] [2020-02-10 20:41:44,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:44,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:44,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:44,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:44,408 INFO L87 Difference]: Start difference. First operand 196 states and 572 transitions. Second operand 8 states. [2020-02-10 20:41:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:44,464 INFO L93 Difference]: Finished difference Result 312 states and 794 transitions. [2020-02-10 20:41:44,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:44,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:44,465 INFO L225 Difference]: With dead ends: 312 [2020-02-10 20:41:44,465 INFO L226 Difference]: Without dead ends: 299 [2020-02-10 20:41:44,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-02-10 20:41:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 193. [2020-02-10 20:41:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:41:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 565 transitions. [2020-02-10 20:41:44,470 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 565 transitions. Word has length 19 [2020-02-10 20:41:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:44,470 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 565 transitions. [2020-02-10 20:41:44,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 565 transitions. [2020-02-10 20:41:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:44,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:44,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:44,471 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:44,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:44,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1131696324, now seen corresponding path program 275 times [2020-02-10 20:41:44,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:44,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601154683] [2020-02-10 20:41:44,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:44,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601154683] [2020-02-10 20:41:44,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:44,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:44,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417782818] [2020-02-10 20:41:44,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:44,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:44,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:44,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:44,670 INFO L87 Difference]: Start difference. First operand 193 states and 565 transitions. Second operand 8 states. [2020-02-10 20:41:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:44,752 INFO L93 Difference]: Finished difference Result 324 states and 810 transitions. [2020-02-10 20:41:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:44,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:44,753 INFO L225 Difference]: With dead ends: 324 [2020-02-10 20:41:44,753 INFO L226 Difference]: Without dead ends: 310 [2020-02-10 20:41:44,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-02-10 20:41:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 195. [2020-02-10 20:41:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 20:41:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 568 transitions. [2020-02-10 20:41:44,757 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 568 transitions. Word has length 19 [2020-02-10 20:41:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:44,758 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 568 transitions. [2020-02-10 20:41:44,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 568 transitions. [2020-02-10 20:41:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:44,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:44,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:44,758 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:44,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:44,758 INFO L82 PathProgramCache]: Analyzing trace with hash -11566494, now seen corresponding path program 276 times [2020-02-10 20:41:44,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:44,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808142296] [2020-02-10 20:41:44,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:44,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808142296] [2020-02-10 20:41:44,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:44,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:44,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135840679] [2020-02-10 20:41:44,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:44,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:44,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:44,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:44,980 INFO L87 Difference]: Start difference. First operand 195 states and 568 transitions. Second operand 8 states. [2020-02-10 20:41:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:45,044 INFO L93 Difference]: Finished difference Result 311 states and 790 transitions. [2020-02-10 20:41:45,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:45,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:45,045 INFO L225 Difference]: With dead ends: 311 [2020-02-10 20:41:45,045 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:41:45,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:41:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2020-02-10 20:41:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 556 transitions. [2020-02-10 20:41:45,049 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 556 transitions. Word has length 19 [2020-02-10 20:41:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:45,049 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 556 transitions. [2020-02-10 20:41:45,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 556 transitions. [2020-02-10 20:41:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:45,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:45,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:45,050 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash -790658038, now seen corresponding path program 277 times [2020-02-10 20:41:45,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:45,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846038388] [2020-02-10 20:41:45,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:45,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846038388] [2020-02-10 20:41:45,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:45,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:45,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050274700] [2020-02-10 20:41:45,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:45,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:45,245 INFO L87 Difference]: Start difference. First operand 189 states and 556 transitions. Second operand 8 states. [2020-02-10 20:41:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:45,300 INFO L93 Difference]: Finished difference Result 339 states and 846 transitions. [2020-02-10 20:41:45,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:45,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:45,301 INFO L225 Difference]: With dead ends: 339 [2020-02-10 20:41:45,301 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 20:41:45,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 20:41:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 195. [2020-02-10 20:41:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 20:41:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 570 transitions. [2020-02-10 20:41:45,305 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 570 transitions. Word has length 19 [2020-02-10 20:41:45,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:45,305 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 570 transitions. [2020-02-10 20:41:45,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 570 transitions. [2020-02-10 20:41:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:45,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:45,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:45,306 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:45,306 INFO L82 PathProgramCache]: Analyzing trace with hash -531599812, now seen corresponding path program 278 times [2020-02-10 20:41:45,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:45,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108919950] [2020-02-10 20:41:45,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:45,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108919950] [2020-02-10 20:41:45,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:45,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:45,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641146456] [2020-02-10 20:41:45,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:45,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:45,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:45,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:45,500 INFO L87 Difference]: Start difference. First operand 195 states and 570 transitions. Second operand 8 states. [2020-02-10 20:41:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:45,558 INFO L93 Difference]: Finished difference Result 333 states and 831 transitions. [2020-02-10 20:41:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:45,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:45,560 INFO L225 Difference]: With dead ends: 333 [2020-02-10 20:41:45,560 INFO L226 Difference]: Without dead ends: 320 [2020-02-10 20:41:45,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-02-10 20:41:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 192. [2020-02-10 20:41:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:41:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 563 transitions. [2020-02-10 20:41:45,565 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 563 transitions. Word has length 19 [2020-02-10 20:41:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:45,565 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 563 transitions. [2020-02-10 20:41:45,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 563 transitions. [2020-02-10 20:41:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:45,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:45,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:45,566 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:45,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash 303433550, now seen corresponding path program 279 times [2020-02-10 20:41:45,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:45,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211003952] [2020-02-10 20:41:45,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:45,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211003952] [2020-02-10 20:41:45,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:45,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:45,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969610100] [2020-02-10 20:41:45,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:45,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:45,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:45,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:45,763 INFO L87 Difference]: Start difference. First operand 192 states and 563 transitions. Second operand 8 states. [2020-02-10 20:41:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:45,824 INFO L93 Difference]: Finished difference Result 339 states and 843 transitions. [2020-02-10 20:41:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:45,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:45,826 INFO L225 Difference]: With dead ends: 339 [2020-02-10 20:41:45,826 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 20:41:45,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 20:41:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 198. [2020-02-10 20:41:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-02-10 20:41:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 574 transitions. [2020-02-10 20:41:45,830 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 574 transitions. Word has length 19 [2020-02-10 20:41:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:45,830 INFO L479 AbstractCegarLoop]: Abstraction has 198 states and 574 transitions. [2020-02-10 20:41:45,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 574 transitions. [2020-02-10 20:41:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:45,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:45,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:45,831 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:45,831 INFO L82 PathProgramCache]: Analyzing trace with hash -672771200, now seen corresponding path program 280 times [2020-02-10 20:41:45,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:45,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715580447] [2020-02-10 20:41:45,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:46,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715580447] [2020-02-10 20:41:46,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:46,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:46,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348113256] [2020-02-10 20:41:46,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:46,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:46,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:46,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:46,024 INFO L87 Difference]: Start difference. First operand 198 states and 574 transitions. Second operand 8 states. [2020-02-10 20:41:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:46,119 INFO L93 Difference]: Finished difference Result 336 states and 832 transitions. [2020-02-10 20:41:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:46,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:46,121 INFO L225 Difference]: With dead ends: 336 [2020-02-10 20:41:46,121 INFO L226 Difference]: Without dead ends: 317 [2020-02-10 20:41:46,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-02-10 20:41:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 192. [2020-02-10 20:41:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:41:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 560 transitions. [2020-02-10 20:41:46,126 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 560 transitions. Word has length 19 [2020-02-10 20:41:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:46,126 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 560 transitions. [2020-02-10 20:41:46,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 560 transitions. [2020-02-10 20:41:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:46,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:46,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:46,127 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:46,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:46,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1980171160, now seen corresponding path program 281 times [2020-02-10 20:41:46,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:46,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518003535] [2020-02-10 20:41:46,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:46,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518003535] [2020-02-10 20:41:46,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:46,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:46,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252841070] [2020-02-10 20:41:46,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:46,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:46,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:46,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:46,349 INFO L87 Difference]: Start difference. First operand 192 states and 560 transitions. Second operand 8 states. [2020-02-10 20:41:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:46,404 INFO L93 Difference]: Finished difference Result 323 states and 804 transitions. [2020-02-10 20:41:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:46,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:46,405 INFO L225 Difference]: With dead ends: 323 [2020-02-10 20:41:46,405 INFO L226 Difference]: Without dead ends: 313 [2020-02-10 20:41:46,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-02-10 20:41:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 194. [2020-02-10 20:41:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-02-10 20:41:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 563 transitions. [2020-02-10 20:41:46,410 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 563 transitions. Word has length 19 [2020-02-10 20:41:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:46,410 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 563 transitions. [2020-02-10 20:41:46,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 563 transitions. [2020-02-10 20:41:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:46,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:46,410 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:46,411 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:46,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:46,411 INFO L82 PathProgramCache]: Analyzing trace with hash -490766164, now seen corresponding path program 282 times [2020-02-10 20:41:46,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:46,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984450122] [2020-02-10 20:41:46,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:46,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984450122] [2020-02-10 20:41:46,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:46,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:46,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450395328] [2020-02-10 20:41:46,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:46,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:46,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:46,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:46,600 INFO L87 Difference]: Start difference. First operand 194 states and 563 transitions. Second operand 8 states. [2020-02-10 20:41:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:46,676 INFO L93 Difference]: Finished difference Result 321 states and 799 transitions. [2020-02-10 20:41:46,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:46,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:46,677 INFO L225 Difference]: With dead ends: 321 [2020-02-10 20:41:46,677 INFO L226 Difference]: Without dead ends: 303 [2020-02-10 20:41:46,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:46,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-02-10 20:41:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 189. [2020-02-10 20:41:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 553 transitions. [2020-02-10 20:41:46,682 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 553 transitions. Word has length 19 [2020-02-10 20:41:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:46,682 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 553 transitions. [2020-02-10 20:41:46,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 553 transitions. [2020-02-10 20:41:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:46,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:46,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:46,682 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:46,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash 504306274, now seen corresponding path program 283 times [2020-02-10 20:41:46,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:46,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12730971] [2020-02-10 20:41:46,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:46,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12730971] [2020-02-10 20:41:46,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:46,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:46,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113708687] [2020-02-10 20:41:46,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:46,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:46,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:46,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:46,903 INFO L87 Difference]: Start difference. First operand 189 states and 553 transitions. Second operand 8 states. [2020-02-10 20:41:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:46,973 INFO L93 Difference]: Finished difference Result 329 states and 825 transitions. [2020-02-10 20:41:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:46,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:46,975 INFO L225 Difference]: With dead ends: 329 [2020-02-10 20:41:46,975 INFO L226 Difference]: Without dead ends: 315 [2020-02-10 20:41:46,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-02-10 20:41:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 193. [2020-02-10 20:41:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:41:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 563 transitions. [2020-02-10 20:41:46,979 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 563 transitions. Word has length 19 [2020-02-10 20:41:46,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:46,979 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 563 transitions. [2020-02-10 20:41:46,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 563 transitions. [2020-02-10 20:41:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:46,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:46,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:46,980 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:46,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1624436104, now seen corresponding path program 284 times [2020-02-10 20:41:46,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:46,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419535018] [2020-02-10 20:41:46,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:47,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419535018] [2020-02-10 20:41:47,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:47,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:47,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363242240] [2020-02-10 20:41:47,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:47,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:47,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:47,173 INFO L87 Difference]: Start difference. First operand 193 states and 563 transitions. Second operand 8 states. [2020-02-10 20:41:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:47,233 INFO L93 Difference]: Finished difference Result 325 states and 814 transitions. [2020-02-10 20:41:47,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:47,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:47,235 INFO L225 Difference]: With dead ends: 325 [2020-02-10 20:41:47,235 INFO L226 Difference]: Without dead ends: 313 [2020-02-10 20:41:47,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-02-10 20:41:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 191. [2020-02-10 20:41:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:41:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 558 transitions. [2020-02-10 20:41:47,240 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 558 transitions. Word has length 19 [2020-02-10 20:41:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:47,240 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 558 transitions. [2020-02-10 20:41:47,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 558 transitions. [2020-02-10 20:41:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:47,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:47,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:47,241 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash -568779106, now seen corresponding path program 285 times [2020-02-10 20:41:47,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:47,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327669411] [2020-02-10 20:41:47,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:47,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327669411] [2020-02-10 20:41:47,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:47,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:47,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889562781] [2020-02-10 20:41:47,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:47,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:47,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:47,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:47,482 INFO L87 Difference]: Start difference. First operand 191 states and 558 transitions. Second operand 8 states. [2020-02-10 20:41:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:47,565 INFO L93 Difference]: Finished difference Result 330 states and 825 transitions. [2020-02-10 20:41:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:47,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:47,566 INFO L225 Difference]: With dead ends: 330 [2020-02-10 20:41:47,566 INFO L226 Difference]: Without dead ends: 316 [2020-02-10 20:41:47,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-02-10 20:41:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 196. [2020-02-10 20:41:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-02-10 20:41:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 568 transitions. [2020-02-10 20:41:47,572 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 568 transitions. Word has length 19 [2020-02-10 20:41:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:47,572 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 568 transitions. [2020-02-10 20:41:47,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 568 transitions. [2020-02-10 20:41:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:47,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:47,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:47,573 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:47,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1210836024, now seen corresponding path program 286 times [2020-02-10 20:41:47,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:47,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680471502] [2020-02-10 20:41:47,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:47,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680471502] [2020-02-10 20:41:47,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:47,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:47,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035521334] [2020-02-10 20:41:47,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:47,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:47,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:47,765 INFO L87 Difference]: Start difference. First operand 196 states and 568 transitions. Second operand 8 states. [2020-02-10 20:41:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:47,852 INFO L93 Difference]: Finished difference Result 329 states and 818 transitions. [2020-02-10 20:41:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:47,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:47,853 INFO L225 Difference]: With dead ends: 329 [2020-02-10 20:41:47,853 INFO L226 Difference]: Without dead ends: 311 [2020-02-10 20:41:47,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:47,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-02-10 20:41:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 191. [2020-02-10 20:41:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:41:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-02-10 20:41:47,857 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-02-10 20:41:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:47,858 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-02-10 20:41:47,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-02-10 20:41:47,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:47,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:47,858 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:47,858 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:47,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:47,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1594820036, now seen corresponding path program 287 times [2020-02-10 20:41:47,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:47,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439953435] [2020-02-10 20:41:47,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:48,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439953435] [2020-02-10 20:41:48,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:48,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:48,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913205481] [2020-02-10 20:41:48,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:48,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:48,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:48,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:48,057 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-02-10 20:41:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:48,127 INFO L93 Difference]: Finished difference Result 319 states and 795 transitions. [2020-02-10 20:41:48,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:48,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:48,128 INFO L225 Difference]: With dead ends: 319 [2020-02-10 20:41:48,128 INFO L226 Difference]: Without dead ends: 309 [2020-02-10 20:41:48,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-02-10 20:41:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 193. [2020-02-10 20:41:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:41:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 559 transitions. [2020-02-10 20:41:48,133 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 559 transitions. Word has length 19 [2020-02-10 20:41:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:48,133 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 559 transitions. [2020-02-10 20:41:48,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 559 transitions. [2020-02-10 20:41:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:48,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:48,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:48,134 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:48,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash -105415040, now seen corresponding path program 288 times [2020-02-10 20:41:48,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:48,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891580777] [2020-02-10 20:41:48,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:48,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891580777] [2020-02-10 20:41:48,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:48,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:48,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886996539] [2020-02-10 20:41:48,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:48,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:48,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:48,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:48,323 INFO L87 Difference]: Start difference. First operand 193 states and 559 transitions. Second operand 8 states. [2020-02-10 20:41:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:48,400 INFO L93 Difference]: Finished difference Result 317 states and 790 transitions. [2020-02-10 20:41:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:48,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:48,401 INFO L225 Difference]: With dead ends: 317 [2020-02-10 20:41:48,401 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:41:48,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:41:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-02-10 20:41:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:41:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 543 transitions. [2020-02-10 20:41:48,406 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 543 transitions. Word has length 19 [2020-02-10 20:41:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:48,406 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 543 transitions. [2020-02-10 20:41:48,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 543 transitions. [2020-02-10 20:41:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:48,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:48,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:48,407 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:48,407 INFO L82 PathProgramCache]: Analyzing trace with hash -907792650, now seen corresponding path program 289 times [2020-02-10 20:41:48,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:48,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855017195] [2020-02-10 20:41:48,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:48,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855017195] [2020-02-10 20:41:48,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:48,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:48,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519319183] [2020-02-10 20:41:48,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:48,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:48,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:48,632 INFO L87 Difference]: Start difference. First operand 184 states and 543 transitions. Second operand 8 states. [2020-02-10 20:41:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:48,698 INFO L93 Difference]: Finished difference Result 330 states and 816 transitions. [2020-02-10 20:41:48,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:48,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:48,700 INFO L225 Difference]: With dead ends: 330 [2020-02-10 20:41:48,700 INFO L226 Difference]: Without dead ends: 314 [2020-02-10 20:41:48,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-02-10 20:41:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 199. [2020-02-10 20:41:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-02-10 20:41:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2020-02-10 20:41:48,705 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 19 [2020-02-10 20:41:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:48,705 INFO L479 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2020-02-10 20:41:48,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2020-02-10 20:41:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:48,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:48,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:48,706 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash -533141464, now seen corresponding path program 290 times [2020-02-10 20:41:48,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:48,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169667325] [2020-02-10 20:41:48,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:48,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169667325] [2020-02-10 20:41:48,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:48,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:48,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730007300] [2020-02-10 20:41:48,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:48,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:48,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:48,909 INFO L87 Difference]: Start difference. First operand 199 states and 580 transitions. Second operand 8 states. [2020-02-10 20:41:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:49,001 INFO L93 Difference]: Finished difference Result 328 states and 806 transitions. [2020-02-10 20:41:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:49,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:49,002 INFO L225 Difference]: With dead ends: 328 [2020-02-10 20:41:49,003 INFO L226 Difference]: Without dead ends: 306 [2020-02-10 20:41:49,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-02-10 20:41:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 191. [2020-02-10 20:41:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:41:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 562 transitions. [2020-02-10 20:41:49,007 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 562 transitions. Word has length 19 [2020-02-10 20:41:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:49,007 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 562 transitions. [2020-02-10 20:41:49,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 562 transitions. [2020-02-10 20:41:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:49,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:49,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:49,008 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:49,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:49,008 INFO L82 PathProgramCache]: Analyzing trace with hash -703191568, now seen corresponding path program 291 times [2020-02-10 20:41:49,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:49,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195745654] [2020-02-10 20:41:49,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:49,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195745654] [2020-02-10 20:41:49,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:49,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:49,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665765697] [2020-02-10 20:41:49,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:49,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:49,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:49,208 INFO L87 Difference]: Start difference. First operand 191 states and 562 transitions. Second operand 8 states. [2020-02-10 20:41:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:49,276 INFO L93 Difference]: Finished difference Result 321 states and 789 transitions. [2020-02-10 20:41:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:49,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:49,277 INFO L225 Difference]: With dead ends: 321 [2020-02-10 20:41:49,278 INFO L226 Difference]: Without dead ends: 305 [2020-02-10 20:41:49,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-02-10 20:41:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 194. [2020-02-10 20:41:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-02-10 20:41:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 566 transitions. [2020-02-10 20:41:49,282 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 566 transitions. Word has length 19 [2020-02-10 20:41:49,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:49,282 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 566 transitions. [2020-02-10 20:41:49,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 566 transitions. [2020-02-10 20:41:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:49,282 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:49,282 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:49,282 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:49,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1440049182, now seen corresponding path program 292 times [2020-02-10 20:41:49,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:49,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763800116] [2020-02-10 20:41:49,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:49,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763800116] [2020-02-10 20:41:49,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:49,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:49,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90983722] [2020-02-10 20:41:49,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:49,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:49,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:49,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:49,469 INFO L87 Difference]: Start difference. First operand 194 states and 566 transitions. Second operand 8 states. [2020-02-10 20:41:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:49,556 INFO L93 Difference]: Finished difference Result 315 states and 774 transitions. [2020-02-10 20:41:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:49,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:49,557 INFO L225 Difference]: With dead ends: 315 [2020-02-10 20:41:49,558 INFO L226 Difference]: Without dead ends: 302 [2020-02-10 20:41:49,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-02-10 20:41:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 191. [2020-02-10 20:41:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:41:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 559 transitions. [2020-02-10 20:41:49,561 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 559 transitions. Word has length 19 [2020-02-10 20:41:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:49,562 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 559 transitions. [2020-02-10 20:41:49,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 559 transitions. [2020-02-10 20:41:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:49,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:49,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:49,562 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:49,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2101207602, now seen corresponding path program 293 times [2020-02-10 20:41:49,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:49,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467411453] [2020-02-10 20:41:49,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:49,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467411453] [2020-02-10 20:41:49,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:49,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:49,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523990306] [2020-02-10 20:41:49,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:49,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:49,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:49,747 INFO L87 Difference]: Start difference. First operand 191 states and 559 transitions. Second operand 8 states. [2020-02-10 20:41:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:49,823 INFO L93 Difference]: Finished difference Result 316 states and 778 transitions. [2020-02-10 20:41:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:49,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:49,824 INFO L225 Difference]: With dead ends: 316 [2020-02-10 20:41:49,824 INFO L226 Difference]: Without dead ends: 302 [2020-02-10 20:41:49,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-02-10 20:41:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 193. [2020-02-10 20:41:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:41:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 562 transitions. [2020-02-10 20:41:49,829 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 562 transitions. Word has length 19 [2020-02-10 20:41:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:49,830 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 562 transitions. [2020-02-10 20:41:49,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 562 transitions. [2020-02-10 20:41:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:49,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:49,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:49,830 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1319424368, now seen corresponding path program 294 times [2020-02-10 20:41:49,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:49,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312896738] [2020-02-10 20:41:49,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:50,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312896738] [2020-02-10 20:41:50,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:50,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:50,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433639874] [2020-02-10 20:41:50,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:50,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:50,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:50,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:50,017 INFO L87 Difference]: Start difference. First operand 193 states and 562 transitions. Second operand 8 states. [2020-02-10 20:41:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:50,095 INFO L93 Difference]: Finished difference Result 312 states and 767 transitions. [2020-02-10 20:41:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:50,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:50,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:50,096 INFO L225 Difference]: With dead ends: 312 [2020-02-10 20:41:50,096 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 20:41:50,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 20:41:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 187. [2020-02-10 20:41:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:41:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 551 transitions. [2020-02-10 20:41:50,101 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 551 transitions. Word has length 19 [2020-02-10 20:41:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:50,101 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 551 transitions. [2020-02-10 20:41:50,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 551 transitions. [2020-02-10 20:41:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:50,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:50,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:50,102 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1330278376, now seen corresponding path program 295 times [2020-02-10 20:41:50,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:50,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132004681] [2020-02-10 20:41:50,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:50,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132004681] [2020-02-10 20:41:50,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:50,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:50,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835466116] [2020-02-10 20:41:50,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:50,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:50,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:50,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:50,346 INFO L87 Difference]: Start difference. First operand 187 states and 551 transitions. Second operand 8 states. [2020-02-10 20:41:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:50,407 INFO L93 Difference]: Finished difference Result 318 states and 780 transitions. [2020-02-10 20:41:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:50,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:50,408 INFO L225 Difference]: With dead ends: 318 [2020-02-10 20:41:50,408 INFO L226 Difference]: Without dead ends: 302 [2020-02-10 20:41:50,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-02-10 20:41:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 199. [2020-02-10 20:41:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-02-10 20:41:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 577 transitions. [2020-02-10 20:41:50,412 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 577 transitions. Word has length 19 [2020-02-10 20:41:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:50,412 INFO L479 AbstractCegarLoop]: Abstraction has 199 states and 577 transitions. [2020-02-10 20:41:50,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 577 transitions. [2020-02-10 20:41:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:50,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:50,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:50,413 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash -955627190, now seen corresponding path program 296 times [2020-02-10 20:41:50,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:50,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589641505] [2020-02-10 20:41:50,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:50,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589641505] [2020-02-10 20:41:50,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:50,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:50,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787138431] [2020-02-10 20:41:50,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:50,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:50,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:50,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:50,615 INFO L87 Difference]: Start difference. First operand 199 states and 577 transitions. Second operand 8 states. [2020-02-10 20:41:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:50,691 INFO L93 Difference]: Finished difference Result 316 states and 770 transitions. [2020-02-10 20:41:50,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:50,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:50,692 INFO L225 Difference]: With dead ends: 316 [2020-02-10 20:41:50,692 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 20:41:50,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 20:41:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 191. [2020-02-10 20:41:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:41:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 559 transitions. [2020-02-10 20:41:50,697 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 559 transitions. Word has length 19 [2020-02-10 20:41:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:50,698 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 559 transitions. [2020-02-10 20:41:50,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 559 transitions. [2020-02-10 20:41:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:50,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:50,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:50,699 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:50,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash -800081070, now seen corresponding path program 297 times [2020-02-10 20:41:50,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:50,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598214445] [2020-02-10 20:41:50,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:50,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598214445] [2020-02-10 20:41:50,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:50,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:50,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803910301] [2020-02-10 20:41:50,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:50,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:50,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:50,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:50,893 INFO L87 Difference]: Start difference. First operand 191 states and 559 transitions. Second operand 8 states. [2020-02-10 20:41:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:50,964 INFO L93 Difference]: Finished difference Result 301 states and 738 transitions. [2020-02-10 20:41:50,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:50,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:50,965 INFO L225 Difference]: With dead ends: 301 [2020-02-10 20:41:50,965 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 20:41:50,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 20:41:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 194. [2020-02-10 20:41:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-02-10 20:41:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 563 transitions. [2020-02-10 20:41:50,971 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 563 transitions. Word has length 19 [2020-02-10 20:41:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:50,971 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 563 transitions. [2020-02-10 20:41:50,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 563 transitions. [2020-02-10 20:41:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:50,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:50,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:50,972 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:50,972 INFO L82 PathProgramCache]: Analyzing trace with hash -541022844, now seen corresponding path program 298 times [2020-02-10 20:41:50,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:50,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996419026] [2020-02-10 20:41:50,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:51,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996419026] [2020-02-10 20:41:51,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:51,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:51,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797190119] [2020-02-10 20:41:51,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:51,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:51,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:51,165 INFO L87 Difference]: Start difference. First operand 194 states and 563 transitions. Second operand 8 states. [2020-02-10 20:41:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:51,224 INFO L93 Difference]: Finished difference Result 286 states and 714 transitions. [2020-02-10 20:41:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:51,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:51,225 INFO L225 Difference]: With dead ends: 286 [2020-02-10 20:41:51,225 INFO L226 Difference]: Without dead ends: 273 [2020-02-10 20:41:51,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-02-10 20:41:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 191. [2020-02-10 20:41:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:41:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-02-10 20:41:51,229 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-02-10 20:41:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:51,229 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-02-10 20:41:51,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-02-10 20:41:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:51,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:51,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:51,230 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1122224650, now seen corresponding path program 299 times [2020-02-10 20:41:51,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:51,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376665540] [2020-02-10 20:41:51,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:51,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376665540] [2020-02-10 20:41:51,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:51,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:51,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391925265] [2020-02-10 20:41:51,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:51,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:51,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:51,434 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-02-10 20:41:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:51,515 INFO L93 Difference]: Finished difference Result 298 states and 730 transitions. [2020-02-10 20:41:51,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:51,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:51,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:51,516 INFO L225 Difference]: With dead ends: 298 [2020-02-10 20:41:51,517 INFO L226 Difference]: Without dead ends: 284 [2020-02-10 20:41:51,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-02-10 20:41:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 193. [2020-02-10 20:41:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:41:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 559 transitions. [2020-02-10 20:41:51,521 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 559 transitions. Word has length 19 [2020-02-10 20:41:51,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:51,521 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 559 transitions. [2020-02-10 20:41:51,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 559 transitions. [2020-02-10 20:41:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:51,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:51,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:51,522 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash -2052612816, now seen corresponding path program 300 times [2020-02-10 20:41:51,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:51,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268837816] [2020-02-10 20:41:51,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:51,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268837816] [2020-02-10 20:41:51,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:51,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:51,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960620847] [2020-02-10 20:41:51,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:51,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:51,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:51,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:51,716 INFO L87 Difference]: Start difference. First operand 193 states and 559 transitions. Second operand 8 states. [2020-02-10 20:41:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:51,781 INFO L93 Difference]: Finished difference Result 285 states and 710 transitions. [2020-02-10 20:41:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:51,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:51,782 INFO L225 Difference]: With dead ends: 285 [2020-02-10 20:41:51,782 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 20:41:51,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 20:41:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 187. [2020-02-10 20:41:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:41:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 548 transitions. [2020-02-10 20:41:51,787 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 548 transitions. Word has length 19 [2020-02-10 20:41:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:51,787 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 548 transitions. [2020-02-10 20:41:51,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 548 transitions. [2020-02-10 20:41:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:51,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:51,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:51,788 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:51,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1446944266, now seen corresponding path program 301 times [2020-02-10 20:41:51,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:51,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719413563] [2020-02-10 20:41:51,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:51,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719413563] [2020-02-10 20:41:51,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:51,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:51,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641663945] [2020-02-10 20:41:51,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:51,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:51,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:51,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:51,974 INFO L87 Difference]: Start difference. First operand 187 states and 548 transitions. Second operand 8 states. [2020-02-10 20:41:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:52,043 INFO L93 Difference]: Finished difference Result 294 states and 721 transitions. [2020-02-10 20:41:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:52,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:52,045 INFO L225 Difference]: With dead ends: 294 [2020-02-10 20:41:52,045 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 20:41:52,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 20:41:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 192. [2020-02-10 20:41:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:41:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 558 transitions. [2020-02-10 20:41:52,049 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 558 transitions. Word has length 19 [2020-02-10 20:41:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:52,049 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 558 transitions. [2020-02-10 20:41:52,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 558 transitions. [2020-02-10 20:41:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:52,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:52,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:52,050 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:52,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash 696296484, now seen corresponding path program 302 times [2020-02-10 20:41:52,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:52,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023083946] [2020-02-10 20:41:52,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:52,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023083946] [2020-02-10 20:41:52,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:52,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:52,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854788380] [2020-02-10 20:41:52,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:52,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:52,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:52,231 INFO L87 Difference]: Start difference. First operand 192 states and 558 transitions. Second operand 8 states. [2020-02-10 20:41:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:52,319 INFO L93 Difference]: Finished difference Result 288 states and 706 transitions. [2020-02-10 20:41:52,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:52,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:52,320 INFO L225 Difference]: With dead ends: 288 [2020-02-10 20:41:52,320 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 20:41:52,321 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 20:41:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2020-02-10 20:41:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 552 transitions. [2020-02-10 20:41:52,325 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 552 transitions. Word has length 19 [2020-02-10 20:41:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:52,326 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 552 transitions. [2020-02-10 20:41:52,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 552 transitions. [2020-02-10 20:41:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:52,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:52,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:52,326 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:52,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1247585176, now seen corresponding path program 303 times [2020-02-10 20:41:52,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:52,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64501205] [2020-02-10 20:41:52,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:52,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64501205] [2020-02-10 20:41:52,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:52,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:52,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024055608] [2020-02-10 20:41:52,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:52,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:52,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:52,516 INFO L87 Difference]: Start difference. First operand 189 states and 552 transitions. Second operand 8 states. [2020-02-10 20:41:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:52,583 INFO L93 Difference]: Finished difference Result 283 states and 697 transitions. [2020-02-10 20:41:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:52,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:52,584 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:41:52,584 INFO L226 Difference]: Without dead ends: 267 [2020-02-10 20:41:52,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-02-10 20:41:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 192. [2020-02-10 20:41:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:41:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-02-10 20:41:52,588 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-02-10 20:41:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:52,588 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-02-10 20:41:52,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-02-10 20:41:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:52,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:52,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:52,589 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:52,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1506643402, now seen corresponding path program 304 times [2020-02-10 20:41:52,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:52,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661666796] [2020-02-10 20:41:52,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:52,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661666796] [2020-02-10 20:41:52,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:52,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:52,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929991541] [2020-02-10 20:41:52,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:52,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:52,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:52,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:52,806 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-02-10 20:41:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:52,863 INFO L93 Difference]: Finished difference Result 268 states and 673 transitions. [2020-02-10 20:41:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:52,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:52,864 INFO L225 Difference]: With dead ends: 268 [2020-02-10 20:41:52,865 INFO L226 Difference]: Without dead ends: 255 [2020-02-10 20:41:52,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-02-10 20:41:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 189. [2020-02-10 20:41:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-02-10 20:41:52,869 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-02-10 20:41:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:52,870 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-02-10 20:41:52,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-02-10 20:41:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:52,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:52,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:52,870 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash 266205080, now seen corresponding path program 305 times [2020-02-10 20:41:52,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:52,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168389825] [2020-02-10 20:41:52,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:53,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168389825] [2020-02-10 20:41:53,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:53,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:53,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704576640] [2020-02-10 20:41:53,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:53,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:53,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:53,072 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-02-10 20:41:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:53,145 INFO L93 Difference]: Finished difference Result 266 states and 669 transitions. [2020-02-10 20:41:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:53,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:53,146 INFO L225 Difference]: With dead ends: 266 [2020-02-10 20:41:53,146 INFO L226 Difference]: Without dead ends: 256 [2020-02-10 20:41:53,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-02-10 20:41:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 190. [2020-02-10 20:41:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-02-10 20:41:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 551 transitions. [2020-02-10 20:41:53,152 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 551 transitions. Word has length 19 [2020-02-10 20:41:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:53,152 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 551 transitions. [2020-02-10 20:41:53,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 551 transitions. [2020-02-10 20:41:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:53,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:53,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:53,153 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:53,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:53,154 INFO L82 PathProgramCache]: Analyzing trace with hash 26562742, now seen corresponding path program 306 times [2020-02-10 20:41:53,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:53,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884510907] [2020-02-10 20:41:53,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:53,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884510907] [2020-02-10 20:41:53,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:53,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:53,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452487626] [2020-02-10 20:41:53,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:53,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:53,385 INFO L87 Difference]: Start difference. First operand 190 states and 551 transitions. Second operand 8 states. [2020-02-10 20:41:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:53,441 INFO L93 Difference]: Finished difference Result 255 states and 656 transitions. [2020-02-10 20:41:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:53,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:53,442 INFO L225 Difference]: With dead ends: 255 [2020-02-10 20:41:53,442 INFO L226 Difference]: Without dead ends: 242 [2020-02-10 20:41:53,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-02-10 20:41:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 187. [2020-02-10 20:41:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:41:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 546 transitions. [2020-02-10 20:41:53,448 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 546 transitions. Word has length 19 [2020-02-10 20:41:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:53,448 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 546 transitions. [2020-02-10 20:41:53,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 546 transitions. [2020-02-10 20:41:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:53,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:53,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:53,448 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:53,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1887873640, now seen corresponding path program 307 times [2020-02-10 20:41:53,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:53,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471594746] [2020-02-10 20:41:53,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:53,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:53,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471594746] [2020-02-10 20:41:53,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:53,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:53,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385488094] [2020-02-10 20:41:53,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:53,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:53,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:53,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:53,633 INFO L87 Difference]: Start difference. First operand 187 states and 546 transitions. Second operand 8 states. [2020-02-10 20:41:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:53,709 INFO L93 Difference]: Finished difference Result 287 states and 706 transitions. [2020-02-10 20:41:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:53,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:53,710 INFO L225 Difference]: With dead ends: 287 [2020-02-10 20:41:53,710 INFO L226 Difference]: Without dead ends: 273 [2020-02-10 20:41:53,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-02-10 20:41:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 190. [2020-02-10 20:41:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-02-10 20:41:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 552 transitions. [2020-02-10 20:41:53,715 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 552 transitions. Word has length 19 [2020-02-10 20:41:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:53,716 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 552 transitions. [2020-02-10 20:41:53,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 552 transitions. [2020-02-10 20:41:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:53,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:53,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:53,716 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:53,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1013538314, now seen corresponding path program 308 times [2020-02-10 20:41:53,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:53,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954925516] [2020-02-10 20:41:53,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:53,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954925516] [2020-02-10 20:41:53,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:53,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:53,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756892486] [2020-02-10 20:41:53,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:53,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:53,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:53,902 INFO L87 Difference]: Start difference. First operand 190 states and 552 transitions. Second operand 8 states. [2020-02-10 20:41:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:53,985 INFO L93 Difference]: Finished difference Result 283 states and 695 transitions. [2020-02-10 20:41:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:53,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:53,986 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:41:53,986 INFO L226 Difference]: Without dead ends: 271 [2020-02-10 20:41:53,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-02-10 20:41:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 188. [2020-02-10 20:41:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:41:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 548 transitions. [2020-02-10 20:41:53,991 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 548 transitions. Word has length 19 [2020-02-10 20:41:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:53,991 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 548 transitions. [2020-02-10 20:41:53,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 548 transitions. [2020-02-10 20:41:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:53,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:53,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:53,992 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1246071542, now seen corresponding path program 309 times [2020-02-10 20:41:53,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:53,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650903588] [2020-02-10 20:41:53,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:54,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650903588] [2020-02-10 20:41:54,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:54,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:54,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088072851] [2020-02-10 20:41:54,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:54,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:54,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:54,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:54,176 INFO L87 Difference]: Start difference. First operand 188 states and 548 transitions. Second operand 8 states. [2020-02-10 20:41:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:54,249 INFO L93 Difference]: Finished difference Result 279 states and 688 transitions. [2020-02-10 20:41:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:54,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:54,251 INFO L225 Difference]: With dead ends: 279 [2020-02-10 20:41:54,251 INFO L226 Difference]: Without dead ends: 265 [2020-02-10 20:41:54,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-02-10 20:41:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 190. [2020-02-10 20:41:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-02-10 20:41:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 551 transitions. [2020-02-10 20:41:54,256 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 551 transitions. Word has length 19 [2020-02-10 20:41:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:54,256 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 551 transitions. [2020-02-10 20:41:54,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 551 transitions. [2020-02-10 20:41:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:54,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:54,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:54,256 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:54,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:54,257 INFO L82 PathProgramCache]: Analyzing trace with hash -125941712, now seen corresponding path program 310 times [2020-02-10 20:41:54,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:54,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075377190] [2020-02-10 20:41:54,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:54,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075377190] [2020-02-10 20:41:54,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:54,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:54,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824153595] [2020-02-10 20:41:54,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:54,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:54,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:54,452 INFO L87 Difference]: Start difference. First operand 190 states and 551 transitions. Second operand 8 states. [2020-02-10 20:41:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:54,509 INFO L93 Difference]: Finished difference Result 266 states and 668 transitions. [2020-02-10 20:41:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:54,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:54,510 INFO L225 Difference]: With dead ends: 266 [2020-02-10 20:41:54,510 INFO L226 Difference]: Without dead ends: 254 [2020-02-10 20:41:54,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-02-10 20:41:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 188. [2020-02-10 20:41:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:41:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 547 transitions. [2020-02-10 20:41:54,515 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 547 transitions. Word has length 19 [2020-02-10 20:41:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:54,515 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 547 transitions. [2020-02-10 20:41:54,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 547 transitions. [2020-02-10 20:41:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:54,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:54,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:54,516 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash 651556204, now seen corresponding path program 311 times [2020-02-10 20:41:54,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:54,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618316] [2020-02-10 20:41:54,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:54,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618316] [2020-02-10 20:41:54,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:54,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:54,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195969525] [2020-02-10 20:41:54,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:54,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:54,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:54,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:54,714 INFO L87 Difference]: Start difference. First operand 188 states and 547 transitions. Second operand 8 states. [2020-02-10 20:41:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:54,796 INFO L93 Difference]: Finished difference Result 265 states and 666 transitions. [2020-02-10 20:41:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:54,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:54,797 INFO L225 Difference]: With dead ends: 265 [2020-02-10 20:41:54,797 INFO L226 Difference]: Without dead ends: 255 [2020-02-10 20:41:54,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-02-10 20:41:54,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 189. [2020-02-10 20:41:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 548 transitions. [2020-02-10 20:41:54,801 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 548 transitions. Word has length 19 [2020-02-10 20:41:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:54,801 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 548 transitions. [2020-02-10 20:41:54,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 548 transitions. [2020-02-10 20:41:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:54,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:54,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:54,802 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:54,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash 411913866, now seen corresponding path program 312 times [2020-02-10 20:41:54,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:54,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237175765] [2020-02-10 20:41:54,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:55,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237175765] [2020-02-10 20:41:55,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:55,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:55,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406580679] [2020-02-10 20:41:55,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:55,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:55,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:55,009 INFO L87 Difference]: Start difference. First operand 189 states and 548 transitions. Second operand 8 states. [2020-02-10 20:41:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:55,078 INFO L93 Difference]: Finished difference Result 254 states and 653 transitions. [2020-02-10 20:41:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:55,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:55,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:55,079 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:41:55,079 INFO L226 Difference]: Without dead ends: 239 [2020-02-10 20:41:55,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-02-10 20:41:55,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 184. [2020-02-10 20:41:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:41:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 540 transitions. [2020-02-10 20:41:55,083 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 540 transitions. Word has length 19 [2020-02-10 20:41:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:55,083 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 540 transitions. [2020-02-10 20:41:55,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 540 transitions. [2020-02-10 20:41:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:55,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:55,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:55,083 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:55,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2756816, now seen corresponding path program 313 times [2020-02-10 20:41:55,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:55,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595567744] [2020-02-10 20:41:55,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:55,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595567744] [2020-02-10 20:41:55,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:55,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:55,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865903842] [2020-02-10 20:41:55,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:55,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:55,272 INFO L87 Difference]: Start difference. First operand 184 states and 540 transitions. Second operand 8 states. [2020-02-10 20:41:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:55,351 INFO L93 Difference]: Finished difference Result 315 states and 778 transitions. [2020-02-10 20:41:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:55,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:55,351 INFO L225 Difference]: With dead ends: 315 [2020-02-10 20:41:55,351 INFO L226 Difference]: Without dead ends: 299 [2020-02-10 20:41:55,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-02-10 20:41:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2020-02-10 20:41:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:41:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 558 transitions. [2020-02-10 20:41:55,356 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 558 transitions. Word has length 19 [2020-02-10 20:41:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:55,357 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 558 transitions. [2020-02-10 20:41:55,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 558 transitions. [2020-02-10 20:41:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:55,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:55,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:55,357 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:55,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:55,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2140483934, now seen corresponding path program 314 times [2020-02-10 20:41:55,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:55,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73040639] [2020-02-10 20:41:55,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:55,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73040639] [2020-02-10 20:41:55,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:55,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:55,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311645827] [2020-02-10 20:41:55,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:55,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:55,543 INFO L87 Difference]: Start difference. First operand 191 states and 558 transitions. Second operand 8 states. [2020-02-10 20:41:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:55,632 INFO L93 Difference]: Finished difference Result 309 states and 763 transitions. [2020-02-10 20:41:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:55,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:55,634 INFO L225 Difference]: With dead ends: 309 [2020-02-10 20:41:55,634 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 20:41:55,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 20:41:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2020-02-10 20:41:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:41:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 552 transitions. [2020-02-10 20:41:55,638 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 552 transitions. Word has length 19 [2020-02-10 20:41:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:55,638 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 552 transitions. [2020-02-10 20:41:55,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 552 transitions. [2020-02-10 20:41:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:55,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:55,639 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:55,639 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1603194670, now seen corresponding path program 315 times [2020-02-10 20:41:55,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:55,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540599768] [2020-02-10 20:41:55,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:55,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540599768] [2020-02-10 20:41:55,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:55,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:55,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817563574] [2020-02-10 20:41:55,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:55,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:55,838 INFO L87 Difference]: Start difference. First operand 188 states and 552 transitions. Second operand 8 states. [2020-02-10 20:41:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:55,900 INFO L93 Difference]: Finished difference Result 315 states and 776 transitions. [2020-02-10 20:41:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:55,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:55,901 INFO L225 Difference]: With dead ends: 315 [2020-02-10 20:41:55,901 INFO L226 Difference]: Without dead ends: 299 [2020-02-10 20:41:55,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-02-10 20:41:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2020-02-10 20:41:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:41:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-02-10 20:41:55,906 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-02-10 20:41:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:55,906 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-02-10 20:41:55,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-02-10 20:41:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:55,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:55,907 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:55,907 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1344136444, now seen corresponding path program 316 times [2020-02-10 20:41:55,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:55,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086187318] [2020-02-10 20:41:55,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:56,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086187318] [2020-02-10 20:41:56,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:56,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:56,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480342832] [2020-02-10 20:41:56,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:56,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:56,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:56,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:56,096 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-02-10 20:41:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:56,162 INFO L93 Difference]: Finished difference Result 309 states and 761 transitions. [2020-02-10 20:41:56,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:56,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:56,163 INFO L225 Difference]: With dead ends: 309 [2020-02-10 20:41:56,163 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 20:41:56,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 20:41:56,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2020-02-10 20:41:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:41:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 550 transitions. [2020-02-10 20:41:56,167 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 550 transitions. Word has length 19 [2020-02-10 20:41:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:56,168 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 550 transitions. [2020-02-10 20:41:56,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 550 transitions. [2020-02-10 20:41:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:56,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:56,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:56,168 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1710392530, now seen corresponding path program 317 times [2020-02-10 20:41:56,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:56,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231045899] [2020-02-10 20:41:56,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:56,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231045899] [2020-02-10 20:41:56,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:56,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:56,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176669352] [2020-02-10 20:41:56,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:56,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:56,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:56,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:56,363 INFO L87 Difference]: Start difference. First operand 188 states and 550 transitions. Second operand 8 states. [2020-02-10 20:41:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:56,454 INFO L93 Difference]: Finished difference Result 301 states and 745 transitions. [2020-02-10 20:41:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:56,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:56,455 INFO L225 Difference]: With dead ends: 301 [2020-02-10 20:41:56,455 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:41:56,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:41:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 189. [2020-02-10 20:41:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-02-10 20:41:56,461 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-02-10 20:41:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:56,461 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-02-10 20:41:56,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-02-10 20:41:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:56,462 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:56,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:56,462 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:56,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1470750192, now seen corresponding path program 318 times [2020-02-10 20:41:56,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:56,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597761051] [2020-02-10 20:41:56,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:56,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597761051] [2020-02-10 20:41:56,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:56,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:56,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766447967] [2020-02-10 20:41:56,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:56,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:56,666 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-02-10 20:41:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:56,732 INFO L93 Difference]: Finished difference Result 301 states and 744 transitions. [2020-02-10 20:41:56,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:56,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:56,733 INFO L225 Difference]: With dead ends: 301 [2020-02-10 20:41:56,734 INFO L226 Difference]: Without dead ends: 288 [2020-02-10 20:41:56,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-02-10 20:41:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 186. [2020-02-10 20:41:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:41:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 546 transitions. [2020-02-10 20:41:56,738 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 546 transitions. Word has length 19 [2020-02-10 20:41:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:56,738 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 546 transitions. [2020-02-10 20:41:56,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 546 transitions. [2020-02-10 20:41:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:56,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:56,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:56,739 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:56,739 INFO L82 PathProgramCache]: Analyzing trace with hash -445655956, now seen corresponding path program 319 times [2020-02-10 20:41:56,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:56,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380867185] [2020-02-10 20:41:56,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:56,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380867185] [2020-02-10 20:41:56,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:56,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:56,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292301213] [2020-02-10 20:41:56,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:56,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:56,917 INFO L87 Difference]: Start difference. First operand 186 states and 546 transitions. Second operand 8 states. [2020-02-10 20:41:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:56,977 INFO L93 Difference]: Finished difference Result 314 states and 773 transitions. [2020-02-10 20:41:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:56,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:56,978 INFO L225 Difference]: With dead ends: 314 [2020-02-10 20:41:56,978 INFO L226 Difference]: Without dead ends: 298 [2020-02-10 20:41:56,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-02-10 20:41:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 192. [2020-02-10 20:41:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:41:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 560 transitions. [2020-02-10 20:41:56,983 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 560 transitions. Word has length 19 [2020-02-10 20:41:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:56,983 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 560 transitions. [2020-02-10 20:41:56,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 560 transitions. [2020-02-10 20:41:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:56,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:56,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:56,983 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:56,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:56,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1697584794, now seen corresponding path program 320 times [2020-02-10 20:41:56,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:56,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128122581] [2020-02-10 20:41:56,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:57,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128122581] [2020-02-10 20:41:57,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:57,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:57,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909502116] [2020-02-10 20:41:57,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:57,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:57,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:57,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:57,152 INFO L87 Difference]: Start difference. First operand 192 states and 560 transitions. Second operand 8 states. [2020-02-10 20:41:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:57,244 INFO L93 Difference]: Finished difference Result 308 states and 758 transitions. [2020-02-10 20:41:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:57,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:57,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:57,245 INFO L225 Difference]: With dead ends: 308 [2020-02-10 20:41:57,245 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:41:57,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:41:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2020-02-10 20:41:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 553 transitions. [2020-02-10 20:41:57,250 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 553 transitions. Word has length 19 [2020-02-10 20:41:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:57,250 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 553 transitions. [2020-02-10 20:41:57,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 553 transitions. [2020-02-10 20:41:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:57,250 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:57,250 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:57,251 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:57,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:57,251 INFO L82 PathProgramCache]: Analyzing trace with hash -952002222, now seen corresponding path program 321 times [2020-02-10 20:41:57,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:57,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450378944] [2020-02-10 20:41:57,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:57,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450378944] [2020-02-10 20:41:57,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:57,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:57,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023860212] [2020-02-10 20:41:57,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:57,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:57,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:57,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:57,436 INFO L87 Difference]: Start difference. First operand 189 states and 553 transitions. Second operand 8 states. [2020-02-10 20:41:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:57,511 INFO L93 Difference]: Finished difference Result 320 states and 787 transitions. [2020-02-10 20:41:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:57,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:57,512 INFO L225 Difference]: With dead ends: 320 [2020-02-10 20:41:57,512 INFO L226 Difference]: Without dead ends: 304 [2020-02-10 20:41:57,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-02-10 20:41:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 195. [2020-02-10 20:41:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 20:41:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2020-02-10 20:41:57,516 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 19 [2020-02-10 20:41:57,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:57,517 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2020-02-10 20:41:57,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2020-02-10 20:41:57,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:57,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:57,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:57,517 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:57,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1928206972, now seen corresponding path program 322 times [2020-02-10 20:41:57,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:57,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752623004] [2020-02-10 20:41:57,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:57,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752623004] [2020-02-10 20:41:57,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:57,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:57,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980366275] [2020-02-10 20:41:57,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:57,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:57,693 INFO L87 Difference]: Start difference. First operand 195 states and 564 transitions. Second operand 8 states. [2020-02-10 20:41:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:57,787 INFO L93 Difference]: Finished difference Result 317 states and 776 transitions. [2020-02-10 20:41:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:57,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:57,789 INFO L225 Difference]: With dead ends: 317 [2020-02-10 20:41:57,789 INFO L226 Difference]: Without dead ends: 298 [2020-02-10 20:41:57,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-02-10 20:41:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 189. [2020-02-10 20:41:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-02-10 20:41:57,794 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-02-10 20:41:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:57,794 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-02-10 20:41:57,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-02-10 20:41:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:57,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:57,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:57,794 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1813226296, now seen corresponding path program 323 times [2020-02-10 20:41:57,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:57,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464898687] [2020-02-10 20:41:57,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:57,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464898687] [2020-02-10 20:41:57,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:57,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:57,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492612689] [2020-02-10 20:41:57,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:57,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:57,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:57,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:57,969 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-02-10 20:41:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:58,054 INFO L93 Difference]: Finished difference Result 304 states and 748 transitions. [2020-02-10 20:41:58,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:58,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:58,055 INFO L225 Difference]: With dead ends: 304 [2020-02-10 20:41:58,055 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 20:41:58,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 20:41:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 191. [2020-02-10 20:41:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:41:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 553 transitions. [2020-02-10 20:41:58,061 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 553 transitions. Word has length 19 [2020-02-10 20:41:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:58,061 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 553 transitions. [2020-02-10 20:41:58,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 553 transitions. [2020-02-10 20:41:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:58,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:58,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:58,061 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash 84178962, now seen corresponding path program 324 times [2020-02-10 20:41:58,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:58,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80610806] [2020-02-10 20:41:58,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:58,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80610806] [2020-02-10 20:41:58,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:58,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:58,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98569109] [2020-02-10 20:41:58,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:58,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:58,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:58,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:58,234 INFO L87 Difference]: Start difference. First operand 191 states and 553 transitions. Second operand 8 states. [2020-02-10 20:41:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:58,321 INFO L93 Difference]: Finished difference Result 307 states and 753 transitions. [2020-02-10 20:41:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:58,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:58,322 INFO L225 Difference]: With dead ends: 307 [2020-02-10 20:41:58,322 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 20:41:58,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 20:41:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 186. [2020-02-10 20:41:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:41:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 544 transitions. [2020-02-10 20:41:58,327 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 544 transitions. Word has length 19 [2020-02-10 20:41:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:58,327 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 544 transitions. [2020-02-10 20:41:58,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 544 transitions. [2020-02-10 20:41:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:58,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:58,328 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:58,328 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:58,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:58,328 INFO L82 PathProgramCache]: Analyzing trace with hash -120059732, now seen corresponding path program 325 times [2020-02-10 20:41:58,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:58,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897628277] [2020-02-10 20:41:58,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:58,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897628277] [2020-02-10 20:41:58,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:58,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:58,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335665922] [2020-02-10 20:41:58,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:58,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:58,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:58,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:58,522 INFO L87 Difference]: Start difference. First operand 186 states and 544 transitions. Second operand 8 states. [2020-02-10 20:41:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:58,582 INFO L93 Difference]: Finished difference Result 311 states and 761 transitions. [2020-02-10 20:41:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:58,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:58,583 INFO L225 Difference]: With dead ends: 311 [2020-02-10 20:41:58,583 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:41:58,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:41:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 192. [2020-02-10 20:41:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:41:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 558 transitions. [2020-02-10 20:41:58,588 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 558 transitions. Word has length 19 [2020-02-10 20:41:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:58,588 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 558 transitions. [2020-02-10 20:41:58,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 558 transitions. [2020-02-10 20:41:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:58,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:58,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:58,588 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:58,589 INFO L82 PathProgramCache]: Analyzing trace with hash 138998494, now seen corresponding path program 326 times [2020-02-10 20:41:58,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:58,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299811767] [2020-02-10 20:41:58,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:58,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299811767] [2020-02-10 20:41:58,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:58,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:58,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056528197] [2020-02-10 20:41:58,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:58,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:58,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:58,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:58,794 INFO L87 Difference]: Start difference. First operand 192 states and 558 transitions. Second operand 8 states. [2020-02-10 20:41:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:58,860 INFO L93 Difference]: Finished difference Result 305 states and 746 transitions. [2020-02-10 20:41:58,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:58,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:58,861 INFO L225 Difference]: With dead ends: 305 [2020-02-10 20:41:58,861 INFO L226 Difference]: Without dead ends: 292 [2020-02-10 20:41:58,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-02-10 20:41:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 189. [2020-02-10 20:41:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-02-10 20:41:58,865 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-02-10 20:41:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:58,865 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-02-10 20:41:58,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-02-10 20:41:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:58,866 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:58,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:58,866 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:58,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash 974031856, now seen corresponding path program 327 times [2020-02-10 20:41:58,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:58,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457017519] [2020-02-10 20:41:58,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:59,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457017519] [2020-02-10 20:41:59,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:59,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:59,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855636732] [2020-02-10 20:41:59,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:59,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:59,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:59,058 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-02-10 20:41:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:59,131 INFO L93 Difference]: Finished difference Result 311 states and 758 transitions. [2020-02-10 20:41:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:59,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:59,132 INFO L225 Difference]: With dead ends: 311 [2020-02-10 20:41:59,132 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:41:59,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:41:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 195. [2020-02-10 20:41:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 20:41:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 562 transitions. [2020-02-10 20:41:59,136 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 562 transitions. Word has length 19 [2020-02-10 20:41:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:59,136 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 562 transitions. [2020-02-10 20:41:59,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 562 transitions. [2020-02-10 20:41:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:59,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:59,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:59,137 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:59,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2172894, now seen corresponding path program 328 times [2020-02-10 20:41:59,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:59,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753288193] [2020-02-10 20:41:59,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:59,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753288193] [2020-02-10 20:41:59,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:59,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:59,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270991022] [2020-02-10 20:41:59,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:59,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:59,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:59,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:59,321 INFO L87 Difference]: Start difference. First operand 195 states and 562 transitions. Second operand 8 states. [2020-02-10 20:41:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:59,409 INFO L93 Difference]: Finished difference Result 308 states and 747 transitions. [2020-02-10 20:41:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:59,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:59,410 INFO L225 Difference]: With dead ends: 308 [2020-02-10 20:41:59,410 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 20:41:59,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 20:41:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 189. [2020-02-10 20:41:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:41:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 548 transitions. [2020-02-10 20:41:59,414 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 548 transitions. Word has length 19 [2020-02-10 20:41:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:59,415 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 548 transitions. [2020-02-10 20:41:59,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 548 transitions. [2020-02-10 20:41:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:59,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:59,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:59,415 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:59,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1309572854, now seen corresponding path program 329 times [2020-02-10 20:41:59,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:59,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142435276] [2020-02-10 20:41:59,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:59,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142435276] [2020-02-10 20:41:59,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:59,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:59,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551021020] [2020-02-10 20:41:59,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:59,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:59,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:59,605 INFO L87 Difference]: Start difference. First operand 189 states and 548 transitions. Second operand 8 states. [2020-02-10 20:41:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:59,676 INFO L93 Difference]: Finished difference Result 295 states and 719 transitions. [2020-02-10 20:41:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:59,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:59,677 INFO L225 Difference]: With dead ends: 295 [2020-02-10 20:41:59,677 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 20:41:59,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:59,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 20:41:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 191. [2020-02-10 20:41:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:41:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 551 transitions. [2020-02-10 20:41:59,682 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 551 transitions. Word has length 19 [2020-02-10 20:41:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:59,682 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 551 transitions. [2020-02-10 20:41:59,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 551 transitions. [2020-02-10 20:41:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:59,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:59,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:59,683 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash 179832142, now seen corresponding path program 330 times [2020-02-10 20:41:59,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:59,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13578218] [2020-02-10 20:41:59,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:59,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13578218] [2020-02-10 20:41:59,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:59,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:41:59,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764951258] [2020-02-10 20:41:59,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:41:59,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:59,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:41:59,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:41:59,869 INFO L87 Difference]: Start difference. First operand 191 states and 551 transitions. Second operand 8 states. [2020-02-10 20:41:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:59,952 INFO L93 Difference]: Finished difference Result 293 states and 714 transitions. [2020-02-10 20:41:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:41:59,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:41:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:59,953 INFO L225 Difference]: With dead ends: 293 [2020-02-10 20:41:59,954 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 20:41:59,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:41:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 20:41:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2020-02-10 20:41:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:41:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 542 transitions. [2020-02-10 20:41:59,958 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 542 transitions. Word has length 19 [2020-02-10 20:41:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:59,959 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 542 transitions. [2020-02-10 20:41:59,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:41:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 542 transitions. [2020-02-10 20:41:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:41:59,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:59,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:59,959 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash -245646298, now seen corresponding path program 331 times [2020-02-10 20:41:59,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:59,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805513135] [2020-02-10 20:41:59,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:00,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805513135] [2020-02-10 20:42:00,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:00,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:00,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195392922] [2020-02-10 20:42:00,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:00,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:00,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:00,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:00,150 INFO L87 Difference]: Start difference. First operand 186 states and 542 transitions. Second operand 8 states. [2020-02-10 20:42:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:00,236 INFO L93 Difference]: Finished difference Result 283 states and 694 transitions. [2020-02-10 20:42:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:00,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:00,237 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:42:00,237 INFO L226 Difference]: Without dead ends: 273 [2020-02-10 20:42:00,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-02-10 20:42:00,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 188. [2020-02-10 20:42:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:42:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 546 transitions. [2020-02-10 20:42:00,242 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 546 transitions. Word has length 19 [2020-02-10 20:42:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:00,242 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 546 transitions. [2020-02-10 20:42:00,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 546 transitions. [2020-02-10 20:42:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:00,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:00,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:00,243 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:00,243 INFO L82 PathProgramCache]: Analyzing trace with hash -485288636, now seen corresponding path program 332 times [2020-02-10 20:42:00,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:00,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487051900] [2020-02-10 20:42:00,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:00,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487051900] [2020-02-10 20:42:00,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:00,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:00,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391223560] [2020-02-10 20:42:00,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:00,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:00,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:00,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:00,444 INFO L87 Difference]: Start difference. First operand 188 states and 546 transitions. Second operand 8 states. [2020-02-10 20:42:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:00,504 INFO L93 Difference]: Finished difference Result 283 states and 693 transitions. [2020-02-10 20:42:00,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:00,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:00,505 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:42:00,505 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 20:42:00,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 20:42:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 187. [2020-02-10 20:42:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-02-10 20:42:00,509 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-02-10 20:42:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:00,509 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-02-10 20:42:00,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-02-10 20:42:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:00,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:00,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:00,510 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:00,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1318731678, now seen corresponding path program 333 times [2020-02-10 20:42:00,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:00,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373677262] [2020-02-10 20:42:00,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:00,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373677262] [2020-02-10 20:42:00,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:00,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:00,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072953752] [2020-02-10 20:42:00,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:00,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:00,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:00,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:00,698 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-02-10 20:42:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:00,784 INFO L93 Difference]: Finished difference Result 280 states and 688 transitions. [2020-02-10 20:42:00,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:00,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:00,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:00,785 INFO L225 Difference]: With dead ends: 280 [2020-02-10 20:42:00,785 INFO L226 Difference]: Without dead ends: 270 [2020-02-10 20:42:00,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-02-10 20:42:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 189. [2020-02-10 20:42:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:42:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 547 transitions. [2020-02-10 20:42:00,790 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 547 transitions. Word has length 19 [2020-02-10 20:42:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:00,790 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 547 transitions. [2020-02-10 20:42:00,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 547 transitions. [2020-02-10 20:42:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:00,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:00,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:00,791 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:00,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:00,791 INFO L82 PathProgramCache]: Analyzing trace with hash -363752674, now seen corresponding path program 334 times [2020-02-10 20:42:00,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:00,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676798318] [2020-02-10 20:42:00,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:00,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676798318] [2020-02-10 20:42:00,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:00,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:00,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500695571] [2020-02-10 20:42:00,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:00,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:00,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:00,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:00,977 INFO L87 Difference]: Start difference. First operand 189 states and 547 transitions. Second operand 8 states. [2020-02-10 20:42:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:01,059 INFO L93 Difference]: Finished difference Result 283 states and 693 transitions. [2020-02-10 20:42:01,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:01,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:01,060 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:42:01,060 INFO L226 Difference]: Without dead ends: 268 [2020-02-10 20:42:01,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:01,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-02-10 20:42:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 187. [2020-02-10 20:42:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-02-10 20:42:01,064 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-02-10 20:42:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:01,064 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-02-10 20:42:01,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-02-10 20:42:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:01,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:01,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:01,065 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash 52566942, now seen corresponding path program 335 times [2020-02-10 20:42:01,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:01,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998190889] [2020-02-10 20:42:01,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:01,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998190889] [2020-02-10 20:42:01,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:01,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:01,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120932201] [2020-02-10 20:42:01,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:01,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:01,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:01,257 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-02-10 20:42:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:01,329 INFO L93 Difference]: Finished difference Result 278 states and 682 transitions. [2020-02-10 20:42:01,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:01,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:01,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:01,330 INFO L225 Difference]: With dead ends: 278 [2020-02-10 20:42:01,330 INFO L226 Difference]: Without dead ends: 268 [2020-02-10 20:42:01,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-02-10 20:42:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 189. [2020-02-10 20:42:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:42:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 546 transitions. [2020-02-10 20:42:01,335 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 546 transitions. Word has length 19 [2020-02-10 20:42:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:01,335 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 546 transitions. [2020-02-10 20:42:01,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 546 transitions. [2020-02-10 20:42:01,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:01,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:01,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:01,336 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1541971938, now seen corresponding path program 336 times [2020-02-10 20:42:01,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:01,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465140933] [2020-02-10 20:42:01,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:01,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465140933] [2020-02-10 20:42:01,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:01,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:01,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792610614] [2020-02-10 20:42:01,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:01,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:01,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:01,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:01,531 INFO L87 Difference]: Start difference. First operand 189 states and 546 transitions. Second operand 8 states. [2020-02-10 20:42:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:01,616 INFO L93 Difference]: Finished difference Result 276 states and 677 transitions. [2020-02-10 20:42:01,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:01,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:01,617 INFO L225 Difference]: With dead ends: 276 [2020-02-10 20:42:01,617 INFO L226 Difference]: Without dead ends: 258 [2020-02-10 20:42:01,617 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:01,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-02-10 20:42:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 184. [2020-02-10 20:42:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:42:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 538 transitions. [2020-02-10 20:42:01,622 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 538 transitions. Word has length 19 [2020-02-10 20:42:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:01,622 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 538 transitions. [2020-02-10 20:42:01,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 538 transitions. [2020-02-10 20:42:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:01,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:01,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:01,622 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:01,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1064346626, now seen corresponding path program 337 times [2020-02-10 20:42:01,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:01,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119040161] [2020-02-10 20:42:01,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:01,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119040161] [2020-02-10 20:42:01,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:01,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:01,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118235530] [2020-02-10 20:42:01,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:01,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:01,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:01,799 INFO L87 Difference]: Start difference. First operand 184 states and 538 transitions. Second operand 8 states. [2020-02-10 20:42:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:01,890 INFO L93 Difference]: Finished difference Result 296 states and 736 transitions. [2020-02-10 20:42:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:01,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:01,892 INFO L225 Difference]: With dead ends: 296 [2020-02-10 20:42:01,892 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:42:01,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:01,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:42:01,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 188. [2020-02-10 20:42:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:42:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 548 transitions. [2020-02-10 20:42:01,896 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 548 transitions. Word has length 19 [2020-02-10 20:42:01,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:01,896 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 548 transitions. [2020-02-10 20:42:01,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 548 transitions. [2020-02-10 20:42:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:01,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:01,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:01,897 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:01,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:01,897 INFO L82 PathProgramCache]: Analyzing trace with hash 190011300, now seen corresponding path program 338 times [2020-02-10 20:42:01,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:01,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984857529] [2020-02-10 20:42:01,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:02,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984857529] [2020-02-10 20:42:02,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:02,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:02,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271580439] [2020-02-10 20:42:02,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:02,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:02,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:02,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:02,093 INFO L87 Difference]: Start difference. First operand 188 states and 548 transitions. Second operand 8 states. [2020-02-10 20:42:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:02,174 INFO L93 Difference]: Finished difference Result 292 states and 725 transitions. [2020-02-10 20:42:02,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:02,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:02,175 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:42:02,175 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 20:42:02,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 20:42:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 186. [2020-02-10 20:42:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:42:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 544 transitions. [2020-02-10 20:42:02,180 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 544 transitions. Word has length 19 [2020-02-10 20:42:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:02,181 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 544 transitions. [2020-02-10 20:42:02,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 544 transitions. [2020-02-10 20:42:02,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:02,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:02,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:02,181 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:02,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2069598556, now seen corresponding path program 339 times [2020-02-10 20:42:02,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:02,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905648598] [2020-02-10 20:42:02,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:02,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905648598] [2020-02-10 20:42:02,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:02,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:02,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711395181] [2020-02-10 20:42:02,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:02,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:02,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:02,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:02,368 INFO L87 Difference]: Start difference. First operand 186 states and 544 transitions. Second operand 8 states. [2020-02-10 20:42:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:02,445 INFO L93 Difference]: Finished difference Result 296 states and 735 transitions. [2020-02-10 20:42:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:02,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:02,446 INFO L225 Difference]: With dead ends: 296 [2020-02-10 20:42:02,446 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:42:02,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:42:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 188. [2020-02-10 20:42:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:42:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 547 transitions. [2020-02-10 20:42:02,451 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 547 transitions. Word has length 19 [2020-02-10 20:42:02,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:02,451 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 547 transitions. [2020-02-10 20:42:02,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 547 transitions. [2020-02-10 20:42:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:02,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:02,451 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:02,451 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:02,452 INFO L82 PathProgramCache]: Analyzing trace with hash -949468726, now seen corresponding path program 340 times [2020-02-10 20:42:02,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:02,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242644640] [2020-02-10 20:42:02,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:02,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242644640] [2020-02-10 20:42:02,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:02,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:02,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903083897] [2020-02-10 20:42:02,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:02,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:02,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:02,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:02,633 INFO L87 Difference]: Start difference. First operand 188 states and 547 transitions. Second operand 8 states. [2020-02-10 20:42:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:02,697 INFO L93 Difference]: Finished difference Result 292 states and 724 transitions. [2020-02-10 20:42:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:02,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:02,698 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:42:02,698 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 20:42:02,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:02,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 20:42:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 186. [2020-02-10 20:42:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:42:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 543 transitions. [2020-02-10 20:42:02,703 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 543 transitions. Word has length 19 [2020-02-10 20:42:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:02,703 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 543 transitions. [2020-02-10 20:42:02,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 543 transitions. [2020-02-10 20:42:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:02,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:02,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:02,704 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:02,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash -171970810, now seen corresponding path program 341 times [2020-02-10 20:42:02,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:02,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187193686] [2020-02-10 20:42:02,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:02,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187193686] [2020-02-10 20:42:02,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:02,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:02,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339107860] [2020-02-10 20:42:02,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:02,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:02,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:02,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:02,897 INFO L87 Difference]: Start difference. First operand 186 states and 543 transitions. Second operand 8 states. [2020-02-10 20:42:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:02,985 INFO L93 Difference]: Finished difference Result 287 states and 713 transitions. [2020-02-10 20:42:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:02,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:02,987 INFO L225 Difference]: With dead ends: 287 [2020-02-10 20:42:02,987 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 20:42:02,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 20:42:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 187. [2020-02-10 20:42:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-02-10 20:42:02,991 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-02-10 20:42:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:02,992 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-02-10 20:42:02,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-02-10 20:42:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:02,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:02,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:02,992 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash -411613148, now seen corresponding path program 342 times [2020-02-10 20:42:02,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:02,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339281993] [2020-02-10 20:42:02,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:03,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339281993] [2020-02-10 20:42:03,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:03,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:03,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315939557] [2020-02-10 20:42:03,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:03,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:03,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:03,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:03,195 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-02-10 20:42:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:03,264 INFO L93 Difference]: Finished difference Result 287 states and 712 transitions. [2020-02-10 20:42:03,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:03,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:03,266 INFO L225 Difference]: With dead ends: 287 [2020-02-10 20:42:03,266 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 20:42:03,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 20:42:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2020-02-10 20:42:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:42:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 541 transitions. [2020-02-10 20:42:03,271 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 541 transitions. Word has length 19 [2020-02-10 20:42:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:03,271 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 541 transitions. [2020-02-10 20:42:03,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 541 transitions. [2020-02-10 20:42:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:03,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:03,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:03,271 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2136529082, now seen corresponding path program 343 times [2020-02-10 20:42:03,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:03,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209103149] [2020-02-10 20:42:03,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:03,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209103149] [2020-02-10 20:42:03,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:03,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:03,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386597244] [2020-02-10 20:42:03,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:03,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:03,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:03,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:03,440 INFO L87 Difference]: Start difference. First operand 185 states and 541 transitions. Second operand 8 states. [2020-02-10 20:42:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:03,521 INFO L93 Difference]: Finished difference Result 297 states and 737 transitions. [2020-02-10 20:42:03,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:03,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:03,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:03,522 INFO L225 Difference]: With dead ends: 297 [2020-02-10 20:42:03,522 INFO L226 Difference]: Without dead ends: 283 [2020-02-10 20:42:03,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-02-10 20:42:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 189. [2020-02-10 20:42:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:42:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-02-10 20:42:03,527 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-02-10 20:42:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:03,527 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-02-10 20:42:03,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-02-10 20:42:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:03,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:03,527 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:03,527 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:03,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1284102888, now seen corresponding path program 344 times [2020-02-10 20:42:03,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:03,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118763226] [2020-02-10 20:42:03,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:03,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118763226] [2020-02-10 20:42:03,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:03,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:03,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695543248] [2020-02-10 20:42:03,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:03,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:03,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:03,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:03,696 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-02-10 20:42:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:03,784 INFO L93 Difference]: Finished difference Result 293 states and 726 transitions. [2020-02-10 20:42:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:03,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:03,785 INFO L225 Difference]: With dead ends: 293 [2020-02-10 20:42:03,785 INFO L226 Difference]: Without dead ends: 281 [2020-02-10 20:42:03,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-02-10 20:42:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 187. [2020-02-10 20:42:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 546 transitions. [2020-02-10 20:42:03,790 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 546 transitions. Word has length 19 [2020-02-10 20:42:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:03,790 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 546 transitions. [2020-02-10 20:42:03,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 546 transitions. [2020-02-10 20:42:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:03,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:03,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:03,791 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:03,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1698016266, now seen corresponding path program 345 times [2020-02-10 20:42:03,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:03,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238504176] [2020-02-10 20:42:03,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:03,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238504176] [2020-02-10 20:42:03,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:03,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:03,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369859517] [2020-02-10 20:42:03,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:03,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:03,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:03,970 INFO L87 Difference]: Start difference. First operand 187 states and 546 transitions. Second operand 8 states. [2020-02-10 20:42:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:04,066 INFO L93 Difference]: Finished difference Result 303 states and 752 transitions. [2020-02-10 20:42:04,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:04,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:04,068 INFO L225 Difference]: With dead ends: 303 [2020-02-10 20:42:04,068 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 20:42:04,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 20:42:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2020-02-10 20:42:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:42:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-02-10 20:42:04,072 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-02-10 20:42:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:04,072 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-02-10 20:42:04,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-02-10 20:42:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:04,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:04,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:04,073 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:04,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:04,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1628066990, now seen corresponding path program 346 times [2020-02-10 20:42:04,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:04,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848439265] [2020-02-10 20:42:04,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:04,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848439265] [2020-02-10 20:42:04,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:04,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:04,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641795528] [2020-02-10 20:42:04,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:04,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:04,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:04,249 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-02-10 20:42:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:04,341 INFO L93 Difference]: Finished difference Result 302 states and 745 transitions. [2020-02-10 20:42:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:04,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:04,342 INFO L225 Difference]: With dead ends: 302 [2020-02-10 20:42:04,342 INFO L226 Difference]: Without dead ends: 284 [2020-02-10 20:42:04,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-02-10 20:42:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 187. [2020-02-10 20:42:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-02-10 20:42:04,346 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-02-10 20:42:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:04,346 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-02-10 20:42:04,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-02-10 20:42:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:04,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:04,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:04,347 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:04,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1237178862, now seen corresponding path program 347 times [2020-02-10 20:42:04,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:04,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801831314] [2020-02-10 20:42:04,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:04,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801831314] [2020-02-10 20:42:04,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:04,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:04,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178605181] [2020-02-10 20:42:04,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:04,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:04,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:04,523 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-02-10 20:42:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:04,598 INFO L93 Difference]: Finished difference Result 292 states and 722 transitions. [2020-02-10 20:42:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:04,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:04,599 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:42:04,599 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:42:04,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:42:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 189. [2020-02-10 20:42:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:42:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 547 transitions. [2020-02-10 20:42:04,603 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 547 transitions. Word has length 19 [2020-02-10 20:42:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:04,603 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 547 transitions. [2020-02-10 20:42:04,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 547 transitions. [2020-02-10 20:42:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:04,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:04,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:04,603 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:04,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1328741100, now seen corresponding path program 348 times [2020-02-10 20:42:04,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:04,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200129093] [2020-02-10 20:42:04,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:04,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200129093] [2020-02-10 20:42:04,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:04,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:04,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341683130] [2020-02-10 20:42:04,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:04,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:04,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:04,775 INFO L87 Difference]: Start difference. First operand 189 states and 547 transitions. Second operand 8 states. [2020-02-10 20:42:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:04,862 INFO L93 Difference]: Finished difference Result 295 states and 727 transitions. [2020-02-10 20:42:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:04,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:04,863 INFO L225 Difference]: With dead ends: 295 [2020-02-10 20:42:04,863 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 20:42:04,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 20:42:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 185. [2020-02-10 20:42:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:42:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 540 transitions. [2020-02-10 20:42:04,867 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 540 transitions. Word has length 19 [2020-02-10 20:42:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:04,867 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 540 transitions. [2020-02-10 20:42:04,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 540 transitions. [2020-02-10 20:42:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:04,868 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:04,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:04,868 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:04,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:04,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1719022474, now seen corresponding path program 349 times [2020-02-10 20:42:04,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:04,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622530006] [2020-02-10 20:42:04,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:05,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622530006] [2020-02-10 20:42:05,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:05,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:05,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028726027] [2020-02-10 20:42:05,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:05,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:05,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:05,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:05,054 INFO L87 Difference]: Start difference. First operand 185 states and 540 transitions. Second operand 8 states. [2020-02-10 20:42:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:05,130 INFO L93 Difference]: Finished difference Result 295 states and 729 transitions. [2020-02-10 20:42:05,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:05,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:05,132 INFO L225 Difference]: With dead ends: 295 [2020-02-10 20:42:05,132 INFO L226 Difference]: Without dead ends: 281 [2020-02-10 20:42:05,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-02-10 20:42:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 189. [2020-02-10 20:42:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:42:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-02-10 20:42:05,136 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-02-10 20:42:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:05,136 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-02-10 20:42:05,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-02-10 20:42:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:05,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:05,136 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:05,137 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1455814992, now seen corresponding path program 350 times [2020-02-10 20:42:05,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:05,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458500527] [2020-02-10 20:42:05,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:05,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458500527] [2020-02-10 20:42:05,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:05,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:05,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986017467] [2020-02-10 20:42:05,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:05,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:05,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:05,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:05,323 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-02-10 20:42:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:05,387 INFO L93 Difference]: Finished difference Result 291 states and 718 transitions. [2020-02-10 20:42:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:05,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:05,388 INFO L225 Difference]: With dead ends: 291 [2020-02-10 20:42:05,388 INFO L226 Difference]: Without dead ends: 279 [2020-02-10 20:42:05,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-02-10 20:42:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 187. [2020-02-10 20:42:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 545 transitions. [2020-02-10 20:42:05,393 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 545 transitions. Word has length 19 [2020-02-10 20:42:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:05,393 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 545 transitions. [2020-02-10 20:42:05,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 545 transitions. [2020-02-10 20:42:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:05,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:05,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:05,394 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:05,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:05,394 INFO L82 PathProgramCache]: Analyzing trace with hash 645937094, now seen corresponding path program 351 times [2020-02-10 20:42:05,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:05,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630818040] [2020-02-10 20:42:05,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:05,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630818040] [2020-02-10 20:42:05,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:05,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:05,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799932500] [2020-02-10 20:42:05,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:05,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:05,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:05,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:05,591 INFO L87 Difference]: Start difference. First operand 187 states and 545 transitions. Second operand 8 states. [2020-02-10 20:42:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:05,682 INFO L93 Difference]: Finished difference Result 296 states and 729 transitions. [2020-02-10 20:42:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:05,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:05,683 INFO L225 Difference]: With dead ends: 296 [2020-02-10 20:42:05,683 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:42:05,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:42:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 192. [2020-02-10 20:42:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:42:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2020-02-10 20:42:05,688 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 19 [2020-02-10 20:42:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:05,689 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2020-02-10 20:42:05,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2020-02-10 20:42:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:05,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:05,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:05,689 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:05,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:05,689 INFO L82 PathProgramCache]: Analyzing trace with hash 3880176, now seen corresponding path program 352 times [2020-02-10 20:42:05,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:05,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761523597] [2020-02-10 20:42:05,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:05,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761523597] [2020-02-10 20:42:05,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:05,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:05,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702417577] [2020-02-10 20:42:05,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:05,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:05,873 INFO L87 Difference]: Start difference. First operand 192 states and 555 transitions. Second operand 8 states. [2020-02-10 20:42:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:05,953 INFO L93 Difference]: Finished difference Result 295 states and 722 transitions. [2020-02-10 20:42:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:05,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:05,955 INFO L225 Difference]: With dead ends: 295 [2020-02-10 20:42:05,955 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 20:42:05,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 20:42:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 187. [2020-02-10 20:42:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-02-10 20:42:05,960 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-02-10 20:42:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:05,960 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-02-10 20:42:05,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-02-10 20:42:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:05,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:05,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:05,961 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:05,961 INFO L82 PathProgramCache]: Analyzing trace with hash -380103836, now seen corresponding path program 353 times [2020-02-10 20:42:05,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:05,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531198778] [2020-02-10 20:42:05,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:06,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531198778] [2020-02-10 20:42:06,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:06,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:06,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002512767] [2020-02-10 20:42:06,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:06,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:06,148 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-02-10 20:42:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:06,206 INFO L93 Difference]: Finished difference Result 285 states and 699 transitions. [2020-02-10 20:42:06,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:06,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:06,207 INFO L225 Difference]: With dead ends: 285 [2020-02-10 20:42:06,207 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 20:42:06,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 20:42:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2020-02-10 20:42:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:42:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 546 transitions. [2020-02-10 20:42:06,211 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 546 transitions. Word has length 19 [2020-02-10 20:42:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:06,211 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 546 transitions. [2020-02-10 20:42:06,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 546 transitions. [2020-02-10 20:42:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:06,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:06,211 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:06,211 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:06,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1109301160, now seen corresponding path program 354 times [2020-02-10 20:42:06,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:06,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255082554] [2020-02-10 20:42:06,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:06,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255082554] [2020-02-10 20:42:06,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:06,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:06,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752339188] [2020-02-10 20:42:06,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:06,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:06,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:06,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:06,390 INFO L87 Difference]: Start difference. First operand 189 states and 546 transitions. Second operand 8 states. [2020-02-10 20:42:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:06,468 INFO L93 Difference]: Finished difference Result 283 states and 694 transitions. [2020-02-10 20:42:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:06,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:06,469 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:42:06,469 INFO L226 Difference]: Without dead ends: 266 [2020-02-10 20:42:06,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-02-10 20:42:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 185. [2020-02-10 20:42:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:42:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 539 transitions. [2020-02-10 20:42:06,473 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 539 transitions. Word has length 19 [2020-02-10 20:42:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:06,473 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 539 transitions. [2020-02-10 20:42:06,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 539 transitions. [2020-02-10 20:42:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:06,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:06,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:06,474 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:06,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:06,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1184663342, now seen corresponding path program 355 times [2020-02-10 20:42:06,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:06,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979372504] [2020-02-10 20:42:06,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:06,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979372504] [2020-02-10 20:42:06,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:06,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:06,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417907684] [2020-02-10 20:42:06,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:06,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:06,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:06,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:06,675 INFO L87 Difference]: Start difference. First operand 185 states and 539 transitions. Second operand 8 states. [2020-02-10 20:42:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:06,760 INFO L93 Difference]: Finished difference Result 277 states and 681 transitions. [2020-02-10 20:42:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:06,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:06,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:06,761 INFO L225 Difference]: With dead ends: 277 [2020-02-10 20:42:06,761 INFO L226 Difference]: Without dead ends: 267 [2020-02-10 20:42:06,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-02-10 20:42:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 187. [2020-02-10 20:42:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-02-10 20:42:06,766 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-02-10 20:42:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:06,766 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-02-10 20:42:06,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-02-10 20:42:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:06,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:06,767 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:06,767 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1424305680, now seen corresponding path program 356 times [2020-02-10 20:42:06,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:06,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223965519] [2020-02-10 20:42:06,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:06,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223965519] [2020-02-10 20:42:06,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:06,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:06,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556528320] [2020-02-10 20:42:06,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:06,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:06,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:06,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:06,966 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-02-10 20:42:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:07,025 INFO L93 Difference]: Finished difference Result 277 states and 680 transitions. [2020-02-10 20:42:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:07,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:07,026 INFO L225 Difference]: With dead ends: 277 [2020-02-10 20:42:07,026 INFO L226 Difference]: Without dead ends: 266 [2020-02-10 20:42:07,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-02-10 20:42:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 186. [2020-02-10 20:42:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:42:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 541 transitions. [2020-02-10 20:42:07,030 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 541 transitions. Word has length 19 [2020-02-10 20:42:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:07,030 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 541 transitions. [2020-02-10 20:42:07,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 541 transitions. [2020-02-10 20:42:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:07,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:07,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:07,031 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:07,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:07,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2037218574, now seen corresponding path program 357 times [2020-02-10 20:42:07,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:07,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054805327] [2020-02-10 20:42:07,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:07,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054805327] [2020-02-10 20:42:07,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:07,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:07,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7879469] [2020-02-10 20:42:07,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:07,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:07,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:07,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:07,229 INFO L87 Difference]: Start difference. First operand 186 states and 541 transitions. Second operand 8 states. [2020-02-10 20:42:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:07,306 INFO L93 Difference]: Finished difference Result 274 states and 675 transitions. [2020-02-10 20:42:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:07,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:07,308 INFO L225 Difference]: With dead ends: 274 [2020-02-10 20:42:07,308 INFO L226 Difference]: Without dead ends: 264 [2020-02-10 20:42:07,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-02-10 20:42:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 188. [2020-02-10 20:42:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:42:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 544 transitions. [2020-02-10 20:42:07,312 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 544 transitions. Word has length 19 [2020-02-10 20:42:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:07,313 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 544 transitions. [2020-02-10 20:42:07,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 544 transitions. [2020-02-10 20:42:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:07,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:07,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:07,313 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:07,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:07,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1302769718, now seen corresponding path program 358 times [2020-02-10 20:42:07,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:07,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788748920] [2020-02-10 20:42:07,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:07,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788748920] [2020-02-10 20:42:07,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:07,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:07,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760674668] [2020-02-10 20:42:07,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:07,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:07,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:07,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:07,499 INFO L87 Difference]: Start difference. First operand 188 states and 544 transitions. Second operand 8 states. [2020-02-10 20:42:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:07,585 INFO L93 Difference]: Finished difference Result 277 states and 680 transitions. [2020-02-10 20:42:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:07,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:07,586 INFO L225 Difference]: With dead ends: 277 [2020-02-10 20:42:07,586 INFO L226 Difference]: Without dead ends: 262 [2020-02-10 20:42:07,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-02-10 20:42:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 186. [2020-02-10 20:42:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:42:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 540 transitions. [2020-02-10 20:42:07,590 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 540 transitions. Word has length 19 [2020-02-10 20:42:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:07,590 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 540 transitions. [2020-02-10 20:42:07,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 540 transitions. [2020-02-10 20:42:07,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:07,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:07,591 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:07,591 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:07,591 INFO L82 PathProgramCache]: Analyzing trace with hash -886450102, now seen corresponding path program 359 times [2020-02-10 20:42:07,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:07,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767743028] [2020-02-10 20:42:07,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:07,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767743028] [2020-02-10 20:42:07,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:07,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:07,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925043016] [2020-02-10 20:42:07,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:07,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:07,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:07,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:07,784 INFO L87 Difference]: Start difference. First operand 186 states and 540 transitions. Second operand 8 states. [2020-02-10 20:42:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:07,855 INFO L93 Difference]: Finished difference Result 272 states and 669 transitions. [2020-02-10 20:42:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:07,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:07,857 INFO L225 Difference]: With dead ends: 272 [2020-02-10 20:42:07,857 INFO L226 Difference]: Without dead ends: 262 [2020-02-10 20:42:07,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-02-10 20:42:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 188. [2020-02-10 20:42:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:42:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 543 transitions. [2020-02-10 20:42:07,861 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 543 transitions. Word has length 19 [2020-02-10 20:42:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:07,862 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 543 transitions. [2020-02-10 20:42:07,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 543 transitions. [2020-02-10 20:42:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:07,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:07,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:07,862 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash 602954894, now seen corresponding path program 360 times [2020-02-10 20:42:07,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:07,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006450865] [2020-02-10 20:42:07,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:08,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006450865] [2020-02-10 20:42:08,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:08,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:08,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251666594] [2020-02-10 20:42:08,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:08,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:08,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:08,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:08,048 INFO L87 Difference]: Start difference. First operand 188 states and 543 transitions. Second operand 8 states. [2020-02-10 20:42:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:08,127 INFO L93 Difference]: Finished difference Result 270 states and 664 transitions. [2020-02-10 20:42:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:08,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:08,128 INFO L225 Difference]: With dead ends: 270 [2020-02-10 20:42:08,128 INFO L226 Difference]: Without dead ends: 249 [2020-02-10 20:42:08,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-02-10 20:42:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 180. [2020-02-10 20:42:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 20:42:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 530 transitions. [2020-02-10 20:42:08,133 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 530 transitions. Word has length 19 [2020-02-10 20:42:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:08,133 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 530 transitions. [2020-02-10 20:42:08,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 530 transitions. [2020-02-10 20:42:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:08,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:08,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:08,133 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:08,134 INFO L82 PathProgramCache]: Analyzing trace with hash 234329704, now seen corresponding path program 361 times [2020-02-10 20:42:08,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:08,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576373842] [2020-02-10 20:42:08,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:08,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576373842] [2020-02-10 20:42:08,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:08,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:08,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755965513] [2020-02-10 20:42:08,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:08,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:08,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:08,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:08,340 INFO L87 Difference]: Start difference. First operand 180 states and 530 transitions. Second operand 8 states. [2020-02-10 20:42:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:08,397 INFO L93 Difference]: Finished difference Result 319 states and 780 transitions. [2020-02-10 20:42:08,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:08,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:08,398 INFO L225 Difference]: With dead ends: 319 [2020-02-10 20:42:08,398 INFO L226 Difference]: Without dead ends: 303 [2020-02-10 20:42:08,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-02-10 20:42:08,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 192. [2020-02-10 20:42:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:42:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-02-10 20:42:08,403 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-02-10 20:42:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:08,403 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-02-10 20:42:08,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-02-10 20:42:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:08,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:08,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:08,404 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:08,404 INFO L82 PathProgramCache]: Analyzing trace with hash 608980890, now seen corresponding path program 362 times [2020-02-10 20:42:08,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:08,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064949052] [2020-02-10 20:42:08,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:08,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064949052] [2020-02-10 20:42:08,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:08,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:08,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129166725] [2020-02-10 20:42:08,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:08,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:08,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:08,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:08,609 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-02-10 20:42:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:08,690 INFO L93 Difference]: Finished difference Result 317 states and 770 transitions. [2020-02-10 20:42:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:08,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:08,691 INFO L225 Difference]: With dead ends: 317 [2020-02-10 20:42:08,691 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:42:08,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:42:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-02-10 20:42:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:42:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 538 transitions. [2020-02-10 20:42:08,697 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 538 transitions. Word has length 19 [2020-02-10 20:42:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:08,697 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 538 transitions. [2020-02-10 20:42:08,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 538 transitions. [2020-02-10 20:42:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:08,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:08,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:08,698 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash 438930786, now seen corresponding path program 363 times [2020-02-10 20:42:08,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:08,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139102772] [2020-02-10 20:42:08,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:08,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139102772] [2020-02-10 20:42:08,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:08,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:08,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598193254] [2020-02-10 20:42:08,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:08,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:08,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:08,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:08,902 INFO L87 Difference]: Start difference. First operand 184 states and 538 transitions. Second operand 8 states. [2020-02-10 20:42:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:08,960 INFO L93 Difference]: Finished difference Result 310 states and 753 transitions. [2020-02-10 20:42:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:08,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:08,961 INFO L225 Difference]: With dead ends: 310 [2020-02-10 20:42:08,961 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 20:42:08,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:08,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 20:42:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 187. [2020-02-10 20:42:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 542 transitions. [2020-02-10 20:42:08,967 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 542 transitions. Word has length 19 [2020-02-10 20:42:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:08,967 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 542 transitions. [2020-02-10 20:42:08,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 542 transitions. [2020-02-10 20:42:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:08,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:08,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:08,968 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:08,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1712795760, now seen corresponding path program 364 times [2020-02-10 20:42:08,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:08,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283132603] [2020-02-10 20:42:08,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:09,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283132603] [2020-02-10 20:42:09,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:09,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:09,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573094797] [2020-02-10 20:42:09,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:09,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:09,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:09,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:09,160 INFO L87 Difference]: Start difference. First operand 187 states and 542 transitions. Second operand 8 states. [2020-02-10 20:42:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:09,235 INFO L93 Difference]: Finished difference Result 304 states and 738 transitions. [2020-02-10 20:42:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:09,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:09,237 INFO L225 Difference]: With dead ends: 304 [2020-02-10 20:42:09,237 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:42:09,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:42:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2020-02-10 20:42:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:42:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 535 transitions. [2020-02-10 20:42:09,242 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 535 transitions. Word has length 19 [2020-02-10 20:42:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:09,242 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 535 transitions. [2020-02-10 20:42:09,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 535 transitions. [2020-02-10 20:42:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:09,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:09,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:09,243 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash -959085248, now seen corresponding path program 365 times [2020-02-10 20:42:09,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:09,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468952593] [2020-02-10 20:42:09,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:09,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468952593] [2020-02-10 20:42:09,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:09,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:09,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984040989] [2020-02-10 20:42:09,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:09,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:09,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:09,436 INFO L87 Difference]: Start difference. First operand 184 states and 535 transitions. Second operand 8 states. [2020-02-10 20:42:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:09,510 INFO L93 Difference]: Finished difference Result 305 states and 742 transitions. [2020-02-10 20:42:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:09,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:09,511 INFO L225 Difference]: With dead ends: 305 [2020-02-10 20:42:09,511 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:42:09,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:42:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 186. [2020-02-10 20:42:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:42:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 538 transitions. [2020-02-10 20:42:09,516 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 538 transitions. Word has length 19 [2020-02-10 20:42:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:09,516 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 538 transitions. [2020-02-10 20:42:09,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 538 transitions. [2020-02-10 20:42:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:09,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:09,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:09,517 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1833420574, now seen corresponding path program 366 times [2020-02-10 20:42:09,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:09,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078318373] [2020-02-10 20:42:09,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:09,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078318373] [2020-02-10 20:42:09,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:09,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:09,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17125273] [2020-02-10 20:42:09,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:09,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:09,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:09,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:09,719 INFO L87 Difference]: Start difference. First operand 186 states and 538 transitions. Second operand 8 states. [2020-02-10 20:42:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:09,800 INFO L93 Difference]: Finished difference Result 301 states and 731 transitions. [2020-02-10 20:42:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:09,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:09,801 INFO L225 Difference]: With dead ends: 301 [2020-02-10 20:42:09,801 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 20:42:09,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 20:42:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 180. [2020-02-10 20:42:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 20:42:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 527 transitions. [2020-02-10 20:42:09,805 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 527 transitions. Word has length 19 [2020-02-10 20:42:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:09,805 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 527 transitions. [2020-02-10 20:42:09,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 527 transitions. [2020-02-10 20:42:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:09,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:09,806 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:09,806 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash -188156022, now seen corresponding path program 367 times [2020-02-10 20:42:09,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:09,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241122432] [2020-02-10 20:42:09,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:10,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241122432] [2020-02-10 20:42:10,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:10,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:10,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065778694] [2020-02-10 20:42:10,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:10,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:10,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:10,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:10,019 INFO L87 Difference]: Start difference. First operand 180 states and 527 transitions. Second operand 8 states. [2020-02-10 20:42:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:10,084 INFO L93 Difference]: Finished difference Result 319 states and 777 transitions. [2020-02-10 20:42:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:10,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:10,092 INFO L225 Difference]: With dead ends: 319 [2020-02-10 20:42:10,092 INFO L226 Difference]: Without dead ends: 303 [2020-02-10 20:42:10,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-02-10 20:42:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 192. [2020-02-10 20:42:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:42:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 553 transitions. [2020-02-10 20:42:10,096 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 553 transitions. Word has length 19 [2020-02-10 20:42:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:10,096 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 553 transitions. [2020-02-10 20:42:10,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 553 transitions. [2020-02-10 20:42:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:10,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:10,096 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:10,096 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash 186495164, now seen corresponding path program 368 times [2020-02-10 20:42:10,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:10,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372609330] [2020-02-10 20:42:10,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:10,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372609330] [2020-02-10 20:42:10,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:10,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:10,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380535356] [2020-02-10 20:42:10,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:10,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:10,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:10,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:10,299 INFO L87 Difference]: Start difference. First operand 192 states and 553 transitions. Second operand 8 states. [2020-02-10 20:42:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:10,373 INFO L93 Difference]: Finished difference Result 317 states and 767 transitions. [2020-02-10 20:42:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:10,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:10,374 INFO L225 Difference]: With dead ends: 317 [2020-02-10 20:42:10,374 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:42:10,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:42:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-02-10 20:42:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:42:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 535 transitions. [2020-02-10 20:42:10,379 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 535 transitions. Word has length 19 [2020-02-10 20:42:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:10,379 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 535 transitions. [2020-02-10 20:42:10,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 535 transitions. [2020-02-10 20:42:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:10,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:10,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:10,379 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:10,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:10,380 INFO L82 PathProgramCache]: Analyzing trace with hash 342041284, now seen corresponding path program 369 times [2020-02-10 20:42:10,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:10,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11686104] [2020-02-10 20:42:10,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:10,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11686104] [2020-02-10 20:42:10,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:10,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:10,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244417987] [2020-02-10 20:42:10,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:10,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:10,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:10,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:10,599 INFO L87 Difference]: Start difference. First operand 184 states and 535 transitions. Second operand 8 states. [2020-02-10 20:42:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:10,664 INFO L93 Difference]: Finished difference Result 310 states and 750 transitions. [2020-02-10 20:42:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:10,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:10,665 INFO L225 Difference]: With dead ends: 310 [2020-02-10 20:42:10,665 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 20:42:10,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 20:42:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 187. [2020-02-10 20:42:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 539 transitions. [2020-02-10 20:42:10,670 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 539 transitions. Word has length 19 [2020-02-10 20:42:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:10,670 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 539 transitions. [2020-02-10 20:42:10,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 539 transitions. [2020-02-10 20:42:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:10,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:10,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:10,671 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:10,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:10,671 INFO L82 PathProgramCache]: Analyzing trace with hash 601099510, now seen corresponding path program 370 times [2020-02-10 20:42:10,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:10,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161515589] [2020-02-10 20:42:10,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:10,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161515589] [2020-02-10 20:42:10,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:10,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:10,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69430547] [2020-02-10 20:42:10,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:10,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:10,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:10,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:10,869 INFO L87 Difference]: Start difference. First operand 187 states and 539 transitions. Second operand 8 states. [2020-02-10 20:42:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:10,929 INFO L93 Difference]: Finished difference Result 304 states and 735 transitions. [2020-02-10 20:42:10,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:10,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:10,930 INFO L225 Difference]: With dead ends: 304 [2020-02-10 20:42:10,930 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:42:10,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:42:10,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2020-02-10 20:42:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:42:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 532 transitions. [2020-02-10 20:42:10,934 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 532 transitions. Word has length 19 [2020-02-10 20:42:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:10,935 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 532 transitions. [2020-02-10 20:42:10,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 532 transitions. [2020-02-10 20:42:10,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:10,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:10,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:10,935 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2030620292, now seen corresponding path program 371 times [2020-02-10 20:42:10,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:10,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421000949] [2020-02-10 20:42:10,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:11,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421000949] [2020-02-10 20:42:11,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:11,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:11,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573128695] [2020-02-10 20:42:11,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:11,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:11,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:11,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:11,135 INFO L87 Difference]: Start difference. First operand 184 states and 532 transitions. Second operand 8 states. [2020-02-10 20:42:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:11,215 INFO L93 Difference]: Finished difference Result 305 states and 739 transitions. [2020-02-10 20:42:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:11,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:11,216 INFO L225 Difference]: With dead ends: 305 [2020-02-10 20:42:11,216 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:42:11,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:42:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 186. [2020-02-10 20:42:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:42:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 535 transitions. [2020-02-10 20:42:11,221 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 535 transitions. Word has length 19 [2020-02-10 20:42:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:11,221 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 535 transitions. [2020-02-10 20:42:11,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 535 transitions. [2020-02-10 20:42:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:11,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:11,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:11,222 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:11,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:11,222 INFO L82 PathProgramCache]: Analyzing trace with hash -910490462, now seen corresponding path program 372 times [2020-02-10 20:42:11,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:11,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304026663] [2020-02-10 20:42:11,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:11,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304026663] [2020-02-10 20:42:11,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:11,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:11,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986647722] [2020-02-10 20:42:11,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:11,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:11,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:11,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:11,426 INFO L87 Difference]: Start difference. First operand 186 states and 535 transitions. Second operand 8 states. [2020-02-10 20:42:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:11,493 INFO L93 Difference]: Finished difference Result 301 states and 728 transitions. [2020-02-10 20:42:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:11,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:11,494 INFO L225 Difference]: With dead ends: 301 [2020-02-10 20:42:11,494 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 20:42:11,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 20:42:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 180. [2020-02-10 20:42:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 20:42:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 524 transitions. [2020-02-10 20:42:11,499 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 524 transitions. Word has length 19 [2020-02-10 20:42:11,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:11,499 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 524 transitions. [2020-02-10 20:42:11,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 524 transitions. [2020-02-10 20:42:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:11,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:11,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:11,500 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:11,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:11,500 INFO L82 PathProgramCache]: Analyzing trace with hash -304821912, now seen corresponding path program 373 times [2020-02-10 20:42:11,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:11,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64676341] [2020-02-10 20:42:11,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:11,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64676341] [2020-02-10 20:42:11,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:11,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:11,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629057446] [2020-02-10 20:42:11,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:11,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:11,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:11,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:11,696 INFO L87 Difference]: Start difference. First operand 180 states and 524 transitions. Second operand 8 states. [2020-02-10 20:42:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:11,755 INFO L93 Difference]: Finished difference Result 298 states and 719 transitions. [2020-02-10 20:42:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:11,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:11,756 INFO L225 Difference]: With dead ends: 298 [2020-02-10 20:42:11,756 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:42:11,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:11,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:42:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2020-02-10 20:42:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:42:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 534 transitions. [2020-02-10 20:42:11,760 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 534 transitions. Word has length 19 [2020-02-10 20:42:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:11,760 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 534 transitions. [2020-02-10 20:42:11,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 534 transitions. [2020-02-10 20:42:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:11,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:11,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:11,761 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1838418838, now seen corresponding path program 374 times [2020-02-10 20:42:11,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:11,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933514681] [2020-02-10 20:42:11,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:11,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933514681] [2020-02-10 20:42:11,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:11,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:11,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855917300] [2020-02-10 20:42:11,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:11,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:11,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:11,965 INFO L87 Difference]: Start difference. First operand 185 states and 534 transitions. Second operand 8 states. [2020-02-10 20:42:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:12,052 INFO L93 Difference]: Finished difference Result 292 states and 704 transitions. [2020-02-10 20:42:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:12,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:12,053 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:42:12,053 INFO L226 Difference]: Without dead ends: 279 [2020-02-10 20:42:12,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-02-10 20:42:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2020-02-10 20:42:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-02-10 20:42:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 528 transitions. [2020-02-10 20:42:12,057 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 528 transitions. Word has length 19 [2020-02-10 20:42:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:12,057 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 528 transitions. [2020-02-10 20:42:12,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 528 transitions. [2020-02-10 20:42:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:12,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:12,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:12,058 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1905259766, now seen corresponding path program 375 times [2020-02-10 20:42:12,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:12,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535444933] [2020-02-10 20:42:12,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:12,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535444933] [2020-02-10 20:42:12,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:12,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:12,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614589589] [2020-02-10 20:42:12,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:12,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:12,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:12,258 INFO L87 Difference]: Start difference. First operand 182 states and 528 transitions. Second operand 8 states. [2020-02-10 20:42:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:12,316 INFO L93 Difference]: Finished difference Result 298 states and 717 transitions. [2020-02-10 20:42:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:12,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:12,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:12,317 INFO L225 Difference]: With dead ends: 298 [2020-02-10 20:42:12,318 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:42:12,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:42:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2020-02-10 20:42:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:42:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 532 transitions. [2020-02-10 20:42:12,322 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 532 transitions. Word has length 19 [2020-02-10 20:42:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:12,322 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 532 transitions. [2020-02-10 20:42:12,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 532 transitions. [2020-02-10 20:42:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:12,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:12,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:12,323 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1646201540, now seen corresponding path program 376 times [2020-02-10 20:42:12,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:12,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10608634] [2020-02-10 20:42:12,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:12,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10608634] [2020-02-10 20:42:12,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:12,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:12,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938350034] [2020-02-10 20:42:12,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:12,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:12,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:12,521 INFO L87 Difference]: Start difference. First operand 185 states and 532 transitions. Second operand 8 states. [2020-02-10 20:42:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:12,590 INFO L93 Difference]: Finished difference Result 292 states and 702 transitions. [2020-02-10 20:42:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:12,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:12,591 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:42:12,591 INFO L226 Difference]: Without dead ends: 279 [2020-02-10 20:42:12,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-02-10 20:42:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2020-02-10 20:42:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-02-10 20:42:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 526 transitions. [2020-02-10 20:42:12,596 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 526 transitions. Word has length 19 [2020-02-10 20:42:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:12,596 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 526 transitions. [2020-02-10 20:42:12,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 526 transitions. [2020-02-10 20:42:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:12,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:12,597 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:12,597 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:12,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1408327434, now seen corresponding path program 377 times [2020-02-10 20:42:12,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:12,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337759678] [2020-02-10 20:42:12,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:12,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337759678] [2020-02-10 20:42:12,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:12,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:12,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987882002] [2020-02-10 20:42:12,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:12,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:12,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:12,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:12,798 INFO L87 Difference]: Start difference. First operand 182 states and 526 transitions. Second operand 8 states. [2020-02-10 20:42:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:12,879 INFO L93 Difference]: Finished difference Result 284 states and 686 transitions. [2020-02-10 20:42:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:12,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:12,880 INFO L225 Difference]: With dead ends: 284 [2020-02-10 20:42:12,880 INFO L226 Difference]: Without dead ends: 274 [2020-02-10 20:42:12,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-02-10 20:42:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-02-10 20:42:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 20:42:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 527 transitions. [2020-02-10 20:42:12,885 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 527 transitions. Word has length 19 [2020-02-10 20:42:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:12,885 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 527 transitions. [2020-02-10 20:42:12,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 527 transitions. [2020-02-10 20:42:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:12,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:12,885 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:12,885 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1168685096, now seen corresponding path program 378 times [2020-02-10 20:42:12,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:12,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336224707] [2020-02-10 20:42:12,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:13,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336224707] [2020-02-10 20:42:13,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:13,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:13,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614942972] [2020-02-10 20:42:13,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:13,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:13,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:13,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:13,093 INFO L87 Difference]: Start difference. First operand 183 states and 527 transitions. Second operand 8 states. [2020-02-10 20:42:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:13,154 INFO L93 Difference]: Finished difference Result 284 states and 685 transitions. [2020-02-10 20:42:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:13,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:13,155 INFO L225 Difference]: With dead ends: 284 [2020-02-10 20:42:13,155 INFO L226 Difference]: Without dead ends: 271 [2020-02-10 20:42:13,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-02-10 20:42:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 180. [2020-02-10 20:42:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 20:42:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 522 transitions. [2020-02-10 20:42:13,160 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 522 transitions. Word has length 19 [2020-02-10 20:42:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:13,160 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 522 transitions. [2020-02-10 20:42:13,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 522 transitions. [2020-02-10 20:42:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:13,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:13,161 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:13,161 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:13,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:13,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1264971302, now seen corresponding path program 379 times [2020-02-10 20:42:13,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:13,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169955177] [2020-02-10 20:42:13,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:13,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169955177] [2020-02-10 20:42:13,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:13,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:13,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820865223] [2020-02-10 20:42:13,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:13,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:13,360 INFO L87 Difference]: Start difference. First operand 180 states and 522 transitions. Second operand 8 states. [2020-02-10 20:42:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:13,443 INFO L93 Difference]: Finished difference Result 288 states and 699 transitions. [2020-02-10 20:42:13,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:13,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:13,444 INFO L225 Difference]: With dead ends: 288 [2020-02-10 20:42:13,444 INFO L226 Difference]: Without dead ends: 274 [2020-02-10 20:42:13,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-02-10 20:42:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-02-10 20:42:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 20:42:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 528 transitions. [2020-02-10 20:42:13,449 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 528 transitions. Word has length 19 [2020-02-10 20:42:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:13,449 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 528 transitions. [2020-02-10 20:42:13,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 528 transitions. [2020-02-10 20:42:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:13,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:13,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:13,450 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:13,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2139306628, now seen corresponding path program 380 times [2020-02-10 20:42:13,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:13,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451116830] [2020-02-10 20:42:13,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:13,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451116830] [2020-02-10 20:42:13,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:13,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:13,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058320521] [2020-02-10 20:42:13,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:13,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:13,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:13,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:13,655 INFO L87 Difference]: Start difference. First operand 183 states and 528 transitions. Second operand 8 states. [2020-02-10 20:42:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:13,731 INFO L93 Difference]: Finished difference Result 284 states and 688 transitions. [2020-02-10 20:42:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:13,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:13,733 INFO L225 Difference]: With dead ends: 284 [2020-02-10 20:42:13,733 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 20:42:13,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 20:42:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2020-02-10 20:42:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-02-10 20:42:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 524 transitions. [2020-02-10 20:42:13,739 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 524 transitions. Word has length 19 [2020-02-10 20:42:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:13,739 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 524 transitions. [2020-02-10 20:42:13,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 524 transitions. [2020-02-10 20:42:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:13,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:13,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:13,740 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash -103949188, now seen corresponding path program 381 times [2020-02-10 20:42:13,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:13,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972057188] [2020-02-10 20:42:13,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:13,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972057188] [2020-02-10 20:42:13,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:13,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:13,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369043829] [2020-02-10 20:42:13,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:13,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:13,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:13,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:13,940 INFO L87 Difference]: Start difference. First operand 181 states and 524 transitions. Second operand 8 states. [2020-02-10 20:42:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:14,009 INFO L93 Difference]: Finished difference Result 288 states and 698 transitions. [2020-02-10 20:42:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:14,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:14,011 INFO L225 Difference]: With dead ends: 288 [2020-02-10 20:42:14,011 INFO L226 Difference]: Without dead ends: 274 [2020-02-10 20:42:14,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-02-10 20:42:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-02-10 20:42:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 20:42:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 527 transitions. [2020-02-10 20:42:14,015 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 527 transitions. Word has length 19 [2020-02-10 20:42:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:14,015 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 527 transitions. [2020-02-10 20:42:14,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 527 transitions. [2020-02-10 20:42:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:14,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:14,016 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:14,016 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1016180642, now seen corresponding path program 382 times [2020-02-10 20:42:14,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:14,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393175550] [2020-02-10 20:42:14,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:14,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393175550] [2020-02-10 20:42:14,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:14,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:14,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736824778] [2020-02-10 20:42:14,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:14,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:14,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:14,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:14,213 INFO L87 Difference]: Start difference. First operand 183 states and 527 transitions. Second operand 8 states. [2020-02-10 20:42:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:14,271 INFO L93 Difference]: Finished difference Result 284 states and 687 transitions. [2020-02-10 20:42:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:14,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:14,272 INFO L225 Difference]: With dead ends: 284 [2020-02-10 20:42:14,272 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 20:42:14,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 20:42:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2020-02-10 20:42:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-02-10 20:42:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 523 transitions. [2020-02-10 20:42:14,277 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 523 transitions. Word has length 19 [2020-02-10 20:42:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:14,277 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 523 transitions. [2020-02-10 20:42:14,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 523 transitions. [2020-02-10 20:42:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:14,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:14,278 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:14,278 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1793678558, now seen corresponding path program 383 times [2020-02-10 20:42:14,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:14,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719738633] [2020-02-10 20:42:14,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:14,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719738633] [2020-02-10 20:42:14,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:14,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:14,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477932118] [2020-02-10 20:42:14,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:14,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:14,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:14,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:14,485 INFO L87 Difference]: Start difference. First operand 181 states and 523 transitions. Second operand 8 states. [2020-02-10 20:42:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:14,561 INFO L93 Difference]: Finished difference Result 279 states and 676 transitions. [2020-02-10 20:42:14,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:14,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:14,562 INFO L225 Difference]: With dead ends: 279 [2020-02-10 20:42:14,563 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 20:42:14,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 20:42:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 182. [2020-02-10 20:42:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-02-10 20:42:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 524 transitions. [2020-02-10 20:42:14,567 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 524 transitions. Word has length 19 [2020-02-10 20:42:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:14,567 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 524 transitions. [2020-02-10 20:42:14,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 524 transitions. [2020-02-10 20:42:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:14,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:14,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:14,568 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1554036220, now seen corresponding path program 384 times [2020-02-10 20:42:14,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:14,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556313914] [2020-02-10 20:42:14,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:14,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556313914] [2020-02-10 20:42:14,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:14,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:14,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586355080] [2020-02-10 20:42:14,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:14,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:14,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:14,793 INFO L87 Difference]: Start difference. First operand 182 states and 524 transitions. Second operand 8 states. [2020-02-10 20:42:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:14,861 INFO L93 Difference]: Finished difference Result 279 states and 675 transitions. [2020-02-10 20:42:14,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:14,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:14,863 INFO L225 Difference]: With dead ends: 279 [2020-02-10 20:42:14,863 INFO L226 Difference]: Without dead ends: 264 [2020-02-10 20:42:14,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-02-10 20:42:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 177. [2020-02-10 20:42:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:42:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 516 transitions. [2020-02-10 20:42:14,867 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 516 transitions. Word has length 19 [2020-02-10 20:42:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:14,867 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 516 transitions. [2020-02-10 20:42:14,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 516 transitions. [2020-02-10 20:42:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:14,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:14,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:14,867 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash 22174086, now seen corresponding path program 385 times [2020-02-10 20:42:14,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:14,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9901809] [2020-02-10 20:42:14,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:15,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9901809] [2020-02-10 20:42:15,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:15,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:15,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520153193] [2020-02-10 20:42:15,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:15,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:15,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:15,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:15,066 INFO L87 Difference]: Start difference. First operand 177 states and 516 transitions. Second operand 8 states. [2020-02-10 20:42:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:15,124 INFO L93 Difference]: Finished difference Result 321 states and 784 transitions. [2020-02-10 20:42:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:15,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:15,126 INFO L225 Difference]: With dead ends: 321 [2020-02-10 20:42:15,126 INFO L226 Difference]: Without dead ends: 305 [2020-02-10 20:42:15,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-02-10 20:42:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 185. [2020-02-10 20:42:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:42:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 530 transitions. [2020-02-10 20:42:15,130 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 530 transitions. Word has length 19 [2020-02-10 20:42:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:15,131 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 530 transitions. [2020-02-10 20:42:15,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 530 transitions. [2020-02-10 20:42:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:15,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:15,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:15,131 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:15,131 INFO L82 PathProgramCache]: Analyzing trace with hash 396825272, now seen corresponding path program 386 times [2020-02-10 20:42:15,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:15,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089173899] [2020-02-10 20:42:15,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:15,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089173899] [2020-02-10 20:42:15,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:15,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:15,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122652095] [2020-02-10 20:42:15,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:15,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:15,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:15,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:15,325 INFO L87 Difference]: Start difference. First operand 185 states and 530 transitions. Second operand 8 states. [2020-02-10 20:42:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:15,405 INFO L93 Difference]: Finished difference Result 319 states and 774 transitions. [2020-02-10 20:42:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:15,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:15,406 INFO L225 Difference]: With dead ends: 319 [2020-02-10 20:42:15,406 INFO L226 Difference]: Without dead ends: 297 [2020-02-10 20:42:15,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-02-10 20:42:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 177. [2020-02-10 20:42:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:42:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 512 transitions. [2020-02-10 20:42:15,411 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 512 transitions. Word has length 19 [2020-02-10 20:42:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:15,411 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 512 transitions. [2020-02-10 20:42:15,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 512 transitions. [2020-02-10 20:42:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:15,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:15,412 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:15,412 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:15,412 INFO L82 PathProgramCache]: Analyzing trace with hash 226775168, now seen corresponding path program 387 times [2020-02-10 20:42:15,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:15,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62816622] [2020-02-10 20:42:15,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:15,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62816622] [2020-02-10 20:42:15,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:15,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:15,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608812916] [2020-02-10 20:42:15,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:15,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:15,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:15,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:15,607 INFO L87 Difference]: Start difference. First operand 177 states and 512 transitions. Second operand 8 states. [2020-02-10 20:42:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:15,658 INFO L93 Difference]: Finished difference Result 312 states and 757 transitions. [2020-02-10 20:42:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:15,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:15,659 INFO L225 Difference]: With dead ends: 312 [2020-02-10 20:42:15,660 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 20:42:15,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 20:42:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 180. [2020-02-10 20:42:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 20:42:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 516 transitions. [2020-02-10 20:42:15,664 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 516 transitions. Word has length 19 [2020-02-10 20:42:15,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:15,664 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 516 transitions. [2020-02-10 20:42:15,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 516 transitions. [2020-02-10 20:42:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:15,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:15,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:15,665 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:15,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:15,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1924951378, now seen corresponding path program 388 times [2020-02-10 20:42:15,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:15,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256422025] [2020-02-10 20:42:15,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:15,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256422025] [2020-02-10 20:42:15,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:15,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:15,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999167909] [2020-02-10 20:42:15,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:15,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:15,853 INFO L87 Difference]: Start difference. First operand 180 states and 516 transitions. Second operand 8 states. [2020-02-10 20:42:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:15,931 INFO L93 Difference]: Finished difference Result 306 states and 742 transitions. [2020-02-10 20:42:15,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:15,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:15,932 INFO L225 Difference]: With dead ends: 306 [2020-02-10 20:42:15,932 INFO L226 Difference]: Without dead ends: 293 [2020-02-10 20:42:15,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-02-10 20:42:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 177. [2020-02-10 20:42:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:42:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 509 transitions. [2020-02-10 20:42:15,937 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 509 transitions. Word has length 19 [2020-02-10 20:42:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:15,937 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 509 transitions. [2020-02-10 20:42:15,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 509 transitions. [2020-02-10 20:42:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:15,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:15,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:15,937 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:15,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1171240866, now seen corresponding path program 389 times [2020-02-10 20:42:15,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:15,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732850426] [2020-02-10 20:42:15,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:16,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732850426] [2020-02-10 20:42:16,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:16,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:16,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111404779] [2020-02-10 20:42:16,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:16,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:16,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:16,119 INFO L87 Difference]: Start difference. First operand 177 states and 509 transitions. Second operand 8 states. [2020-02-10 20:42:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:16,193 INFO L93 Difference]: Finished difference Result 307 states and 746 transitions. [2020-02-10 20:42:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:16,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:16,194 INFO L225 Difference]: With dead ends: 307 [2020-02-10 20:42:16,194 INFO L226 Difference]: Without dead ends: 293 [2020-02-10 20:42:16,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:16,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-02-10 20:42:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 179. [2020-02-10 20:42:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 20:42:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 512 transitions. [2020-02-10 20:42:16,198 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 512 transitions. Word has length 19 [2020-02-10 20:42:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:16,199 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 512 transitions. [2020-02-10 20:42:16,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 512 transitions. [2020-02-10 20:42:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:16,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:16,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:16,199 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:16,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:16,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2045576192, now seen corresponding path program 390 times [2020-02-10 20:42:16,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:16,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732526333] [2020-02-10 20:42:16,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:16,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732526333] [2020-02-10 20:42:16,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:16,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:16,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974272518] [2020-02-10 20:42:16,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:16,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:16,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:16,382 INFO L87 Difference]: Start difference. First operand 179 states and 512 transitions. Second operand 8 states. [2020-02-10 20:42:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:16,464 INFO L93 Difference]: Finished difference Result 303 states and 735 transitions. [2020-02-10 20:42:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:16,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:16,465 INFO L225 Difference]: With dead ends: 303 [2020-02-10 20:42:16,465 INFO L226 Difference]: Without dead ends: 287 [2020-02-10 20:42:16,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-02-10 20:42:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 173. [2020-02-10 20:42:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-02-10 20:42:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 500 transitions. [2020-02-10 20:42:16,470 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 500 transitions. Word has length 19 [2020-02-10 20:42:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:16,470 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 500 transitions. [2020-02-10 20:42:16,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 500 transitions. [2020-02-10 20:42:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:16,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:16,470 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:16,470 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:16,471 INFO L82 PathProgramCache]: Analyzing trace with hash -822797366, now seen corresponding path program 391 times [2020-02-10 20:42:16,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:16,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107575300] [2020-02-10 20:42:16,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:16,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107575300] [2020-02-10 20:42:16,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:16,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:16,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978675403] [2020-02-10 20:42:16,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:16,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:16,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:16,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:16,669 INFO L87 Difference]: Start difference. First operand 173 states and 500 transitions. Second operand 8 states. [2020-02-10 20:42:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:16,727 INFO L93 Difference]: Finished difference Result 321 states and 787 transitions. [2020-02-10 20:42:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:16,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:16,728 INFO L225 Difference]: With dead ends: 321 [2020-02-10 20:42:16,728 INFO L226 Difference]: Without dead ends: 305 [2020-02-10 20:42:16,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-02-10 20:42:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 187. [2020-02-10 20:42:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:42:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 535 transitions. [2020-02-10 20:42:16,733 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 535 transitions. Word has length 19 [2020-02-10 20:42:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:16,733 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 535 transitions. [2020-02-10 20:42:16,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 535 transitions. [2020-02-10 20:42:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:16,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:16,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:16,733 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash -448146180, now seen corresponding path program 392 times [2020-02-10 20:42:16,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:16,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137490942] [2020-02-10 20:42:16,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:16,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137490942] [2020-02-10 20:42:16,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:16,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:16,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954238278] [2020-02-10 20:42:16,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:16,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:16,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:16,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:16,930 INFO L87 Difference]: Start difference. First operand 187 states and 535 transitions. Second operand 8 states. [2020-02-10 20:42:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:17,003 INFO L93 Difference]: Finished difference Result 319 states and 777 transitions. [2020-02-10 20:42:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:17,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:17,004 INFO L225 Difference]: With dead ends: 319 [2020-02-10 20:42:17,004 INFO L226 Difference]: Without dead ends: 297 [2020-02-10 20:42:17,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-02-10 20:42:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 179. [2020-02-10 20:42:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 20:42:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 515 transitions. [2020-02-10 20:42:17,009 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 515 transitions. Word has length 19 [2020-02-10 20:42:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:17,009 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 515 transitions. [2020-02-10 20:42:17,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 515 transitions. [2020-02-10 20:42:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:17,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:17,009 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:17,010 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash 32996164, now seen corresponding path program 393 times [2020-02-10 20:42:17,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:17,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956386533] [2020-02-10 20:42:17,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:17,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956386533] [2020-02-10 20:42:17,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:17,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:17,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249254623] [2020-02-10 20:42:17,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:17,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:17,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:17,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:17,200 INFO L87 Difference]: Start difference. First operand 179 states and 515 transitions. Second operand 8 states. [2020-02-10 20:42:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:17,259 INFO L93 Difference]: Finished difference Result 308 states and 755 transitions. [2020-02-10 20:42:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:17,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:17,260 INFO L225 Difference]: With dead ends: 308 [2020-02-10 20:42:17,260 INFO L226 Difference]: Without dead ends: 292 [2020-02-10 20:42:17,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-02-10 20:42:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 184. [2020-02-10 20:42:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:42:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 524 transitions. [2020-02-10 20:42:17,264 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 524 transitions. Word has length 19 [2020-02-10 20:42:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:17,264 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 524 transitions. [2020-02-10 20:42:17,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 524 transitions. [2020-02-10 20:42:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:17,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:17,264 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:17,265 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:17,265 INFO L82 PathProgramCache]: Analyzing trace with hash -718065930, now seen corresponding path program 394 times [2020-02-10 20:42:17,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:17,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740988692] [2020-02-10 20:42:17,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:17,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740988692] [2020-02-10 20:42:17,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:17,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:17,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256959870] [2020-02-10 20:42:17,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:17,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:17,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:17,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:17,454 INFO L87 Difference]: Start difference. First operand 184 states and 524 transitions. Second operand 8 states. [2020-02-10 20:42:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:17,532 INFO L93 Difference]: Finished difference Result 295 states and 734 transitions. [2020-02-10 20:42:17,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:17,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:17,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:17,533 INFO L225 Difference]: With dead ends: 295 [2020-02-10 20:42:17,533 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 20:42:17,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 20:42:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 179. [2020-02-10 20:42:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 20:42:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 510 transitions. [2020-02-10 20:42:17,538 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 510 transitions. Word has length 19 [2020-02-10 20:42:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:17,538 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 510 transitions. [2020-02-10 20:42:17,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 510 transitions. [2020-02-10 20:42:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:17,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:17,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:17,538 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:17,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:17,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1988186406, now seen corresponding path program 395 times [2020-02-10 20:42:17,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:17,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705288953] [2020-02-10 20:42:17,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:17,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705288953] [2020-02-10 20:42:17,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:17,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:17,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089968123] [2020-02-10 20:42:17,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:17,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:17,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:17,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:17,732 INFO L87 Difference]: Start difference. First operand 179 states and 510 transitions. Second operand 8 states. [2020-02-10 20:42:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:17,812 INFO L93 Difference]: Finished difference Result 305 states and 745 transitions. [2020-02-10 20:42:17,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:17,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:17,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:17,813 INFO L225 Difference]: With dead ends: 305 [2020-02-10 20:42:17,813 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:42:17,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:42:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 183. [2020-02-10 20:42:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 20:42:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 518 transitions. [2020-02-10 20:42:17,818 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 518 transitions. Word has length 19 [2020-02-10 20:42:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:17,818 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 518 transitions. [2020-02-10 20:42:17,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 518 transitions. [2020-02-10 20:42:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:17,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:17,818 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:17,818 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1988781052, now seen corresponding path program 396 times [2020-02-10 20:42:17,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:17,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756515952] [2020-02-10 20:42:17,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:18,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756515952] [2020-02-10 20:42:18,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:18,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:18,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41298135] [2020-02-10 20:42:18,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:18,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:18,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:18,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:18,006 INFO L87 Difference]: Start difference. First operand 183 states and 518 transitions. Second operand 8 states. [2020-02-10 20:42:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:18,081 INFO L93 Difference]: Finished difference Result 294 states and 728 transitions. [2020-02-10 20:42:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:18,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:18,082 INFO L225 Difference]: With dead ends: 294 [2020-02-10 20:42:18,082 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 20:42:18,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 20:42:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 173. [2020-02-10 20:42:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-02-10 20:42:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 496 transitions. [2020-02-10 20:42:18,087 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 496 transitions. Word has length 19 [2020-02-10 20:42:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:18,087 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 496 transitions. [2020-02-10 20:42:18,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 496 transitions. [2020-02-10 20:42:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:18,088 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:18,088 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:18,088 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:18,088 INFO L82 PathProgramCache]: Analyzing trace with hash 986570822, now seen corresponding path program 397 times [2020-02-10 20:42:18,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:18,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252186925] [2020-02-10 20:42:18,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:18,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252186925] [2020-02-10 20:42:18,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:18,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:18,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137350723] [2020-02-10 20:42:18,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:18,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:18,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:18,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:18,279 INFO L87 Difference]: Start difference. First operand 173 states and 496 transitions. Second operand 8 states. [2020-02-10 20:42:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:18,337 INFO L93 Difference]: Finished difference Result 303 states and 733 transitions. [2020-02-10 20:42:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:18,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:18,339 INFO L225 Difference]: With dead ends: 303 [2020-02-10 20:42:18,339 INFO L226 Difference]: Without dead ends: 287 [2020-02-10 20:42:18,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-02-10 20:42:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 179. [2020-02-10 20:42:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 20:42:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 510 transitions. [2020-02-10 20:42:18,343 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 510 transitions. Word has length 19 [2020-02-10 20:42:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:18,343 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 510 transitions. [2020-02-10 20:42:18,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 510 transitions. [2020-02-10 20:42:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:18,344 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:18,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:18,344 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1165155724, now seen corresponding path program 398 times [2020-02-10 20:42:18,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:18,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033620029] [2020-02-10 20:42:18,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:18,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033620029] [2020-02-10 20:42:18,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:18,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:18,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047606123] [2020-02-10 20:42:18,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:18,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:18,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:18,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:18,555 INFO L87 Difference]: Start difference. First operand 179 states and 510 transitions. Second operand 8 states. [2020-02-10 20:42:18,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:18,636 INFO L93 Difference]: Finished difference Result 297 states and 718 transitions. [2020-02-10 20:42:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:18,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:18,637 INFO L225 Difference]: With dead ends: 297 [2020-02-10 20:42:18,637 INFO L226 Difference]: Without dead ends: 284 [2020-02-10 20:42:18,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-02-10 20:42:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 176. [2020-02-10 20:42:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-02-10 20:42:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 503 transitions. [2020-02-10 20:42:18,641 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 503 transitions. Word has length 19 [2020-02-10 20:42:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:18,642 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 503 transitions. [2020-02-10 20:42:18,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 503 transitions. [2020-02-10 20:42:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:18,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:18,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:18,642 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:18,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2080662410, now seen corresponding path program 399 times [2020-02-10 20:42:18,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:18,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317350662] [2020-02-10 20:42:18,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:18,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317350662] [2020-02-10 20:42:18,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:18,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:18,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113716750] [2020-02-10 20:42:18,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:18,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:18,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:18,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:18,835 INFO L87 Difference]: Start difference. First operand 176 states and 503 transitions. Second operand 8 states. [2020-02-10 20:42:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:18,895 INFO L93 Difference]: Finished difference Result 299 states and 727 transitions. [2020-02-10 20:42:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:18,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:18,897 INFO L225 Difference]: With dead ends: 299 [2020-02-10 20:42:18,897 INFO L226 Difference]: Without dead ends: 283 [2020-02-10 20:42:18,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-02-10 20:42:18,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 181. [2020-02-10 20:42:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-02-10 20:42:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 512 transitions. [2020-02-10 20:42:18,901 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 512 transitions. Word has length 19 [2020-02-10 20:42:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:18,902 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 512 transitions. [2020-02-10 20:42:18,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 512 transitions. [2020-02-10 20:42:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:18,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:18,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:18,903 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1329600316, now seen corresponding path program 400 times [2020-02-10 20:42:18,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:18,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147114092] [2020-02-10 20:42:18,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:19,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147114092] [2020-02-10 20:42:19,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:19,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:19,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10832082] [2020-02-10 20:42:19,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:19,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:19,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:19,092 INFO L87 Difference]: Start difference. First operand 181 states and 512 transitions. Second operand 8 states. [2020-02-10 20:42:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:19,170 INFO L93 Difference]: Finished difference Result 286 states and 706 transitions. [2020-02-10 20:42:19,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:19,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:19,171 INFO L225 Difference]: With dead ends: 286 [2020-02-10 20:42:19,171 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 20:42:19,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 20:42:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 176. [2020-02-10 20:42:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-02-10 20:42:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 500 transitions. [2020-02-10 20:42:19,176 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 500 transitions. Word has length 19 [2020-02-10 20:42:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:19,176 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 500 transitions. [2020-02-10 20:42:19,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 500 transitions. [2020-02-10 20:42:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:19,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:19,177 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:19,177 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:19,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1804719824, now seen corresponding path program 401 times [2020-02-10 20:42:19,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:19,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480049748] [2020-02-10 20:42:19,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:19,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480049748] [2020-02-10 20:42:19,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:19,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:19,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732974581] [2020-02-10 20:42:19,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:19,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:19,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:19,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:19,366 INFO L87 Difference]: Start difference. First operand 176 states and 500 transitions. Second operand 8 states. [2020-02-10 20:42:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:19,438 INFO L93 Difference]: Finished difference Result 290 states and 703 transitions. [2020-02-10 20:42:19,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:19,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:19,439 INFO L225 Difference]: With dead ends: 290 [2020-02-10 20:42:19,439 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 20:42:19,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 20:42:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 178. [2020-02-10 20:42:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-02-10 20:42:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 503 transitions. [2020-02-10 20:42:19,443 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 503 transitions. Word has length 19 [2020-02-10 20:42:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:19,443 INFO L479 AbstractCegarLoop]: Abstraction has 178 states and 503 transitions. [2020-02-10 20:42:19,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 503 transitions. [2020-02-10 20:42:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:19,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:19,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:19,444 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash -94106516, now seen corresponding path program 402 times [2020-02-10 20:42:19,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:19,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603089935] [2020-02-10 20:42:19,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:19,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603089935] [2020-02-10 20:42:19,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:19,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:19,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294404154] [2020-02-10 20:42:19,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:19,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:19,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:19,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:19,636 INFO L87 Difference]: Start difference. First operand 178 states and 503 transitions. Second operand 8 states. [2020-02-10 20:42:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:19,710 INFO L93 Difference]: Finished difference Result 283 states and 697 transitions. [2020-02-10 20:42:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:19,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:19,711 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:42:19,711 INFO L226 Difference]: Without dead ends: 266 [2020-02-10 20:42:19,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-02-10 20:42:19,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 173. [2020-02-10 20:42:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-02-10 20:42:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 493 transitions. [2020-02-10 20:42:19,716 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 493 transitions. Word has length 19 [2020-02-10 20:42:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:19,716 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 493 transitions. [2020-02-10 20:42:19,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 493 transitions. [2020-02-10 20:42:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:19,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:19,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:19,716 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash 196668370, now seen corresponding path program 403 times [2020-02-10 20:42:19,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:19,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022628015] [2020-02-10 20:42:19,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:19,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022628015] [2020-02-10 20:42:19,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:19,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:19,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494504019] [2020-02-10 20:42:19,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:19,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:19,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:19,885 INFO L87 Difference]: Start difference. First operand 173 states and 493 transitions. Second operand 8 states. [2020-02-10 20:42:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:19,962 INFO L93 Difference]: Finished difference Result 294 states and 714 transitions. [2020-02-10 20:42:19,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:19,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:19,963 INFO L225 Difference]: With dead ends: 294 [2020-02-10 20:42:19,963 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 20:42:19,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 20:42:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 177. [2020-02-10 20:42:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:42:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 503 transitions. [2020-02-10 20:42:19,967 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 503 transitions. Word has length 19 [2020-02-10 20:42:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:19,967 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 503 transitions. [2020-02-10 20:42:19,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 503 transitions. [2020-02-10 20:42:19,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:19,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:19,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:19,968 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:19,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash -677666956, now seen corresponding path program 404 times [2020-02-10 20:42:19,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:19,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542572696] [2020-02-10 20:42:19,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:20,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542572696] [2020-02-10 20:42:20,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:20,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:20,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491757650] [2020-02-10 20:42:20,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:20,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:20,142 INFO L87 Difference]: Start difference. First operand 177 states and 503 transitions. Second operand 8 states. [2020-02-10 20:42:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:20,215 INFO L93 Difference]: Finished difference Result 290 states and 703 transitions. [2020-02-10 20:42:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:20,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:20,216 INFO L225 Difference]: With dead ends: 290 [2020-02-10 20:42:20,216 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 20:42:20,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 20:42:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 175. [2020-02-10 20:42:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-02-10 20:42:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 498 transitions. [2020-02-10 20:42:20,221 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 498 transitions. Word has length 19 [2020-02-10 20:42:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:20,221 INFO L479 AbstractCegarLoop]: Abstraction has 175 states and 498 transitions. [2020-02-10 20:42:20,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 498 transitions. [2020-02-10 20:42:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:20,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:20,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:20,222 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:20,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1686073366, now seen corresponding path program 405 times [2020-02-10 20:42:20,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:20,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102548815] [2020-02-10 20:42:20,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:20,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102548815] [2020-02-10 20:42:20,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:20,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:20,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263394578] [2020-02-10 20:42:20,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:20,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:20,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:20,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:20,395 INFO L87 Difference]: Start difference. First operand 175 states and 498 transitions. Second operand 8 states. [2020-02-10 20:42:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:20,472 INFO L93 Difference]: Finished difference Result 292 states and 712 transitions. [2020-02-10 20:42:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:20,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:20,473 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:42:20,473 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 20:42:20,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 20:42:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 179. [2020-02-10 20:42:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 20:42:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 506 transitions. [2020-02-10 20:42:20,477 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 506 transitions. Word has length 19 [2020-02-10 20:42:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:20,478 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 506 transitions. [2020-02-10 20:42:20,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 506 transitions. [2020-02-10 20:42:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:20,478 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:20,478 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:20,478 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash 940776222, now seen corresponding path program 406 times [2020-02-10 20:42:20,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:20,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561485772] [2020-02-10 20:42:20,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:20,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561485772] [2020-02-10 20:42:20,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:20,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:20,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387813049] [2020-02-10 20:42:20,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:20,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:20,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:20,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:20,647 INFO L87 Difference]: Start difference. First operand 179 states and 506 transitions. Second operand 8 states. [2020-02-10 20:42:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:20,724 INFO L93 Difference]: Finished difference Result 281 states and 695 transitions. [2020-02-10 20:42:20,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:20,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:20,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:20,725 INFO L225 Difference]: With dead ends: 281 [2020-02-10 20:42:20,725 INFO L226 Difference]: Without dead ends: 265 [2020-02-10 20:42:20,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-02-10 20:42:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 175. [2020-02-10 20:42:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-02-10 20:42:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 496 transitions. [2020-02-10 20:42:20,729 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 496 transitions. Word has length 19 [2020-02-10 20:42:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:20,729 INFO L479 AbstractCegarLoop]: Abstraction has 175 states and 496 transitions. [2020-02-10 20:42:20,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 496 transitions. [2020-02-10 20:42:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:20,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:20,730 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:20,730 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1249121762, now seen corresponding path program 407 times [2020-02-10 20:42:20,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:20,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95348909] [2020-02-10 20:42:20,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:20,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95348909] [2020-02-10 20:42:20,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:20,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:20,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069526300] [2020-02-10 20:42:20,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:20,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:20,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:20,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:20,907 INFO L87 Difference]: Start difference. First operand 175 states and 496 transitions. Second operand 8 states. [2020-02-10 20:42:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:20,979 INFO L93 Difference]: Finished difference Result 286 states and 694 transitions. [2020-02-10 20:42:20,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:20,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:20,980 INFO L225 Difference]: With dead ends: 286 [2020-02-10 20:42:20,980 INFO L226 Difference]: Without dead ends: 276 [2020-02-10 20:42:20,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-02-10 20:42:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2020-02-10 20:42:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:42:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 499 transitions. [2020-02-10 20:42:20,985 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 499 transitions. Word has length 19 [2020-02-10 20:42:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:20,985 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 499 transitions. [2020-02-10 20:42:20,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 499 transitions. [2020-02-10 20:42:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:20,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:20,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:20,986 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:20,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:20,986 INFO L82 PathProgramCache]: Analyzing trace with hash 461491546, now seen corresponding path program 408 times [2020-02-10 20:42:20,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:20,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207347101] [2020-02-10 20:42:20,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:21,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207347101] [2020-02-10 20:42:21,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:21,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:21,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141240142] [2020-02-10 20:42:21,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:21,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:21,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:21,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:21,162 INFO L87 Difference]: Start difference. First operand 177 states and 499 transitions. Second operand 8 states. [2020-02-10 20:42:21,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:21,245 INFO L93 Difference]: Finished difference Result 279 states and 688 transitions. [2020-02-10 20:42:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:21,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:21,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:21,246 INFO L225 Difference]: With dead ends: 279 [2020-02-10 20:42:21,246 INFO L226 Difference]: Without dead ends: 259 [2020-02-10 20:42:21,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-02-10 20:42:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 169. [2020-02-10 20:42:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-02-10 20:42:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 485 transitions. [2020-02-10 20:42:21,250 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 485 transitions. Word has length 19 [2020-02-10 20:42:21,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:21,251 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 485 transitions. [2020-02-10 20:42:21,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:21,251 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 485 transitions. [2020-02-10 20:42:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:21,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:21,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:21,251 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:21,251 INFO L82 PathProgramCache]: Analyzing trace with hash -612467258, now seen corresponding path program 409 times [2020-02-10 20:42:21,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:21,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452282649] [2020-02-10 20:42:21,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:21,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452282649] [2020-02-10 20:42:21,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:21,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:21,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747354066] [2020-02-10 20:42:21,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:21,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:21,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:21,450 INFO L87 Difference]: Start difference. First operand 169 states and 485 transitions. Second operand 8 states. [2020-02-10 20:42:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:21,502 INFO L93 Difference]: Finished difference Result 305 states and 732 transitions. [2020-02-10 20:42:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:21,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:21,503 INFO L225 Difference]: With dead ends: 305 [2020-02-10 20:42:21,503 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 20:42:21,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 20:42:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 177. [2020-02-10 20:42:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:42:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 499 transitions. [2020-02-10 20:42:21,507 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 499 transitions. Word has length 19 [2020-02-10 20:42:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:21,507 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 499 transitions. [2020-02-10 20:42:21,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 499 transitions. [2020-02-10 20:42:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:21,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:21,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:21,508 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:21,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:21,508 INFO L82 PathProgramCache]: Analyzing trace with hash -237816072, now seen corresponding path program 410 times [2020-02-10 20:42:21,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:21,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3864494] [2020-02-10 20:42:21,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:21,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3864494] [2020-02-10 20:42:21,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:21,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:21,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953447532] [2020-02-10 20:42:21,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:21,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:21,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:21,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:21,731 INFO L87 Difference]: Start difference. First operand 177 states and 499 transitions. Second operand 8 states. [2020-02-10 20:42:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:21,807 INFO L93 Difference]: Finished difference Result 303 states and 722 transitions. [2020-02-10 20:42:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:21,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:21,808 INFO L225 Difference]: With dead ends: 303 [2020-02-10 20:42:21,809 INFO L226 Difference]: Without dead ends: 281 [2020-02-10 20:42:21,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-02-10 20:42:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 169. [2020-02-10 20:42:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-02-10 20:42:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 481 transitions. [2020-02-10 20:42:21,813 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 481 transitions. Word has length 19 [2020-02-10 20:42:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:21,813 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 481 transitions. [2020-02-10 20:42:21,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 481 transitions. [2020-02-10 20:42:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:21,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:21,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:21,813 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash -82269952, now seen corresponding path program 411 times [2020-02-10 20:42:21,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:21,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773713222] [2020-02-10 20:42:21,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:22,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773713222] [2020-02-10 20:42:22,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:22,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:22,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662830544] [2020-02-10 20:42:22,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:22,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:22,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:22,003 INFO L87 Difference]: Start difference. First operand 169 states and 481 transitions. Second operand 8 states. [2020-02-10 20:42:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:22,058 INFO L93 Difference]: Finished difference Result 296 states and 705 transitions. [2020-02-10 20:42:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:22,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:22,059 INFO L225 Difference]: With dead ends: 296 [2020-02-10 20:42:22,059 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 20:42:22,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 20:42:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 172. [2020-02-10 20:42:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-02-10 20:42:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 485 transitions. [2020-02-10 20:42:22,064 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 485 transitions. Word has length 19 [2020-02-10 20:42:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:22,064 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 485 transitions. [2020-02-10 20:42:22,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 485 transitions. [2020-02-10 20:42:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:22,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:22,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:22,065 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash 176788274, now seen corresponding path program 412 times [2020-02-10 20:42:22,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:22,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884832129] [2020-02-10 20:42:22,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:22,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884832129] [2020-02-10 20:42:22,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:22,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:22,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866399774] [2020-02-10 20:42:22,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:22,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:22,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:22,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:22,251 INFO L87 Difference]: Start difference. First operand 172 states and 485 transitions. Second operand 8 states. [2020-02-10 20:42:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:22,309 INFO L93 Difference]: Finished difference Result 290 states and 690 transitions. [2020-02-10 20:42:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:22,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:22,310 INFO L225 Difference]: With dead ends: 290 [2020-02-10 20:42:22,310 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 20:42:22,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 20:42:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 169. [2020-02-10 20:42:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-02-10 20:42:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 478 transitions. [2020-02-10 20:42:22,314 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 478 transitions. Word has length 19 [2020-02-10 20:42:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:22,314 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 478 transitions. [2020-02-10 20:42:22,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 478 transitions. [2020-02-10 20:42:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:22,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:22,315 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:22,315 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1840035768, now seen corresponding path program 413 times [2020-02-10 20:42:22,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:22,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93936354] [2020-02-10 20:42:22,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:22,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93936354] [2020-02-10 20:42:22,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:22,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:22,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47523425] [2020-02-10 20:42:22,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:22,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:22,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:22,501 INFO L87 Difference]: Start difference. First operand 169 states and 478 transitions. Second operand 8 states. [2020-02-10 20:42:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:22,572 INFO L93 Difference]: Finished difference Result 291 states and 694 transitions. [2020-02-10 20:42:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:22,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:22,573 INFO L225 Difference]: With dead ends: 291 [2020-02-10 20:42:22,573 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 20:42:22,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 20:42:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. [2020-02-10 20:42:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-02-10 20:42:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 481 transitions. [2020-02-10 20:42:22,578 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 481 transitions. Word has length 19 [2020-02-10 20:42:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:22,578 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 481 transitions. [2020-02-10 20:42:22,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 481 transitions. [2020-02-10 20:42:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:22,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:22,579 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:22,579 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:22,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1334801698, now seen corresponding path program 414 times [2020-02-10 20:42:22,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:22,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273869707] [2020-02-10 20:42:22,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:22,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273869707] [2020-02-10 20:42:22,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:22,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:22,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140514841] [2020-02-10 20:42:22,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:22,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:22,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:22,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:22,772 INFO L87 Difference]: Start difference. First operand 171 states and 481 transitions. Second operand 8 states. [2020-02-10 20:42:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:22,827 INFO L93 Difference]: Finished difference Result 287 states and 683 transitions. [2020-02-10 20:42:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:22,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:22,828 INFO L225 Difference]: With dead ends: 287 [2020-02-10 20:42:22,828 INFO L226 Difference]: Without dead ends: 271 [2020-02-10 20:42:22,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-02-10 20:42:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 165. [2020-02-10 20:42:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-02-10 20:42:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 469 transitions. [2020-02-10 20:42:22,833 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 469 transitions. Word has length 19 [2020-02-10 20:42:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:22,833 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 469 transitions. [2020-02-10 20:42:22,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 469 transitions. [2020-02-10 20:42:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:22,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:22,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:22,834 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:22,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:22,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1034952984, now seen corresponding path program 415 times [2020-02-10 20:42:22,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:22,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428954350] [2020-02-10 20:42:22,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:23,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428954350] [2020-02-10 20:42:23,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:23,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:23,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221362075] [2020-02-10 20:42:23,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:23,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:23,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:23,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:23,034 INFO L87 Difference]: Start difference. First operand 165 states and 469 transitions. Second operand 8 states. [2020-02-10 20:42:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:23,089 INFO L93 Difference]: Finished difference Result 299 states and 714 transitions. [2020-02-10 20:42:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:23,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:23,090 INFO L225 Difference]: With dead ends: 299 [2020-02-10 20:42:23,090 INFO L226 Difference]: Without dead ends: 283 [2020-02-10 20:42:23,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-02-10 20:42:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 165. [2020-02-10 20:42:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-02-10 20:42:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 462 transitions. [2020-02-10 20:42:23,094 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 462 transitions. Word has length 19 [2020-02-10 20:42:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:23,094 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 462 transitions. [2020-02-10 20:42:23,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 462 transitions. [2020-02-10 20:42:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:23,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:23,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:23,094 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:23,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:23,095 INFO L82 PathProgramCache]: Analyzing trace with hash -660301798, now seen corresponding path program 416 times [2020-02-10 20:42:23,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:23,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079109287] [2020-02-10 20:42:23,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:23,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079109287] [2020-02-10 20:42:23,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:23,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:23,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693555587] [2020-02-10 20:42:23,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:23,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:23,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:23,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:23,289 INFO L87 Difference]: Start difference. First operand 165 states and 462 transitions. Second operand 8 states. [2020-02-10 20:42:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:23,358 INFO L93 Difference]: Finished difference Result 297 states and 704 transitions. [2020-02-10 20:42:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:23,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:23,359 INFO L225 Difference]: With dead ends: 297 [2020-02-10 20:42:23,360 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 20:42:23,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 20:42:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 157. [2020-02-10 20:42:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:42:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 442 transitions. [2020-02-10 20:42:23,364 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 442 transitions. Word has length 19 [2020-02-10 20:42:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:23,364 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 442 transitions. [2020-02-10 20:42:23,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 442 transitions. [2020-02-10 20:42:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:23,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:23,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:23,365 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash -179159454, now seen corresponding path program 417 times [2020-02-10 20:42:23,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:23,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586314867] [2020-02-10 20:42:23,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:23,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586314867] [2020-02-10 20:42:23,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:23,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:23,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265860160] [2020-02-10 20:42:23,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:23,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:23,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:23,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:23,555 INFO L87 Difference]: Start difference. First operand 157 states and 442 transitions. Second operand 8 states. [2020-02-10 20:42:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:23,611 INFO L93 Difference]: Finished difference Result 286 states and 682 transitions. [2020-02-10 20:42:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:23,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:23,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:23,612 INFO L225 Difference]: With dead ends: 286 [2020-02-10 20:42:23,612 INFO L226 Difference]: Without dead ends: 270 [2020-02-10 20:42:23,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-02-10 20:42:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 162. [2020-02-10 20:42:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-02-10 20:42:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 451 transitions. [2020-02-10 20:42:23,616 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 451 transitions. Word has length 19 [2020-02-10 20:42:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:23,616 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 451 transitions. [2020-02-10 20:42:23,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 451 transitions. [2020-02-10 20:42:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:23,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:23,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:23,617 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:23,617 INFO L82 PathProgramCache]: Analyzing trace with hash -930221548, now seen corresponding path program 418 times [2020-02-10 20:42:23,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:23,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535220061] [2020-02-10 20:42:23,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:23,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535220061] [2020-02-10 20:42:23,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:23,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:23,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824461427] [2020-02-10 20:42:23,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:23,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:23,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:23,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:23,810 INFO L87 Difference]: Start difference. First operand 162 states and 451 transitions. Second operand 8 states. [2020-02-10 20:42:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:23,902 INFO L93 Difference]: Finished difference Result 273 states and 661 transitions. [2020-02-10 20:42:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:23,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:23,903 INFO L225 Difference]: With dead ends: 273 [2020-02-10 20:42:23,903 INFO L226 Difference]: Without dead ends: 256 [2020-02-10 20:42:23,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-02-10 20:42:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 157. [2020-02-10 20:42:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:42:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 437 transitions. [2020-02-10 20:42:23,907 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 437 transitions. Word has length 19 [2020-02-10 20:42:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:23,907 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 437 transitions. [2020-02-10 20:42:23,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 437 transitions. [2020-02-10 20:42:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:23,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:23,908 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:23,908 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2094625272, now seen corresponding path program 419 times [2020-02-10 20:42:23,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:23,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917243144] [2020-02-10 20:42:23,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:24,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917243144] [2020-02-10 20:42:24,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:24,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:24,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323515095] [2020-02-10 20:42:24,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:24,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:24,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:24,091 INFO L87 Difference]: Start difference. First operand 157 states and 437 transitions. Second operand 8 states. [2020-02-10 20:42:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:24,162 INFO L93 Difference]: Finished difference Result 283 states and 672 transitions. [2020-02-10 20:42:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:24,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:24,163 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:42:24,163 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 20:42:24,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 20:42:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 161. [2020-02-10 20:42:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-02-10 20:42:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 445 transitions. [2020-02-10 20:42:24,167 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 445 transitions. Word has length 19 [2020-02-10 20:42:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:24,167 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 445 transitions. [2020-02-10 20:42:24,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 445 transitions. [2020-02-10 20:42:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:24,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:24,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:24,167 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:24,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2094030626, now seen corresponding path program 420 times [2020-02-10 20:42:24,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:24,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247535808] [2020-02-10 20:42:24,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:24,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247535808] [2020-02-10 20:42:24,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:24,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:24,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881362910] [2020-02-10 20:42:24,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:24,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:24,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:24,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:24,355 INFO L87 Difference]: Start difference. First operand 161 states and 445 transitions. Second operand 8 states. [2020-02-10 20:42:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:24,427 INFO L93 Difference]: Finished difference Result 272 states and 655 transitions. [2020-02-10 20:42:24,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:24,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:24,428 INFO L225 Difference]: With dead ends: 272 [2020-02-10 20:42:24,428 INFO L226 Difference]: Without dead ends: 250 [2020-02-10 20:42:24,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-02-10 20:42:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 151. [2020-02-10 20:42:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:42:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 423 transitions. [2020-02-10 20:42:24,433 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 423 transitions. Word has length 19 [2020-02-10 20:42:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:24,433 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 423 transitions. [2020-02-10 20:42:24,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 423 transitions. [2020-02-10 20:42:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:24,433 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:24,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:24,434 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash 677525702, now seen corresponding path program 421 times [2020-02-10 20:42:24,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:24,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353495276] [2020-02-10 20:42:24,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:24,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353495276] [2020-02-10 20:42:24,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:24,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:24,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995797926] [2020-02-10 20:42:24,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:24,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:24,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:24,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:24,619 INFO L87 Difference]: Start difference. First operand 151 states and 423 transitions. Second operand 8 states. [2020-02-10 20:42:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:24,679 INFO L93 Difference]: Finished difference Result 273 states and 645 transitions. [2020-02-10 20:42:24,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:24,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:24,680 INFO L225 Difference]: With dead ends: 273 [2020-02-10 20:42:24,680 INFO L226 Difference]: Without dead ends: 257 [2020-02-10 20:42:24,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-02-10 20:42:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 157. [2020-02-10 20:42:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:42:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 437 transitions. [2020-02-10 20:42:24,685 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 437 transitions. Word has length 19 [2020-02-10 20:42:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:24,685 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 437 transitions. [2020-02-10 20:42:24,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 437 transitions. [2020-02-10 20:42:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:24,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:24,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:24,686 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:24,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:24,686 INFO L82 PathProgramCache]: Analyzing trace with hash 936583928, now seen corresponding path program 422 times [2020-02-10 20:42:24,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:24,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540333911] [2020-02-10 20:42:24,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:24,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540333911] [2020-02-10 20:42:24,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:24,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:24,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536760863] [2020-02-10 20:42:24,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:24,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:24,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:24,872 INFO L87 Difference]: Start difference. First operand 157 states and 437 transitions. Second operand 8 states. [2020-02-10 20:42:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:24,939 INFO L93 Difference]: Finished difference Result 267 states and 630 transitions. [2020-02-10 20:42:24,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:24,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:24,940 INFO L225 Difference]: With dead ends: 267 [2020-02-10 20:42:24,940 INFO L226 Difference]: Without dead ends: 254 [2020-02-10 20:42:24,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-02-10 20:42:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 154. [2020-02-10 20:42:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:42:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 430 transitions. [2020-02-10 20:42:24,944 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 430 transitions. Word has length 19 [2020-02-10 20:42:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:24,944 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 430 transitions. [2020-02-10 20:42:24,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 430 transitions. [2020-02-10 20:42:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:24,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:24,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:24,945 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:24,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:24,945 INFO L82 PathProgramCache]: Analyzing trace with hash -922912152, now seen corresponding path program 423 times [2020-02-10 20:42:24,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:24,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677700180] [2020-02-10 20:42:24,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:25,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677700180] [2020-02-10 20:42:25,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:25,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:25,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026839132] [2020-02-10 20:42:25,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:25,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:25,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:25,144 INFO L87 Difference]: Start difference. First operand 154 states and 430 transitions. Second operand 8 states. [2020-02-10 20:42:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:25,205 INFO L93 Difference]: Finished difference Result 264 states and 625 transitions. [2020-02-10 20:42:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:25,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:25,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:25,206 INFO L225 Difference]: With dead ends: 264 [2020-02-10 20:42:25,206 INFO L226 Difference]: Without dead ends: 248 [2020-02-10 20:42:25,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-02-10 20:42:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 159. [2020-02-10 20:42:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-02-10 20:42:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 439 transitions. [2020-02-10 20:42:25,209 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 439 transitions. Word has length 19 [2020-02-10 20:42:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:25,209 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 439 transitions. [2020-02-10 20:42:25,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 439 transitions. [2020-02-10 20:42:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:25,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:25,210 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:25,210 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1673974246, now seen corresponding path program 424 times [2020-02-10 20:42:25,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:25,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286022101] [2020-02-10 20:42:25,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:25,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286022101] [2020-02-10 20:42:25,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:25,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:25,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823684555] [2020-02-10 20:42:25,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:25,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:25,403 INFO L87 Difference]: Start difference. First operand 159 states and 439 transitions. Second operand 8 states. [2020-02-10 20:42:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:25,482 INFO L93 Difference]: Finished difference Result 251 states and 604 transitions. [2020-02-10 20:42:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:25,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:25,483 INFO L225 Difference]: With dead ends: 251 [2020-02-10 20:42:25,483 INFO L226 Difference]: Without dead ends: 234 [2020-02-10 20:42:25,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:25,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-02-10 20:42:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 154. [2020-02-10 20:42:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:42:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 427 transitions. [2020-02-10 20:42:25,487 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 427 transitions. Word has length 19 [2020-02-10 20:42:25,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:25,488 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 427 transitions. [2020-02-10 20:42:25,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 427 transitions. [2020-02-10 20:42:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:25,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:25,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:25,488 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:25,489 INFO L82 PathProgramCache]: Analyzing trace with hash -522490524, now seen corresponding path program 425 times [2020-02-10 20:42:25,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:25,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800089761] [2020-02-10 20:42:25,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:25,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800089761] [2020-02-10 20:42:25,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:25,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:25,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919154175] [2020-02-10 20:42:25,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:25,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:25,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:25,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:25,683 INFO L87 Difference]: Start difference. First operand 154 states and 427 transitions. Second operand 8 states. [2020-02-10 20:42:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:25,748 INFO L93 Difference]: Finished difference Result 246 states and 592 transitions. [2020-02-10 20:42:25,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:25,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:25,749 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:42:25,749 INFO L226 Difference]: Without dead ends: 236 [2020-02-10 20:42:25,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-02-10 20:42:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 156. [2020-02-10 20:42:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-02-10 20:42:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 430 transitions. [2020-02-10 20:42:25,753 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 430 transitions. Word has length 19 [2020-02-10 20:42:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:25,753 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 430 transitions. [2020-02-10 20:42:25,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 430 transitions. [2020-02-10 20:42:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:25,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:25,753 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:25,753 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:25,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1377797178, now seen corresponding path program 426 times [2020-02-10 20:42:25,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:25,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857701336] [2020-02-10 20:42:25,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:25,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857701336] [2020-02-10 20:42:25,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:25,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:25,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293606930] [2020-02-10 20:42:25,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:25,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:25,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:25,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:25,944 INFO L87 Difference]: Start difference. First operand 156 states and 430 transitions. Second operand 8 states. [2020-02-10 20:42:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:26,024 INFO L93 Difference]: Finished difference Result 235 states and 578 transitions. [2020-02-10 20:42:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:26,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:26,025 INFO L225 Difference]: With dead ends: 235 [2020-02-10 20:42:26,025 INFO L226 Difference]: Without dead ends: 218 [2020-02-10 20:42:26,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-02-10 20:42:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 151. [2020-02-10 20:42:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:42:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 420 transitions. [2020-02-10 20:42:26,029 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 420 transitions. Word has length 19 [2020-02-10 20:42:26,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:26,029 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 420 transitions. [2020-02-10 20:42:26,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 420 transitions. [2020-02-10 20:42:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:26,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:26,030 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:26,030 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:26,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:26,031 INFO L82 PathProgramCache]: Analyzing trace with hash -722039428, now seen corresponding path program 427 times [2020-02-10 20:42:26,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:26,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853598264] [2020-02-10 20:42:26,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:26,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853598264] [2020-02-10 20:42:26,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:26,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:26,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746011874] [2020-02-10 20:42:26,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:26,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:26,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:26,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:26,212 INFO L87 Difference]: Start difference. First operand 151 states and 420 transitions. Second operand 8 states. [2020-02-10 20:42:26,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:26,283 INFO L93 Difference]: Finished difference Result 266 states and 629 transitions. [2020-02-10 20:42:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:26,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:26,284 INFO L225 Difference]: With dead ends: 266 [2020-02-10 20:42:26,284 INFO L226 Difference]: Without dead ends: 252 [2020-02-10 20:42:26,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-02-10 20:42:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 155. [2020-02-10 20:42:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 20:42:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 430 transitions. [2020-02-10 20:42:26,289 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 430 transitions. Word has length 19 [2020-02-10 20:42:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:26,289 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 430 transitions. [2020-02-10 20:42:26,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 430 transitions. [2020-02-10 20:42:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:26,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:26,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:26,289 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:26,290 INFO L82 PathProgramCache]: Analyzing trace with hash 398090402, now seen corresponding path program 428 times [2020-02-10 20:42:26,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:26,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282121071] [2020-02-10 20:42:26,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:26,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282121071] [2020-02-10 20:42:26,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:26,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:26,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725540420] [2020-02-10 20:42:26,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:26,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:26,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:26,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:26,473 INFO L87 Difference]: Start difference. First operand 155 states and 430 transitions. Second operand 8 states. [2020-02-10 20:42:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:26,532 INFO L93 Difference]: Finished difference Result 262 states and 618 transitions. [2020-02-10 20:42:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:26,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:26,533 INFO L225 Difference]: With dead ends: 262 [2020-02-10 20:42:26,533 INFO L226 Difference]: Without dead ends: 250 [2020-02-10 20:42:26,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-02-10 20:42:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 153. [2020-02-10 20:42:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-02-10 20:42:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 425 transitions. [2020-02-10 20:42:26,537 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 425 transitions. Word has length 19 [2020-02-10 20:42:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:26,537 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 425 transitions. [2020-02-10 20:42:26,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 425 transitions. [2020-02-10 20:42:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:26,537 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:26,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:26,537 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1466741926, now seen corresponding path program 429 times [2020-02-10 20:42:26,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:26,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968225949] [2020-02-10 20:42:26,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:26,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968225949] [2020-02-10 20:42:26,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:26,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:26,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544745617] [2020-02-10 20:42:26,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:26,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:26,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:26,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:26,706 INFO L87 Difference]: Start difference. First operand 153 states and 425 transitions. Second operand 8 states. [2020-02-10 20:42:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:26,781 INFO L93 Difference]: Finished difference Result 260 states and 615 transitions. [2020-02-10 20:42:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:26,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:26,782 INFO L225 Difference]: With dead ends: 260 [2020-02-10 20:42:26,782 INFO L226 Difference]: Without dead ends: 246 [2020-02-10 20:42:26,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-02-10 20:42:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 157. [2020-02-10 20:42:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:42:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 433 transitions. [2020-02-10 20:42:26,785 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 433 transitions. Word has length 19 [2020-02-10 20:42:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:26,785 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 433 transitions. [2020-02-10 20:42:26,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 433 transitions. [2020-02-10 20:42:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:26,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:26,786 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:26,786 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:26,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2082928226, now seen corresponding path program 430 times [2020-02-10 20:42:26,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:26,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019410687] [2020-02-10 20:42:26,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:26,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019410687] [2020-02-10 20:42:26,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:26,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:26,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180630630] [2020-02-10 20:42:26,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:26,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:26,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:26,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:26,959 INFO L87 Difference]: Start difference. First operand 157 states and 433 transitions. Second operand 8 states. [2020-02-10 20:42:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:27,036 INFO L93 Difference]: Finished difference Result 249 states and 598 transitions. [2020-02-10 20:42:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:27,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:27,042 INFO L225 Difference]: With dead ends: 249 [2020-02-10 20:42:27,042 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 20:42:27,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 20:42:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 153. [2020-02-10 20:42:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-02-10 20:42:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 423 transitions. [2020-02-10 20:42:27,045 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 423 transitions. Word has length 19 [2020-02-10 20:42:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:27,045 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 423 transitions. [2020-02-10 20:42:27,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 423 transitions. [2020-02-10 20:42:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:27,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:27,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:27,045 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash -137139400, now seen corresponding path program 431 times [2020-02-10 20:42:27,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:27,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061452734] [2020-02-10 20:42:27,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:27,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061452734] [2020-02-10 20:42:27,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:27,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:27,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133775401] [2020-02-10 20:42:27,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:27,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:27,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:27,226 INFO L87 Difference]: Start difference. First operand 153 states and 423 transitions. Second operand 8 states. [2020-02-10 20:42:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:27,291 INFO L93 Difference]: Finished difference Result 245 states and 588 transitions. [2020-02-10 20:42:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:27,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:27,292 INFO L225 Difference]: With dead ends: 245 [2020-02-10 20:42:27,292 INFO L226 Difference]: Without dead ends: 235 [2020-02-10 20:42:27,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-02-10 20:42:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 155. [2020-02-10 20:42:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 20:42:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 426 transitions. [2020-02-10 20:42:27,296 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 426 transitions. Word has length 19 [2020-02-10 20:42:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:27,296 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 426 transitions. [2020-02-10 20:42:27,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 426 transitions. [2020-02-10 20:42:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:27,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:27,297 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:27,297 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash -992446054, now seen corresponding path program 432 times [2020-02-10 20:42:27,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:27,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542360127] [2020-02-10 20:42:27,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:27,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542360127] [2020-02-10 20:42:27,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:27,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:27,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714095891] [2020-02-10 20:42:27,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:27,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:27,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:27,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:27,474 INFO L87 Difference]: Start difference. First operand 155 states and 426 transitions. Second operand 8 states. [2020-02-10 20:42:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:27,548 INFO L93 Difference]: Finished difference Result 234 states and 574 transitions. [2020-02-10 20:42:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:27,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:27,549 INFO L225 Difference]: With dead ends: 234 [2020-02-10 20:42:27,549 INFO L226 Difference]: Without dead ends: 214 [2020-02-10 20:42:27,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-02-10 20:42:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 147. [2020-02-10 20:42:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:42:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 412 transitions. [2020-02-10 20:42:27,552 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 412 transitions. Word has length 19 [2020-02-10 20:42:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:27,552 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 412 transitions. [2020-02-10 20:42:27,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 412 transitions. [2020-02-10 20:42:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:27,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:27,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:27,553 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:27,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:27,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1774006882, now seen corresponding path program 433 times [2020-02-10 20:42:27,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:27,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366936557] [2020-02-10 20:42:27,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:27,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366936557] [2020-02-10 20:42:27,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:27,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:27,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070264371] [2020-02-10 20:42:27,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:27,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:27,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:27,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:27,749 INFO L87 Difference]: Start difference. First operand 147 states and 412 transitions. Second operand 8 states. [2020-02-10 20:42:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:27,806 INFO L93 Difference]: Finished difference Result 260 states and 610 transitions. [2020-02-10 20:42:27,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:27,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:27,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:27,807 INFO L225 Difference]: With dead ends: 260 [2020-02-10 20:42:27,807 INFO L226 Difference]: Without dead ends: 244 [2020-02-10 20:42:27,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-02-10 20:42:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 154. [2020-02-10 20:42:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:42:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 430 transitions. [2020-02-10 20:42:27,811 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 430 transitions. Word has length 19 [2020-02-10 20:42:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:27,811 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 430 transitions. [2020-02-10 20:42:27,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 430 transitions. [2020-02-10 20:42:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:27,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:27,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:27,812 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:27,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash -377719664, now seen corresponding path program 434 times [2020-02-10 20:42:27,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:27,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685902281] [2020-02-10 20:42:27,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:28,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685902281] [2020-02-10 20:42:28,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:28,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:28,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026497413] [2020-02-10 20:42:28,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:28,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:28,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:28,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:28,007 INFO L87 Difference]: Start difference. First operand 154 states and 430 transitions. Second operand 8 states. [2020-02-10 20:42:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:28,084 INFO L93 Difference]: Finished difference Result 254 states and 595 transitions. [2020-02-10 20:42:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:28,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:28,084 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:42:28,085 INFO L226 Difference]: Without dead ends: 241 [2020-02-10 20:42:28,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-02-10 20:42:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 151. [2020-02-10 20:42:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:42:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 424 transitions. [2020-02-10 20:42:28,089 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 424 transitions. Word has length 19 [2020-02-10 20:42:28,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:28,089 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 424 transitions. [2020-02-10 20:42:28,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 424 transitions. [2020-02-10 20:42:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:28,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:28,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:28,090 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:28,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:28,090 INFO L82 PathProgramCache]: Analyzing trace with hash 173569028, now seen corresponding path program 435 times [2020-02-10 20:42:28,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:28,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337539815] [2020-02-10 20:42:28,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:28,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337539815] [2020-02-10 20:42:28,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:28,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:28,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731145869] [2020-02-10 20:42:28,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:28,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:28,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:28,286 INFO L87 Difference]: Start difference. First operand 151 states and 424 transitions. Second operand 8 states. [2020-02-10 20:42:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:28,338 INFO L93 Difference]: Finished difference Result 260 states and 608 transitions. [2020-02-10 20:42:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:28,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:28,339 INFO L225 Difference]: With dead ends: 260 [2020-02-10 20:42:28,339 INFO L226 Difference]: Without dead ends: 244 [2020-02-10 20:42:28,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-02-10 20:42:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 154. [2020-02-10 20:42:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:42:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 428 transitions. [2020-02-10 20:42:28,343 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 428 transitions. Word has length 19 [2020-02-10 20:42:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:28,343 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 428 transitions. [2020-02-10 20:42:28,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 428 transitions. [2020-02-10 20:42:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:28,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:28,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:28,343 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:28,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash 432627254, now seen corresponding path program 436 times [2020-02-10 20:42:28,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:28,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186431060] [2020-02-10 20:42:28,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:28,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186431060] [2020-02-10 20:42:28,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:28,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:28,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102930427] [2020-02-10 20:42:28,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:28,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:28,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:28,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:28,535 INFO L87 Difference]: Start difference. First operand 154 states and 428 transitions. Second operand 8 states. [2020-02-10 20:42:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:28,592 INFO L93 Difference]: Finished difference Result 254 states and 593 transitions. [2020-02-10 20:42:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:28,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:28,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:28,593 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:42:28,593 INFO L226 Difference]: Without dead ends: 241 [2020-02-10 20:42:28,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:28,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-02-10 20:42:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 151. [2020-02-10 20:42:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:42:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 422 transitions. [2020-02-10 20:42:28,597 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 422 transitions. Word has length 19 [2020-02-10 20:42:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:28,598 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 422 transitions. [2020-02-10 20:42:28,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 422 transitions. [2020-02-10 20:42:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:28,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:28,598 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:28,598 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:28,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:28,598 INFO L82 PathProgramCache]: Analyzing trace with hash -807811068, now seen corresponding path program 437 times [2020-02-10 20:42:28,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:28,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847593586] [2020-02-10 20:42:28,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:28,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847593586] [2020-02-10 20:42:28,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:28,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:28,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910221578] [2020-02-10 20:42:28,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:28,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:28,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:28,805 INFO L87 Difference]: Start difference. First operand 151 states and 422 transitions. Second operand 8 states. [2020-02-10 20:42:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:28,882 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-02-10 20:42:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:28,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:28,883 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:42:28,883 INFO L226 Difference]: Without dead ends: 236 [2020-02-10 20:42:28,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:28,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-02-10 20:42:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 152. [2020-02-10 20:42:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-02-10 20:42:28,886 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-02-10 20:42:28,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:28,887 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-02-10 20:42:28,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-02-10 20:42:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:28,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:28,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:28,887 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:28,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1047453406, now seen corresponding path program 438 times [2020-02-10 20:42:28,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:28,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104217407] [2020-02-10 20:42:28,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:29,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104217407] [2020-02-10 20:42:29,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:29,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:29,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845395267] [2020-02-10 20:42:29,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:29,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:29,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:29,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:29,098 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-02-10 20:42:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:29,158 INFO L93 Difference]: Finished difference Result 246 states and 576 transitions. [2020-02-10 20:42:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:29,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:29,159 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:42:29,159 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 20:42:29,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 20:42:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 149. [2020-02-10 20:42:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 418 transitions. [2020-02-10 20:42:29,163 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 418 transitions. Word has length 19 [2020-02-10 20:42:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:29,164 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 418 transitions. [2020-02-10 20:42:29,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 418 transitions. [2020-02-10 20:42:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:29,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:29,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:29,164 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash -594926336, now seen corresponding path program 439 times [2020-02-10 20:42:29,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:29,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804136484] [2020-02-10 20:42:29,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:29,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804136484] [2020-02-10 20:42:29,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:29,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:29,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180067872] [2020-02-10 20:42:29,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:29,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:29,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:29,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:29,365 INFO L87 Difference]: Start difference. First operand 149 states and 418 transitions. Second operand 8 states. [2020-02-10 20:42:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:29,443 INFO L93 Difference]: Finished difference Result 258 states and 603 transitions. [2020-02-10 20:42:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:29,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:29,444 INFO L225 Difference]: With dead ends: 258 [2020-02-10 20:42:29,445 INFO L226 Difference]: Without dead ends: 242 [2020-02-10 20:42:29,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-02-10 20:42:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 155. [2020-02-10 20:42:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 20:42:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 432 transitions. [2020-02-10 20:42:29,448 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 432 transitions. Word has length 19 [2020-02-10 20:42:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:29,448 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 432 transitions. [2020-02-10 20:42:29,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 432 transitions. [2020-02-10 20:42:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:29,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:29,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:29,449 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:29,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:29,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1548314414, now seen corresponding path program 440 times [2020-02-10 20:42:29,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:29,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618797690] [2020-02-10 20:42:29,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:29,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618797690] [2020-02-10 20:42:29,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:29,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:29,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215491977] [2020-02-10 20:42:29,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:29,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:29,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:29,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:29,643 INFO L87 Difference]: Start difference. First operand 155 states and 432 transitions. Second operand 8 states. [2020-02-10 20:42:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:29,730 INFO L93 Difference]: Finished difference Result 252 states and 588 transitions. [2020-02-10 20:42:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:29,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:29,731 INFO L225 Difference]: With dead ends: 252 [2020-02-10 20:42:29,731 INFO L226 Difference]: Without dead ends: 239 [2020-02-10 20:42:29,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-02-10 20:42:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 152. [2020-02-10 20:42:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 425 transitions. [2020-02-10 20:42:29,735 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 425 transitions. Word has length 19 [2020-02-10 20:42:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:29,735 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 425 transitions. [2020-02-10 20:42:29,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 425 transitions. [2020-02-10 20:42:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:29,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:29,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:29,736 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:29,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:29,736 INFO L82 PathProgramCache]: Analyzing trace with hash 499165252, now seen corresponding path program 441 times [2020-02-10 20:42:29,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:29,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946813281] [2020-02-10 20:42:29,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:29,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946813281] [2020-02-10 20:42:29,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:29,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:29,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339964367] [2020-02-10 20:42:29,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:29,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:29,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:29,935 INFO L87 Difference]: Start difference. First operand 152 states and 425 transitions. Second operand 8 states. [2020-02-10 20:42:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:29,996 INFO L93 Difference]: Finished difference Result 254 states and 597 transitions. [2020-02-10 20:42:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:29,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:29,997 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:42:29,998 INFO L226 Difference]: Without dead ends: 238 [2020-02-10 20:42:29,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-02-10 20:42:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 157. [2020-02-10 20:42:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:42:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 434 transitions. [2020-02-10 20:42:30,001 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 434 transitions. Word has length 19 [2020-02-10 20:42:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:30,001 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 434 transitions. [2020-02-10 20:42:30,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 434 transitions. [2020-02-10 20:42:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:30,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:30,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:30,002 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:30,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash -251896842, now seen corresponding path program 442 times [2020-02-10 20:42:30,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:30,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694122400] [2020-02-10 20:42:30,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:30,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694122400] [2020-02-10 20:42:30,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:30,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:30,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047285520] [2020-02-10 20:42:30,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:30,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:30,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:30,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:30,206 INFO L87 Difference]: Start difference. First operand 157 states and 434 transitions. Second operand 8 states. [2020-02-10 20:42:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:30,283 INFO L93 Difference]: Finished difference Result 241 states and 576 transitions. [2020-02-10 20:42:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:30,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:30,284 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:42:30,284 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:42:30,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:42:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2020-02-10 20:42:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 422 transitions. [2020-02-10 20:42:30,288 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 422 transitions. Word has length 19 [2020-02-10 20:42:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:30,288 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 422 transitions. [2020-02-10 20:42:30,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 422 transitions. [2020-02-10 20:42:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:30,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:30,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:30,288 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:30,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:30,289 INFO L82 PathProgramCache]: Analyzing trace with hash 908750314, now seen corresponding path program 443 times [2020-02-10 20:42:30,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:30,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344424410] [2020-02-10 20:42:30,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:30,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344424410] [2020-02-10 20:42:30,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:30,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:30,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108583375] [2020-02-10 20:42:30,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:30,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:30,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:30,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:30,493 INFO L87 Difference]: Start difference. First operand 152 states and 422 transitions. Second operand 8 states. [2020-02-10 20:42:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:30,576 INFO L93 Difference]: Finished difference Result 245 states and 573 transitions. [2020-02-10 20:42:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:30,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:30,577 INFO L225 Difference]: With dead ends: 245 [2020-02-10 20:42:30,577 INFO L226 Difference]: Without dead ends: 235 [2020-02-10 20:42:30,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-02-10 20:42:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 154. [2020-02-10 20:42:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:42:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 425 transitions. [2020-02-10 20:42:30,580 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 425 transitions. Word has length 19 [2020-02-10 20:42:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:30,580 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 425 transitions. [2020-02-10 20:42:30,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 425 transitions. [2020-02-10 20:42:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:30,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:30,581 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:30,581 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:30,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:30,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1675603674, now seen corresponding path program 444 times [2020-02-10 20:42:30,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:30,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505704709] [2020-02-10 20:42:30,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:30,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505704709] [2020-02-10 20:42:30,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:30,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:30,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911611362] [2020-02-10 20:42:30,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:30,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:30,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:30,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:30,780 INFO L87 Difference]: Start difference. First operand 154 states and 425 transitions. Second operand 8 states. [2020-02-10 20:42:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:30,855 INFO L93 Difference]: Finished difference Result 238 states and 567 transitions. [2020-02-10 20:42:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:30,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:30,856 INFO L225 Difference]: With dead ends: 238 [2020-02-10 20:42:30,856 INFO L226 Difference]: Without dead ends: 221 [2020-02-10 20:42:30,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-02-10 20:42:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2020-02-10 20:42:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 416 transitions. [2020-02-10 20:42:30,860 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 416 transitions. Word has length 19 [2020-02-10 20:42:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:30,861 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 416 transitions. [2020-02-10 20:42:30,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 416 transitions. [2020-02-10 20:42:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:30,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:30,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:30,861 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash -269330112, now seen corresponding path program 445 times [2020-02-10 20:42:30,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:30,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127117158] [2020-02-10 20:42:30,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:31,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127117158] [2020-02-10 20:42:31,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:31,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:31,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732389955] [2020-02-10 20:42:31,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:31,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:31,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:31,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:31,063 INFO L87 Difference]: Start difference. First operand 149 states and 416 transitions. Second operand 8 states. [2020-02-10 20:42:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:31,121 INFO L93 Difference]: Finished difference Result 244 states and 569 transitions. [2020-02-10 20:42:31,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:31,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:31,123 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:42:31,123 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:42:31,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:42:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 155. [2020-02-10 20:42:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 20:42:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 430 transitions. [2020-02-10 20:42:31,126 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 430 transitions. Word has length 19 [2020-02-10 20:42:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:31,126 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 430 transitions. [2020-02-10 20:42:31,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 430 transitions. [2020-02-10 20:42:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:31,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:31,127 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:31,127 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash -10271886, now seen corresponding path program 446 times [2020-02-10 20:42:31,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:31,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627812396] [2020-02-10 20:42:31,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:31,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627812396] [2020-02-10 20:42:31,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:31,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:31,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104642507] [2020-02-10 20:42:31,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:31,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:31,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:31,328 INFO L87 Difference]: Start difference. First operand 155 states and 430 transitions. Second operand 8 states. [2020-02-10 20:42:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:31,382 INFO L93 Difference]: Finished difference Result 238 states and 554 transitions. [2020-02-10 20:42:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:31,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:31,383 INFO L225 Difference]: With dead ends: 238 [2020-02-10 20:42:31,383 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:42:31,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:42:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 152. [2020-02-10 20:42:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-02-10 20:42:31,386 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-02-10 20:42:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:31,386 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-02-10 20:42:31,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-02-10 20:42:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:31,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:31,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:31,387 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:31,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1869767966, now seen corresponding path program 447 times [2020-02-10 20:42:31,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:31,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008012747] [2020-02-10 20:42:31,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:31,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008012747] [2020-02-10 20:42:31,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:31,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:31,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524512822] [2020-02-10 20:42:31,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:31,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:31,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:31,590 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-02-10 20:42:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:31,648 INFO L93 Difference]: Finished difference Result 235 states and 549 transitions. [2020-02-10 20:42:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:31,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:31,649 INFO L225 Difference]: With dead ends: 235 [2020-02-10 20:42:31,649 INFO L226 Difference]: Without dead ends: 219 [2020-02-10 20:42:31,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-02-10 20:42:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 157. [2020-02-10 20:42:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:42:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 432 transitions. [2020-02-10 20:42:31,652 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 432 transitions. Word has length 19 [2020-02-10 20:42:31,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:31,653 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 432 transitions. [2020-02-10 20:42:31,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 432 transitions. [2020-02-10 20:42:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:31,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:31,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:31,653 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:31,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1674137236, now seen corresponding path program 448 times [2020-02-10 20:42:31,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:31,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255785465] [2020-02-10 20:42:31,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:31,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255785465] [2020-02-10 20:42:31,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:31,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:31,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469440144] [2020-02-10 20:42:31,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:31,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:31,855 INFO L87 Difference]: Start difference. First operand 157 states and 432 transitions. Second operand 8 states. [2020-02-10 20:42:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:31,938 INFO L93 Difference]: Finished difference Result 222 states and 528 transitions. [2020-02-10 20:42:31,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:31,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:31,939 INFO L225 Difference]: With dead ends: 222 [2020-02-10 20:42:31,939 INFO L226 Difference]: Without dead ends: 205 [2020-02-10 20:42:31,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-02-10 20:42:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2020-02-10 20:42:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 420 transitions. [2020-02-10 20:42:31,943 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 420 transitions. Word has length 19 [2020-02-10 20:42:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:31,943 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 420 transitions. [2020-02-10 20:42:31,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 420 transitions. [2020-02-10 20:42:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:31,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:31,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:31,944 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:31,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1469346338, now seen corresponding path program 449 times [2020-02-10 20:42:31,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:31,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765153354] [2020-02-10 20:42:31,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:32,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765153354] [2020-02-10 20:42:32,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:32,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:32,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657905829] [2020-02-10 20:42:32,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:32,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:32,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:32,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:32,146 INFO L87 Difference]: Start difference. First operand 152 states and 420 transitions. Second operand 8 states. [2020-02-10 20:42:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:32,201 INFO L93 Difference]: Finished difference Result 217 states and 516 transitions. [2020-02-10 20:42:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:32,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:32,202 INFO L225 Difference]: With dead ends: 217 [2020-02-10 20:42:32,202 INFO L226 Difference]: Without dead ends: 207 [2020-02-10 20:42:32,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:32,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-02-10 20:42:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 154. [2020-02-10 20:42:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:42:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 423 transitions. [2020-02-10 20:42:32,205 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 423 transitions. Word has length 19 [2020-02-10 20:42:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:32,205 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 423 transitions. [2020-02-10 20:42:32,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 423 transitions. [2020-02-10 20:42:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:32,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:32,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:32,206 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1970314304, now seen corresponding path program 450 times [2020-02-10 20:42:32,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:32,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139281050] [2020-02-10 20:42:32,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:32,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139281050] [2020-02-10 20:42:32,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:32,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:32,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549642133] [2020-02-10 20:42:32,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:32,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:32,405 INFO L87 Difference]: Start difference. First operand 154 states and 423 transitions. Second operand 8 states. [2020-02-10 20:42:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:32,479 INFO L93 Difference]: Finished difference Result 206 states and 502 transitions. [2020-02-10 20:42:32,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:32,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:32,479 INFO L225 Difference]: With dead ends: 206 [2020-02-10 20:42:32,479 INFO L226 Difference]: Without dead ends: 189 [2020-02-10 20:42:32,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-02-10 20:42:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2020-02-10 20:42:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 414 transitions. [2020-02-10 20:42:32,484 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 414 transitions. Word has length 19 [2020-02-10 20:42:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:32,484 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 414 transitions. [2020-02-10 20:42:32,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 414 transitions. [2020-02-10 20:42:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:32,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:32,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:32,484 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:32,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:32,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1205521176, now seen corresponding path program 451 times [2020-02-10 20:42:32,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:32,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208653736] [2020-02-10 20:42:32,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:32,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208653736] [2020-02-10 20:42:32,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:32,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:32,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026230775] [2020-02-10 20:42:32,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:32,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:32,692 INFO L87 Difference]: Start difference. First operand 149 states and 414 transitions. Second operand 8 states. [2020-02-10 20:42:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:32,770 INFO L93 Difference]: Finished difference Result 214 states and 510 transitions. [2020-02-10 20:42:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:32,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:32,771 INFO L225 Difference]: With dead ends: 214 [2020-02-10 20:42:32,771 INFO L226 Difference]: Without dead ends: 204 [2020-02-10 20:42:32,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-02-10 20:42:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 151. [2020-02-10 20:42:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:42:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 418 transitions. [2020-02-10 20:42:32,776 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 418 transitions. Word has length 19 [2020-02-10 20:42:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:32,776 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 418 transitions. [2020-02-10 20:42:32,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 418 transitions. [2020-02-10 20:42:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:32,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:32,776 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:32,776 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash 965878838, now seen corresponding path program 452 times [2020-02-10 20:42:32,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:32,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576543031] [2020-02-10 20:42:32,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:32,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576543031] [2020-02-10 20:42:32,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:32,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:32,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573396978] [2020-02-10 20:42:32,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:32,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:32,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:32,994 INFO L87 Difference]: Start difference. First operand 151 states and 418 transitions. Second operand 8 states. [2020-02-10 20:42:33,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:33,054 INFO L93 Difference]: Finished difference Result 214 states and 509 transitions. [2020-02-10 20:42:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:33,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:33,055 INFO L225 Difference]: With dead ends: 214 [2020-02-10 20:42:33,055 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 20:42:33,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 20:42:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-02-10 20:42:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:42:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 20:42:33,059 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 20:42:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:33,060 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 20:42:33,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 20:42:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:33,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:33,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:33,060 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:33,060 INFO L82 PathProgramCache]: Analyzing trace with hash 460818678, now seen corresponding path program 453 times [2020-02-10 20:42:33,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:33,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538882113] [2020-02-10 20:42:33,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:33,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538882113] [2020-02-10 20:42:33,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:33,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:33,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188825468] [2020-02-10 20:42:33,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:33,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:33,263 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 20:42:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:33,337 INFO L93 Difference]: Finished difference Result 211 states and 504 transitions. [2020-02-10 20:42:33,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:33,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:33,338 INFO L225 Difference]: With dead ends: 211 [2020-02-10 20:42:33,338 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 20:42:33,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 20:42:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2020-02-10 20:42:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 419 transitions. [2020-02-10 20:42:33,341 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 419 transitions. Word has length 19 [2020-02-10 20:42:33,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:33,341 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 419 transitions. [2020-02-10 20:42:33,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 419 transitions. [2020-02-10 20:42:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:33,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:33,342 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:33,342 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2123535310, now seen corresponding path program 454 times [2020-02-10 20:42:33,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:33,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970283291] [2020-02-10 20:42:33,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:33,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970283291] [2020-02-10 20:42:33,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:33,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:33,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330640775] [2020-02-10 20:42:33,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:33,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:33,566 INFO L87 Difference]: Start difference. First operand 152 states and 419 transitions. Second operand 8 states. [2020-02-10 20:42:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:33,647 INFO L93 Difference]: Finished difference Result 204 states and 498 transitions. [2020-02-10 20:42:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:33,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:33,648 INFO L225 Difference]: With dead ends: 204 [2020-02-10 20:42:33,648 INFO L226 Difference]: Without dead ends: 190 [2020-02-10 20:42:33,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-02-10 20:42:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2020-02-10 20:42:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:42:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-02-10 20:42:33,652 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-02-10 20:42:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:33,652 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-02-10 20:42:33,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-02-10 20:42:33,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:33,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:33,652 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:33,653 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:33,653 INFO L82 PathProgramCache]: Analyzing trace with hash -107206542, now seen corresponding path program 455 times [2020-02-10 20:42:33,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:33,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568417117] [2020-02-10 20:42:33,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:33,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568417117] [2020-02-10 20:42:33,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:33,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:33,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167678592] [2020-02-10 20:42:33,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:33,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:33,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:33,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:33,861 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-02-10 20:42:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:33,915 INFO L93 Difference]: Finished difference Result 198 states and 486 transitions. [2020-02-10 20:42:33,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:33,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:33,916 INFO L225 Difference]: With dead ends: 198 [2020-02-10 20:42:33,916 INFO L226 Difference]: Without dead ends: 188 [2020-02-10 20:42:33,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-02-10 20:42:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152. [2020-02-10 20:42:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-02-10 20:42:33,921 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-02-10 20:42:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:33,921 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-02-10 20:42:33,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-02-10 20:42:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:33,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:33,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:33,921 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:33,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash -962513196, now seen corresponding path program 456 times [2020-02-10 20:42:33,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:33,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091297372] [2020-02-10 20:42:33,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:34,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091297372] [2020-02-10 20:42:34,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:34,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:34,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999117331] [2020-02-10 20:42:34,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:34,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:34,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:34,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:34,129 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-02-10 20:42:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:34,199 INFO L93 Difference]: Finished difference Result 187 states and 472 transitions. [2020-02-10 20:42:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:34,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:34,200 INFO L225 Difference]: With dead ends: 187 [2020-02-10 20:42:34,200 INFO L226 Difference]: Without dead ends: 170 [2020-02-10 20:42:34,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-02-10 20:42:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 147. [2020-02-10 20:42:34,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:42:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 410 transitions. [2020-02-10 20:42:34,204 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 410 transitions. Word has length 19 [2020-02-10 20:42:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:34,204 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 410 transitions. [2020-02-10 20:42:34,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 410 transitions. [2020-02-10 20:42:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:34,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:34,204 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:34,204 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:34,205 INFO L82 PathProgramCache]: Analyzing trace with hash 915076246, now seen corresponding path program 457 times [2020-02-10 20:42:34,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:34,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380266459] [2020-02-10 20:42:34,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:34,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380266459] [2020-02-10 20:42:34,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:34,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:34,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441302753] [2020-02-10 20:42:34,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:34,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:34,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:34,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:34,386 INFO L87 Difference]: Start difference. First operand 147 states and 410 transitions. Second operand 8 states. [2020-02-10 20:42:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:34,463 INFO L93 Difference]: Finished difference Result 246 states and 578 transitions. [2020-02-10 20:42:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:34,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:34,464 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:42:34,464 INFO L226 Difference]: Without dead ends: 232 [2020-02-10 20:42:34,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-02-10 20:42:34,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 151. [2020-02-10 20:42:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:42:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 420 transitions. [2020-02-10 20:42:34,467 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 420 transitions. Word has length 19 [2020-02-10 20:42:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:34,468 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 420 transitions. [2020-02-10 20:42:34,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 420 transitions. [2020-02-10 20:42:34,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:34,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:34,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:34,468 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash 40740920, now seen corresponding path program 458 times [2020-02-10 20:42:34,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:34,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082443064] [2020-02-10 20:42:34,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:34,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082443064] [2020-02-10 20:42:34,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:34,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:34,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280520299] [2020-02-10 20:42:34,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:34,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:34,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:34,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:34,667 INFO L87 Difference]: Start difference. First operand 151 states and 420 transitions. Second operand 8 states. [2020-02-10 20:42:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:34,750 INFO L93 Difference]: Finished difference Result 242 states and 567 transitions. [2020-02-10 20:42:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:34,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:34,751 INFO L225 Difference]: With dead ends: 242 [2020-02-10 20:42:34,751 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:42:34,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:42:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2020-02-10 20:42:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 416 transitions. [2020-02-10 20:42:34,755 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 416 transitions. Word has length 19 [2020-02-10 20:42:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:34,755 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 416 transitions. [2020-02-10 20:42:34,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 416 transitions. [2020-02-10 20:42:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:34,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:34,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:34,756 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:34,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:34,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2076098360, now seen corresponding path program 459 times [2020-02-10 20:42:34,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:34,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826444043] [2020-02-10 20:42:34,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:34,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826444043] [2020-02-10 20:42:34,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:34,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:34,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692164050] [2020-02-10 20:42:34,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:34,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:34,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:34,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:34,944 INFO L87 Difference]: Start difference. First operand 149 states and 416 transitions. Second operand 8 states. [2020-02-10 20:42:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:35,017 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-02-10 20:42:35,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:35,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:35,018 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:42:35,018 INFO L226 Difference]: Without dead ends: 232 [2020-02-10 20:42:35,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-02-10 20:42:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 151. [2020-02-10 20:42:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:42:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 419 transitions. [2020-02-10 20:42:35,022 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 419 transitions. Word has length 19 [2020-02-10 20:42:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:35,022 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 419 transitions. [2020-02-10 20:42:35,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 419 transitions. [2020-02-10 20:42:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:35,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:35,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:35,022 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1098739106, now seen corresponding path program 460 times [2020-02-10 20:42:35,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:35,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761375581] [2020-02-10 20:42:35,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:35,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761375581] [2020-02-10 20:42:35,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:35,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:35,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179259755] [2020-02-10 20:42:35,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:35,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:35,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:35,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:35,214 INFO L87 Difference]: Start difference. First operand 151 states and 419 transitions. Second operand 8 states. [2020-02-10 20:42:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:35,277 INFO L93 Difference]: Finished difference Result 242 states and 566 transitions. [2020-02-10 20:42:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:35,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:35,279 INFO L225 Difference]: With dead ends: 242 [2020-02-10 20:42:35,279 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:42:35,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:42:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2020-02-10 20:42:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 415 transitions. [2020-02-10 20:42:35,283 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 415 transitions. Word has length 19 [2020-02-10 20:42:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:35,283 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 415 transitions. [2020-02-10 20:42:35,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 415 transitions. [2020-02-10 20:42:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:35,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:35,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:35,284 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:35,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash -321241190, now seen corresponding path program 461 times [2020-02-10 20:42:35,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:35,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149909506] [2020-02-10 20:42:35,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:35,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149909506] [2020-02-10 20:42:35,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:35,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:35,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588207768] [2020-02-10 20:42:35,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:35,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:35,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:35,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:35,482 INFO L87 Difference]: Start difference. First operand 149 states and 415 transitions. Second operand 8 states. [2020-02-10 20:42:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:35,558 INFO L93 Difference]: Finished difference Result 237 states and 555 transitions. [2020-02-10 20:42:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:35,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:35,559 INFO L225 Difference]: With dead ends: 237 [2020-02-10 20:42:35,559 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 20:42:35,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 20:42:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 150. [2020-02-10 20:42:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:42:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 20:42:35,563 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 20:42:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:35,564 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 20:42:35,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 20:42:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:35,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:35,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:35,564 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:35,564 INFO L82 PathProgramCache]: Analyzing trace with hash -560883528, now seen corresponding path program 462 times [2020-02-10 20:42:35,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:35,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666924413] [2020-02-10 20:42:35,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:35,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666924413] [2020-02-10 20:42:35,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:35,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:35,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865642056] [2020-02-10 20:42:35,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:35,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:35,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:35,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:35,768 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 20:42:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:35,835 INFO L93 Difference]: Finished difference Result 237 states and 554 transitions. [2020-02-10 20:42:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:35,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:35,836 INFO L225 Difference]: With dead ends: 237 [2020-02-10 20:42:35,836 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:42:35,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:42:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 148. [2020-02-10 20:42:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-02-10 20:42:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 413 transitions. [2020-02-10 20:42:35,840 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 413 transitions. Word has length 19 [2020-02-10 20:42:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:35,840 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 413 transitions. [2020-02-10 20:42:35,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 413 transitions. [2020-02-10 20:42:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:35,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:35,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:35,841 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash -695864712, now seen corresponding path program 463 times [2020-02-10 20:42:35,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:35,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999208670] [2020-02-10 20:42:35,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:36,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999208670] [2020-02-10 20:42:36,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:36,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:36,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113096916] [2020-02-10 20:42:36,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:36,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:36,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:36,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:36,010 INFO L87 Difference]: Start difference. First operand 148 states and 413 transitions. Second operand 8 states. [2020-02-10 20:42:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:36,089 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-02-10 20:42:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:36,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:36,090 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:42:36,090 INFO L226 Difference]: Without dead ends: 232 [2020-02-10 20:42:36,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-02-10 20:42:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2020-02-10 20:42:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-02-10 20:42:36,093 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-02-10 20:42:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:36,093 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-02-10 20:42:36,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-02-10 20:42:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:36,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:36,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:36,094 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:36,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1570200038, now seen corresponding path program 464 times [2020-02-10 20:42:36,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:36,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167225932] [2020-02-10 20:42:36,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:36,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167225932] [2020-02-10 20:42:36,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:36,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:36,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521438586] [2020-02-10 20:42:36,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:36,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:36,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:36,265 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-02-10 20:42:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:36,344 INFO L93 Difference]: Finished difference Result 242 states and 566 transitions. [2020-02-10 20:42:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:36,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:36,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:36,344 INFO L225 Difference]: With dead ends: 242 [2020-02-10 20:42:36,345 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:42:36,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:42:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 150. [2020-02-10 20:42:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:42:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 418 transitions. [2020-02-10 20:42:36,348 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 418 transitions. Word has length 19 [2020-02-10 20:42:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:36,349 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 418 transitions. [2020-02-10 20:42:36,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 418 transitions. [2020-02-10 20:42:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:36,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:36,349 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:36,349 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash 793540284, now seen corresponding path program 465 times [2020-02-10 20:42:36,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:36,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509968909] [2020-02-10 20:42:36,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:36,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509968909] [2020-02-10 20:42:36,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:36,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:36,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521152468] [2020-02-10 20:42:36,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:36,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:36,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:36,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:36,522 INFO L87 Difference]: Start difference. First operand 150 states and 418 transitions. Second operand 8 states. [2020-02-10 20:42:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:36,598 INFO L93 Difference]: Finished difference Result 244 states and 575 transitions. [2020-02-10 20:42:36,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:36,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:36,599 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:42:36,599 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:42:36,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:42:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 154. [2020-02-10 20:42:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:42:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 426 transitions. [2020-02-10 20:42:36,604 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 426 transitions. Word has length 19 [2020-02-10 20:42:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:36,604 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 426 transitions. [2020-02-10 20:42:36,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 426 transitions. [2020-02-10 20:42:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:36,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:36,604 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:36,605 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:36,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:36,605 INFO L82 PathProgramCache]: Analyzing trace with hash 48243140, now seen corresponding path program 466 times [2020-02-10 20:42:36,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:36,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648099897] [2020-02-10 20:42:36,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:36,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648099897] [2020-02-10 20:42:36,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:36,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:36,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340180773] [2020-02-10 20:42:36,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:36,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:36,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:36,779 INFO L87 Difference]: Start difference. First operand 154 states and 426 transitions. Second operand 8 states. [2020-02-10 20:42:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:36,854 INFO L93 Difference]: Finished difference Result 233 states and 558 transitions. [2020-02-10 20:42:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:36,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:36,855 INFO L225 Difference]: With dead ends: 233 [2020-02-10 20:42:36,855 INFO L226 Difference]: Without dead ends: 217 [2020-02-10 20:42:36,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-02-10 20:42:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2020-02-10 20:42:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:42:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 20:42:36,859 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 20:42:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:36,859 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 20:42:36,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 20:42:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:36,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:36,860 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:36,860 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2141654844, now seen corresponding path program 467 times [2020-02-10 20:42:36,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:36,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128885636] [2020-02-10 20:42:36,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:37,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128885636] [2020-02-10 20:42:37,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:37,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:37,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231843232] [2020-02-10 20:42:37,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:37,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:37,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:37,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:37,038 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 20:42:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:37,112 INFO L93 Difference]: Finished difference Result 238 states and 557 transitions. [2020-02-10 20:42:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:37,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:37,113 INFO L225 Difference]: With dead ends: 238 [2020-02-10 20:42:37,113 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:42:37,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:42:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 152. [2020-02-10 20:42:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 419 transitions. [2020-02-10 20:42:37,117 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 419 transitions. Word has length 19 [2020-02-10 20:42:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:37,117 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 419 transitions. [2020-02-10 20:42:37,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 419 transitions. [2020-02-10 20:42:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:37,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:37,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:37,118 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:37,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash -431041536, now seen corresponding path program 468 times [2020-02-10 20:42:37,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:37,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774870881] [2020-02-10 20:42:37,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:37,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774870881] [2020-02-10 20:42:37,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:37,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:37,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327426827] [2020-02-10 20:42:37,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:37,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:37,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:37,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:37,294 INFO L87 Difference]: Start difference. First operand 152 states and 419 transitions. Second operand 8 states. [2020-02-10 20:42:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:37,379 INFO L93 Difference]: Finished difference Result 231 states and 551 transitions. [2020-02-10 20:42:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:37,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:37,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:37,380 INFO L225 Difference]: With dead ends: 231 [2020-02-10 20:42:37,380 INFO L226 Difference]: Without dead ends: 215 [2020-02-10 20:42:37,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:37,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-02-10 20:42:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 148. [2020-02-10 20:42:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-02-10 20:42:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 412 transitions. [2020-02-10 20:42:37,384 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 412 transitions. Word has length 19 [2020-02-10 20:42:37,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:37,385 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 412 transitions. [2020-02-10 20:42:37,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 412 transitions. [2020-02-10 20:42:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:37,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:37,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:37,385 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1124777348, now seen corresponding path program 469 times [2020-02-10 20:42:37,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:37,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317913568] [2020-02-10 20:42:37,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:37,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317913568] [2020-02-10 20:42:37,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:37,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:37,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659180945] [2020-02-10 20:42:37,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:37,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:37,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:37,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:37,558 INFO L87 Difference]: Start difference. First operand 148 states and 412 transitions. Second operand 8 states. [2020-02-10 20:42:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:37,627 INFO L93 Difference]: Finished difference Result 236 states and 552 transitions. [2020-02-10 20:42:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:37,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:37,628 INFO L225 Difference]: With dead ends: 236 [2020-02-10 20:42:37,629 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 20:42:37,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 20:42:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 152. [2020-02-10 20:42:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 422 transitions. [2020-02-10 20:42:37,632 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 422 transitions. Word has length 19 [2020-02-10 20:42:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:37,633 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 422 transitions. [2020-02-10 20:42:37,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 422 transitions. [2020-02-10 20:42:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:37,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:37,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:37,633 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:37,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:37,633 INFO L82 PathProgramCache]: Analyzing trace with hash -4647518, now seen corresponding path program 470 times [2020-02-10 20:42:37,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:37,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117038947] [2020-02-10 20:42:37,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:37,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117038947] [2020-02-10 20:42:37,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:37,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:37,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338829672] [2020-02-10 20:42:37,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:37,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:37,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:37,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:37,812 INFO L87 Difference]: Start difference. First operand 152 states and 422 transitions. Second operand 8 states. [2020-02-10 20:42:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:37,872 INFO L93 Difference]: Finished difference Result 232 states and 541 transitions. [2020-02-10 20:42:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:37,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:37,873 INFO L225 Difference]: With dead ends: 232 [2020-02-10 20:42:37,873 INFO L226 Difference]: Without dead ends: 220 [2020-02-10 20:42:37,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-02-10 20:42:37,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2020-02-10 20:42:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:42:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 417 transitions. [2020-02-10 20:42:37,876 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 417 transitions. Word has length 19 [2020-02-10 20:42:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:37,876 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 417 transitions. [2020-02-10 20:42:37,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 417 transitions. [2020-02-10 20:42:37,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:37,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:37,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:37,877 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:37,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:37,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1869479846, now seen corresponding path program 471 times [2020-02-10 20:42:37,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:37,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930753285] [2020-02-10 20:42:37,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:38,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930753285] [2020-02-10 20:42:38,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:38,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:38,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613111377] [2020-02-10 20:42:38,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:38,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:38,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:38,052 INFO L87 Difference]: Start difference. First operand 150 states and 417 transitions. Second operand 8 states. [2020-02-10 20:42:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:38,128 INFO L93 Difference]: Finished difference Result 230 states and 538 transitions. [2020-02-10 20:42:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:38,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:38,129 INFO L225 Difference]: With dead ends: 230 [2020-02-10 20:42:38,129 INFO L226 Difference]: Without dead ends: 216 [2020-02-10 20:42:38,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-02-10 20:42:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 154. [2020-02-10 20:42:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:42:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 425 transitions. [2020-02-10 20:42:38,133 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 425 transitions. Word has length 19 [2020-02-10 20:42:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:38,133 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 425 transitions. [2020-02-10 20:42:38,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 425 transitions. [2020-02-10 20:42:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:38,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:38,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:38,134 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:38,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:38,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1680190306, now seen corresponding path program 472 times [2020-02-10 20:42:38,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:38,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869423220] [2020-02-10 20:42:38,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:38,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869423220] [2020-02-10 20:42:38,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:38,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:38,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114499611] [2020-02-10 20:42:38,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:38,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:38,307 INFO L87 Difference]: Start difference. First operand 154 states and 425 transitions. Second operand 8 states. [2020-02-10 20:42:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:38,384 INFO L93 Difference]: Finished difference Result 219 states and 521 transitions. [2020-02-10 20:42:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:38,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:38,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:38,385 INFO L225 Difference]: With dead ends: 219 [2020-02-10 20:42:38,385 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 20:42:38,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:38,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 20:42:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-02-10 20:42:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:42:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-02-10 20:42:38,388 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-02-10 20:42:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:38,389 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-02-10 20:42:38,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-02-10 20:42:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:38,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:38,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:38,389 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:38,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:38,389 INFO L82 PathProgramCache]: Analyzing trace with hash -539877320, now seen corresponding path program 473 times [2020-02-10 20:42:38,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:38,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442871932] [2020-02-10 20:42:38,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:38,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442871932] [2020-02-10 20:42:38,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:38,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:38,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374227665] [2020-02-10 20:42:38,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:38,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:38,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:38,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:38,573 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-02-10 20:42:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:38,638 INFO L93 Difference]: Finished difference Result 215 states and 511 transitions. [2020-02-10 20:42:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:38,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:38,639 INFO L225 Difference]: With dead ends: 215 [2020-02-10 20:42:38,639 INFO L226 Difference]: Without dead ends: 205 [2020-02-10 20:42:38,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-02-10 20:42:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2020-02-10 20:42:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-02-10 20:42:38,642 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-02-10 20:42:38,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:38,642 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-02-10 20:42:38,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-02-10 20:42:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:38,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:38,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:38,643 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:38,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:38,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1395183974, now seen corresponding path program 474 times [2020-02-10 20:42:38,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:38,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27212870] [2020-02-10 20:42:38,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:38,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27212870] [2020-02-10 20:42:38,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:38,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:38,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756593142] [2020-02-10 20:42:38,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:38,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:38,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:38,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:38,819 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-02-10 20:42:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:38,890 INFO L93 Difference]: Finished difference Result 204 states and 497 transitions. [2020-02-10 20:42:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:38,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:38,891 INFO L225 Difference]: With dead ends: 204 [2020-02-10 20:42:38,891 INFO L226 Difference]: Without dead ends: 188 [2020-02-10 20:42:38,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-02-10 20:42:38,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 148. [2020-02-10 20:42:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-02-10 20:42:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 411 transitions. [2020-02-10 20:42:38,895 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 411 transitions. Word has length 19 [2020-02-10 20:42:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:38,895 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 411 transitions. [2020-02-10 20:42:38,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 411 transitions. [2020-02-10 20:42:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:38,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:38,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:38,896 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:38,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:38,896 INFO L82 PathProgramCache]: Analyzing trace with hash 266504132, now seen corresponding path program 475 times [2020-02-10 20:42:38,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:38,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097317212] [2020-02-10 20:42:38,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:39,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097317212] [2020-02-10 20:42:39,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:39,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:39,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357602621] [2020-02-10 20:42:39,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:39,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:39,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:39,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:39,093 INFO L87 Difference]: Start difference. First operand 148 states and 411 transitions. Second operand 8 states. [2020-02-10 20:42:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:39,168 INFO L93 Difference]: Finished difference Result 213 states and 507 transitions. [2020-02-10 20:42:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:39,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:39,169 INFO L225 Difference]: With dead ends: 213 [2020-02-10 20:42:39,169 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 20:42:39,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 20:42:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-02-10 20:42:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:42:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-02-10 20:42:39,173 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-02-10 20:42:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:39,173 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-02-10 20:42:39,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-02-10 20:42:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:39,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:39,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:39,174 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:39,174 INFO L82 PathProgramCache]: Analyzing trace with hash 26861794, now seen corresponding path program 476 times [2020-02-10 20:42:39,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:39,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867177573] [2020-02-10 20:42:39,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:39,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867177573] [2020-02-10 20:42:39,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:39,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:39,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838434011] [2020-02-10 20:42:39,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:39,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:39,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:39,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:39,378 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-02-10 20:42:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:39,439 INFO L93 Difference]: Finished difference Result 213 states and 506 transitions. [2020-02-10 20:42:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:39,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:39,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:39,440 INFO L225 Difference]: With dead ends: 213 [2020-02-10 20:42:39,440 INFO L226 Difference]: Without dead ends: 202 [2020-02-10 20:42:39,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-02-10 20:42:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2020-02-10 20:42:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 413 transitions. [2020-02-10 20:42:39,444 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 413 transitions. Word has length 19 [2020-02-10 20:42:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:39,444 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 413 transitions. [2020-02-10 20:42:39,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 413 transitions. [2020-02-10 20:42:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:39,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:39,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:39,444 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:39,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:39,445 INFO L82 PathProgramCache]: Analyzing trace with hash -478198366, now seen corresponding path program 477 times [2020-02-10 20:42:39,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:39,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924920201] [2020-02-10 20:42:39,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:39,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924920201] [2020-02-10 20:42:39,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:39,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:39,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520025441] [2020-02-10 20:42:39,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:39,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:39,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:39,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:39,641 INFO L87 Difference]: Start difference. First operand 149 states and 413 transitions. Second operand 8 states. [2020-02-10 20:42:39,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:39,716 INFO L93 Difference]: Finished difference Result 210 states and 501 transitions. [2020-02-10 20:42:39,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:39,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:39,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:39,717 INFO L225 Difference]: With dead ends: 210 [2020-02-10 20:42:39,717 INFO L226 Difference]: Without dead ends: 200 [2020-02-10 20:42:39,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-02-10 20:42:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 151. [2020-02-10 20:42:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:42:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 416 transitions. [2020-02-10 20:42:39,721 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 416 transitions. Word has length 19 [2020-02-10 20:42:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:39,722 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 416 transitions. [2020-02-10 20:42:39,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 416 transitions. [2020-02-10 20:42:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:39,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:39,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:39,722 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:39,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:39,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1232414942, now seen corresponding path program 478 times [2020-02-10 20:42:39,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:39,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2567580] [2020-02-10 20:42:39,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:39,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2567580] [2020-02-10 20:42:39,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:39,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:39,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972832910] [2020-02-10 20:42:39,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:39,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:39,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:39,920 INFO L87 Difference]: Start difference. First operand 151 states and 416 transitions. Second operand 8 states. [2020-02-10 20:42:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:39,996 INFO L93 Difference]: Finished difference Result 203 states and 495 transitions. [2020-02-10 20:42:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:39,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:39,997 INFO L225 Difference]: With dead ends: 203 [2020-02-10 20:42:39,998 INFO L226 Difference]: Without dead ends: 189 [2020-02-10 20:42:39,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-02-10 20:42:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2020-02-10 20:42:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 412 transitions. [2020-02-10 20:42:40,001 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 412 transitions. Word has length 19 [2020-02-10 20:42:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:40,002 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 412 transitions. [2020-02-10 20:42:40,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 412 transitions. [2020-02-10 20:42:40,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:40,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:40,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:40,002 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:40,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:40,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1046223586, now seen corresponding path program 479 times [2020-02-10 20:42:40,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:40,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052992528] [2020-02-10 20:42:40,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:40,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052992528] [2020-02-10 20:42:40,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:40,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:40,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345812211] [2020-02-10 20:42:40,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:40,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:40,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:40,199 INFO L87 Difference]: Start difference. First operand 149 states and 412 transitions. Second operand 8 states. [2020-02-10 20:42:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:40,260 INFO L93 Difference]: Finished difference Result 197 states and 483 transitions. [2020-02-10 20:42:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:40,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:40,261 INFO L225 Difference]: With dead ends: 197 [2020-02-10 20:42:40,261 INFO L226 Difference]: Without dead ends: 187 [2020-02-10 20:42:40,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-02-10 20:42:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 151. [2020-02-10 20:42:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:42:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 415 transitions. [2020-02-10 20:42:40,264 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 415 transitions. Word has length 19 [2020-02-10 20:42:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:40,264 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 415 transitions. [2020-02-10 20:42:40,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 415 transitions. [2020-02-10 20:42:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:40,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:40,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:40,265 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:40,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1901530240, now seen corresponding path program 480 times [2020-02-10 20:42:40,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:40,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675645282] [2020-02-10 20:42:40,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:40,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675645282] [2020-02-10 20:42:40,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:40,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:40,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443153170] [2020-02-10 20:42:40,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:40,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:40,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:40,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:40,463 INFO L87 Difference]: Start difference. First operand 151 states and 415 transitions. Second operand 8 states. [2020-02-10 20:42:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:40,531 INFO L93 Difference]: Finished difference Result 186 states and 469 transitions. [2020-02-10 20:42:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:40,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:40,531 INFO L225 Difference]: With dead ends: 186 [2020-02-10 20:42:40,531 INFO L226 Difference]: Without dead ends: 167 [2020-02-10 20:42:40,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-02-10 20:42:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2020-02-10 20:42:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 20:42:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 404 transitions. [2020-02-10 20:42:40,535 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 404 transitions. Word has length 19 [2020-02-10 20:42:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:40,535 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 404 transitions. [2020-02-10 20:42:40,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 404 transitions. [2020-02-10 20:42:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:40,535 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:40,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:40,535 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:40,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash -700822424, now seen corresponding path program 481 times [2020-02-10 20:42:40,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:40,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050708438] [2020-02-10 20:42:40,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:40,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050708438] [2020-02-10 20:42:40,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:40,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:40,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526167236] [2020-02-10 20:42:40,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:40,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:40,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:40,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:40,741 INFO L87 Difference]: Start difference. First operand 144 states and 404 transitions. Second operand 8 states. [2020-02-10 20:42:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:40,799 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-02-10 20:42:40,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:40,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:40,800 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:42:40,800 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:42:40,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:42:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 20:42:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 414 transitions. [2020-02-10 20:42:40,803 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 414 transitions. Word has length 19 [2020-02-10 20:42:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:40,804 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 414 transitions. [2020-02-10 20:42:40,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 414 transitions. [2020-02-10 20:42:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:40,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:40,804 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:40,804 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:40,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:40,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1442418326, now seen corresponding path program 482 times [2020-02-10 20:42:40,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:40,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698150522] [2020-02-10 20:42:40,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:41,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698150522] [2020-02-10 20:42:41,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:41,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:41,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236115222] [2020-02-10 20:42:41,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:41,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:41,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:41,008 INFO L87 Difference]: Start difference. First operand 149 states and 414 transitions. Second operand 8 states. [2020-02-10 20:42:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:41,085 INFO L93 Difference]: Finished difference Result 238 states and 545 transitions. [2020-02-10 20:42:41,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:41,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:41,086 INFO L225 Difference]: With dead ends: 238 [2020-02-10 20:42:41,086 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:42:41,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:42:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2020-02-10 20:42:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 20:42:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 408 transitions. [2020-02-10 20:42:41,090 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 408 transitions. Word has length 19 [2020-02-10 20:42:41,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:41,090 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 408 transitions. [2020-02-10 20:42:41,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 408 transitions. [2020-02-10 20:42:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:41,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:41,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:41,090 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:41,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1993707018, now seen corresponding path program 483 times [2020-02-10 20:42:41,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:41,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887906371] [2020-02-10 20:42:41,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:41,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887906371] [2020-02-10 20:42:41,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:41,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:41,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199250027] [2020-02-10 20:42:41,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:41,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:41,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:41,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:41,289 INFO L87 Difference]: Start difference. First operand 146 states and 408 transitions. Second operand 8 states. [2020-02-10 20:42:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:41,345 INFO L93 Difference]: Finished difference Result 244 states and 558 transitions. [2020-02-10 20:42:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:41,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:41,346 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:42:41,346 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:42:41,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:42:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 20:42:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 412 transitions. [2020-02-10 20:42:41,350 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 412 transitions. Word has length 19 [2020-02-10 20:42:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:41,350 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 412 transitions. [2020-02-10 20:42:41,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 412 transitions. [2020-02-10 20:42:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:41,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:41,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:41,350 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:41,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:41,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2042202052, now seen corresponding path program 484 times [2020-02-10 20:42:41,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:41,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636194525] [2020-02-10 20:42:41,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:41,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636194525] [2020-02-10 20:42:41,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:41,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:41,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084433651] [2020-02-10 20:42:41,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:41,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:41,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:41,549 INFO L87 Difference]: Start difference. First operand 149 states and 412 transitions. Second operand 8 states. [2020-02-10 20:42:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:41,632 INFO L93 Difference]: Finished difference Result 238 states and 543 transitions. [2020-02-10 20:42:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:41,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:41,633 INFO L225 Difference]: With dead ends: 238 [2020-02-10 20:42:41,633 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:42:41,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:42:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2020-02-10 20:42:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 20:42:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 406 transitions. [2020-02-10 20:42:41,637 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 406 transitions. Word has length 19 [2020-02-10 20:42:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:41,637 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 406 transitions. [2020-02-10 20:42:41,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 406 transitions. [2020-02-10 20:42:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:41,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:41,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:41,638 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1012326922, now seen corresponding path program 485 times [2020-02-10 20:42:41,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:41,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243206226] [2020-02-10 20:42:41,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:41,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243206226] [2020-02-10 20:42:41,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:41,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:41,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341942300] [2020-02-10 20:42:41,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:41,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:41,850 INFO L87 Difference]: Start difference. First operand 146 states and 406 transitions. Second operand 8 states. [2020-02-10 20:42:41,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:41,927 INFO L93 Difference]: Finished difference Result 230 states and 527 transitions. [2020-02-10 20:42:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:41,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:41,928 INFO L225 Difference]: With dead ends: 230 [2020-02-10 20:42:41,928 INFO L226 Difference]: Without dead ends: 220 [2020-02-10 20:42:41,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:41,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-02-10 20:42:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 147. [2020-02-10 20:42:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:42:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 407 transitions. [2020-02-10 20:42:41,932 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 407 transitions. Word has length 19 [2020-02-10 20:42:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:41,932 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 407 transitions. [2020-02-10 20:42:41,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 407 transitions. [2020-02-10 20:42:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:41,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:41,933 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:41,933 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash 772684584, now seen corresponding path program 486 times [2020-02-10 20:42:41,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:41,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544797252] [2020-02-10 20:42:41,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:42,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544797252] [2020-02-10 20:42:42,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:42,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:42,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311222168] [2020-02-10 20:42:42,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:42,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:42,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:42,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:42,147 INFO L87 Difference]: Start difference. First operand 147 states and 407 transitions. Second operand 8 states. [2020-02-10 20:42:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:42,205 INFO L93 Difference]: Finished difference Result 230 states and 526 transitions. [2020-02-10 20:42:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:42,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:42,206 INFO L225 Difference]: With dead ends: 230 [2020-02-10 20:42:42,207 INFO L226 Difference]: Without dead ends: 217 [2020-02-10 20:42:42,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-02-10 20:42:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 144. [2020-02-10 20:42:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 20:42:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 402 transitions. [2020-02-10 20:42:42,210 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 402 transitions. Word has length 19 [2020-02-10 20:42:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:42,210 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 402 transitions. [2020-02-10 20:42:42,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 402 transitions. [2020-02-10 20:42:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:42,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:42,211 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:42,211 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:42,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1225211654, now seen corresponding path program 487 times [2020-02-10 20:42:42,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:42,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347263672] [2020-02-10 20:42:42,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:42,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347263672] [2020-02-10 20:42:42,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:42,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:42,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594032353] [2020-02-10 20:42:42,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:42,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:42,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:42,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:42,419 INFO L87 Difference]: Start difference. First operand 144 states and 402 transitions. Second operand 8 states. [2020-02-10 20:42:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:42,477 INFO L93 Difference]: Finished difference Result 250 states and 577 transitions. [2020-02-10 20:42:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:42,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:42,478 INFO L225 Difference]: With dead ends: 250 [2020-02-10 20:42:42,478 INFO L226 Difference]: Without dead ends: 234 [2020-02-10 20:42:42,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-02-10 20:42:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2020-02-10 20:42:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:42:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 20:42:42,482 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 20:42:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:42,482 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 20:42:42,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 20:42:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:42,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:42,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:42,483 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash -926514892, now seen corresponding path program 488 times [2020-02-10 20:42:42,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:42,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169002484] [2020-02-10 20:42:42,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:42,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169002484] [2020-02-10 20:42:42,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:42,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:42,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585949795] [2020-02-10 20:42:42,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:42,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:42,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:42,688 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 20:42:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:42,763 INFO L93 Difference]: Finished difference Result 244 states and 562 transitions. [2020-02-10 20:42:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:42,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:42,764 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:42:42,765 INFO L226 Difference]: Without dead ends: 231 [2020-02-10 20:42:42,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-02-10 20:42:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2020-02-10 20:42:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:42:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 409 transitions. [2020-02-10 20:42:42,769 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 409 transitions. Word has length 19 [2020-02-10 20:42:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:42,769 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 409 transitions. [2020-02-10 20:42:42,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 409 transitions. [2020-02-10 20:42:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:42,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:42,769 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:42,769 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:42,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1975664054, now seen corresponding path program 489 times [2020-02-10 20:42:42,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:42,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847546294] [2020-02-10 20:42:42,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:42,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847546294] [2020-02-10 20:42:42,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:42,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:42,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878988568] [2020-02-10 20:42:42,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:42,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:42,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:42,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:42,978 INFO L87 Difference]: Start difference. First operand 147 states and 409 transitions. Second operand 8 states. [2020-02-10 20:42:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:43,034 INFO L93 Difference]: Finished difference Result 254 states and 586 transitions. [2020-02-10 20:42:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:43,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:43,035 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:42:43,036 INFO L226 Difference]: Without dead ends: 238 [2020-02-10 20:42:43,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-02-10 20:42:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2020-02-10 20:42:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-02-10 20:42:43,040 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-02-10 20:42:43,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:43,040 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-02-10 20:42:43,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-02-10 20:42:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:43,041 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:43,041 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:43,041 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:43,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:43,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1568241148, now seen corresponding path program 490 times [2020-02-10 20:42:43,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:43,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734839999] [2020-02-10 20:42:43,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:43,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734839999] [2020-02-10 20:42:43,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:43,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:43,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155645] [2020-02-10 20:42:43,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:43,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:43,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:43,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:43,244 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-02-10 20:42:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:43,319 INFO L93 Difference]: Finished difference Result 250 states and 574 transitions. [2020-02-10 20:42:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:43,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:43,321 INFO L225 Difference]: With dead ends: 250 [2020-02-10 20:42:43,321 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 20:42:43,321 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 20:42:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 147. [2020-02-10 20:42:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:42:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 406 transitions. [2020-02-10 20:42:43,324 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 406 transitions. Word has length 19 [2020-02-10 20:42:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:43,324 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 406 transitions. [2020-02-10 20:42:43,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 406 transitions. [2020-02-10 20:42:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:43,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:43,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:43,325 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:43,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:43,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1566078992, now seen corresponding path program 491 times [2020-02-10 20:42:43,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:43,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140057525] [2020-02-10 20:42:43,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:43,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140057525] [2020-02-10 20:42:43,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:43,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:43,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836544446] [2020-02-10 20:42:43,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:43,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:43,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:43,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:43,533 INFO L87 Difference]: Start difference. First operand 147 states and 406 transitions. Second operand 8 states. [2020-02-10 20:42:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:43,609 INFO L93 Difference]: Finished difference Result 239 states and 550 transitions. [2020-02-10 20:42:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:43,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:43,610 INFO L225 Difference]: With dead ends: 239 [2020-02-10 20:42:43,610 INFO L226 Difference]: Without dead ends: 229 [2020-02-10 20:42:43,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-02-10 20:42:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 149. [2020-02-10 20:42:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 409 transitions. [2020-02-10 20:42:43,614 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 409 transitions. Word has length 19 [2020-02-10 20:42:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:43,614 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 409 transitions. [2020-02-10 20:42:43,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 409 transitions. [2020-02-10 20:42:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:43,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:43,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:43,614 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:43,615 INFO L82 PathProgramCache]: Analyzing trace with hash 144534316, now seen corresponding path program 492 times [2020-02-10 20:42:43,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:43,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35805727] [2020-02-10 20:42:43,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:43,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35805727] [2020-02-10 20:42:43,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:43,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:43,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179074286] [2020-02-10 20:42:43,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:43,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:43,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:43,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:43,820 INFO L87 Difference]: Start difference. First operand 149 states and 409 transitions. Second operand 8 states. [2020-02-10 20:42:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:43,908 INFO L93 Difference]: Finished difference Result 241 states and 553 transitions. [2020-02-10 20:42:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:43,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:43,909 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:42:43,909 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:42:43,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:42:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2020-02-10 20:42:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 20:42:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 400 transitions. [2020-02-10 20:42:43,913 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 400 transitions. Word has length 19 [2020-02-10 20:42:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:43,913 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 400 transitions. [2020-02-10 20:42:43,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 400 transitions. [2020-02-10 20:42:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:43,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:43,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:43,914 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:43,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:43,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1550807878, now seen corresponding path program 493 times [2020-02-10 20:42:43,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:43,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632728065] [2020-02-10 20:42:43,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:44,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632728065] [2020-02-10 20:42:44,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:44,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:44,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332359428] [2020-02-10 20:42:44,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:44,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:44,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:44,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:44,122 INFO L87 Difference]: Start difference. First operand 144 states and 400 transitions. Second operand 8 states. [2020-02-10 20:42:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:44,183 INFO L93 Difference]: Finished difference Result 250 states and 575 transitions. [2020-02-10 20:42:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:44,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:44,184 INFO L225 Difference]: With dead ends: 250 [2020-02-10 20:42:44,184 INFO L226 Difference]: Without dead ends: 234 [2020-02-10 20:42:44,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-02-10 20:42:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2020-02-10 20:42:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:42:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 414 transitions. [2020-02-10 20:42:44,189 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 414 transitions. Word has length 19 [2020-02-10 20:42:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:44,189 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 414 transitions. [2020-02-10 20:42:44,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 414 transitions. [2020-02-10 20:42:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:44,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:44,190 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:44,190 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1809866104, now seen corresponding path program 494 times [2020-02-10 20:42:44,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:44,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384843693] [2020-02-10 20:42:44,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:44,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384843693] [2020-02-10 20:42:44,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:44,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:44,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481855663] [2020-02-10 20:42:44,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:44,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:44,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:44,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:44,396 INFO L87 Difference]: Start difference. First operand 150 states and 414 transitions. Second operand 8 states. [2020-02-10 20:42:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:44,459 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-02-10 20:42:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:44,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:44,460 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:42:44,460 INFO L226 Difference]: Without dead ends: 231 [2020-02-10 20:42:44,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-02-10 20:42:44,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2020-02-10 20:42:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:42:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 407 transitions. [2020-02-10 20:42:44,464 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 407 transitions. Word has length 19 [2020-02-10 20:42:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:44,464 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 407 transitions. [2020-02-10 20:42:44,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 407 transitions. [2020-02-10 20:42:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:44,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:44,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:44,465 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash -49629976, now seen corresponding path program 495 times [2020-02-10 20:42:44,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:44,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856111159] [2020-02-10 20:42:44,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:44,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856111159] [2020-02-10 20:42:44,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:44,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:44,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777374335] [2020-02-10 20:42:44,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:44,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:44,676 INFO L87 Difference]: Start difference. First operand 147 states and 407 transitions. Second operand 8 states. [2020-02-10 20:42:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:44,740 INFO L93 Difference]: Finished difference Result 254 states and 584 transitions. [2020-02-10 20:42:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:44,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:44,741 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:42:44,741 INFO L226 Difference]: Without dead ends: 238 [2020-02-10 20:42:44,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-02-10 20:42:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2020-02-10 20:42:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:42:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 416 transitions. [2020-02-10 20:42:44,744 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 416 transitions. Word has length 19 [2020-02-10 20:42:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:44,745 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 416 transitions. [2020-02-10 20:42:44,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 416 transitions. [2020-02-10 20:42:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:44,745 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:44,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:44,745 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash -800692070, now seen corresponding path program 496 times [2020-02-10 20:42:44,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:44,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355320897] [2020-02-10 20:42:44,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:44,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355320897] [2020-02-10 20:42:44,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:44,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:44,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620030773] [2020-02-10 20:42:44,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:44,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:44,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:44,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:44,950 INFO L87 Difference]: Start difference. First operand 152 states and 416 transitions. Second operand 8 states. [2020-02-10 20:42:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:45,035 INFO L93 Difference]: Finished difference Result 250 states and 572 transitions. [2020-02-10 20:42:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:45,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:45,036 INFO L225 Difference]: With dead ends: 250 [2020-02-10 20:42:45,036 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 20:42:45,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 20:42:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 147. [2020-02-10 20:42:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:42:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 404 transitions. [2020-02-10 20:42:45,039 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 404 transitions. Word has length 19 [2020-02-10 20:42:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:45,040 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 404 transitions. [2020-02-10 20:42:45,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 404 transitions. [2020-02-10 20:42:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:45,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:45,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:45,040 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:45,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:45,040 INFO L82 PathProgramCache]: Analyzing trace with hash 350791652, now seen corresponding path program 497 times [2020-02-10 20:42:45,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:45,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732159707] [2020-02-10 20:42:45,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:45,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732159707] [2020-02-10 20:42:45,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:45,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:45,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131769815] [2020-02-10 20:42:45,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:45,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:45,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:45,250 INFO L87 Difference]: Start difference. First operand 147 states and 404 transitions. Second operand 8 states. [2020-02-10 20:42:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:45,321 INFO L93 Difference]: Finished difference Result 239 states and 548 transitions. [2020-02-10 20:42:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:45,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:45,322 INFO L225 Difference]: With dead ends: 239 [2020-02-10 20:42:45,322 INFO L226 Difference]: Without dead ends: 229 [2020-02-10 20:42:45,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-02-10 20:42:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 149. [2020-02-10 20:42:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 407 transitions. [2020-02-10 20:42:45,325 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 407 transitions. Word has length 19 [2020-02-10 20:42:45,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:45,326 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 407 transitions. [2020-02-10 20:42:45,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 407 transitions. [2020-02-10 20:42:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:45,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:45,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:45,326 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash -504515002, now seen corresponding path program 498 times [2020-02-10 20:42:45,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:45,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596274443] [2020-02-10 20:42:45,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:45,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596274443] [2020-02-10 20:42:45,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:45,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:45,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913138765] [2020-02-10 20:42:45,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:45,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:45,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:45,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:45,530 INFO L87 Difference]: Start difference. First operand 149 states and 407 transitions. Second operand 8 states. [2020-02-10 20:42:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:45,611 INFO L93 Difference]: Finished difference Result 241 states and 551 transitions. [2020-02-10 20:42:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:45,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:45,612 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:42:45,612 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:42:45,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:42:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2020-02-10 20:42:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 20:42:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 398 transitions. [2020-02-10 20:42:45,616 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 398 transitions. Word has length 19 [2020-02-10 20:42:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:45,616 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 398 transitions. [2020-02-10 20:42:45,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 398 transitions. [2020-02-10 20:42:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:45,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:45,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:45,617 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1269308130, now seen corresponding path program 499 times [2020-02-10 20:42:45,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:45,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975520557] [2020-02-10 20:42:45,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:45,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975520557] [2020-02-10 20:42:45,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:45,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:45,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202552274] [2020-02-10 20:42:45,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:45,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:45,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:45,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:45,832 INFO L87 Difference]: Start difference. First operand 144 states and 398 transitions. Second operand 8 states. [2020-02-10 20:42:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:45,919 INFO L93 Difference]: Finished difference Result 223 states and 511 transitions. [2020-02-10 20:42:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:45,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:45,921 INFO L225 Difference]: With dead ends: 223 [2020-02-10 20:42:45,921 INFO L226 Difference]: Without dead ends: 213 [2020-02-10 20:42:45,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-02-10 20:42:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2020-02-10 20:42:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 20:42:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 402 transitions. [2020-02-10 20:42:45,925 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 402 transitions. Word has length 19 [2020-02-10 20:42:45,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:45,925 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 402 transitions. [2020-02-10 20:42:45,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 402 transitions. [2020-02-10 20:42:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:45,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:45,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:45,925 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:45,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1508950468, now seen corresponding path program 500 times [2020-02-10 20:42:45,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:45,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542889743] [2020-02-10 20:42:45,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:46,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542889743] [2020-02-10 20:42:46,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:46,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:46,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903549409] [2020-02-10 20:42:46,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:46,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:46,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:46,138 INFO L87 Difference]: Start difference. First operand 146 states and 402 transitions. Second operand 8 states. [2020-02-10 20:42:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:46,207 INFO L93 Difference]: Finished difference Result 223 states and 510 transitions. [2020-02-10 20:42:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:46,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:46,208 INFO L225 Difference]: With dead ends: 223 [2020-02-10 20:42:46,208 INFO L226 Difference]: Without dead ends: 212 [2020-02-10 20:42:46,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-02-10 20:42:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 145. [2020-02-10 20:42:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:42:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 400 transitions. [2020-02-10 20:42:46,211 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 400 transitions. Word has length 19 [2020-02-10 20:42:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:46,211 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 400 transitions. [2020-02-10 20:42:46,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 400 transitions. [2020-02-10 20:42:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:46,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:46,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:46,212 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2014010628, now seen corresponding path program 501 times [2020-02-10 20:42:46,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:46,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285930832] [2020-02-10 20:42:46,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:46,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285930832] [2020-02-10 20:42:46,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:46,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:46,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878807575] [2020-02-10 20:42:46,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:46,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:46,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:46,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:46,416 INFO L87 Difference]: Start difference. First operand 145 states and 400 transitions. Second operand 8 states. [2020-02-10 20:42:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:46,502 INFO L93 Difference]: Finished difference Result 226 states and 518 transitions. [2020-02-10 20:42:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:46,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:46,503 INFO L225 Difference]: With dead ends: 226 [2020-02-10 20:42:46,503 INFO L226 Difference]: Without dead ends: 216 [2020-02-10 20:42:46,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-02-10 20:42:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2020-02-10 20:42:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:42:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 403 transitions. [2020-02-10 20:42:46,507 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 403 transitions. Word has length 19 [2020-02-10 20:42:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:46,507 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 403 transitions. [2020-02-10 20:42:46,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 403 transitions. [2020-02-10 20:42:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:46,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:46,507 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:46,508 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash -303397320, now seen corresponding path program 502 times [2020-02-10 20:42:46,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:46,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261283540] [2020-02-10 20:42:46,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:46,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261283540] [2020-02-10 20:42:46,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:46,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:46,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826861122] [2020-02-10 20:42:46,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:46,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:46,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:46,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:46,719 INFO L87 Difference]: Start difference. First operand 147 states and 403 transitions. Second operand 8 states. [2020-02-10 20:42:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:46,809 INFO L93 Difference]: Finished difference Result 228 states and 521 transitions. [2020-02-10 20:42:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:46,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:46,810 INFO L225 Difference]: With dead ends: 228 [2020-02-10 20:42:46,810 INFO L226 Difference]: Without dead ends: 214 [2020-02-10 20:42:46,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-02-10 20:42:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 145. [2020-02-10 20:42:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:42:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 399 transitions. [2020-02-10 20:42:46,814 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 399 transitions. Word has length 19 [2020-02-10 20:42:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:46,814 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 399 transitions. [2020-02-10 20:42:46,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 399 transitions. [2020-02-10 20:42:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:46,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:46,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:46,815 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:46,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:46,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1712931448, now seen corresponding path program 503 times [2020-02-10 20:42:46,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:46,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323647051] [2020-02-10 20:42:46,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:47,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323647051] [2020-02-10 20:42:47,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:47,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:47,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921835943] [2020-02-10 20:42:47,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:47,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:47,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:47,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:47,025 INFO L87 Difference]: Start difference. First operand 145 states and 399 transitions. Second operand 8 states. [2020-02-10 20:42:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:47,093 INFO L93 Difference]: Finished difference Result 226 states and 517 transitions. [2020-02-10 20:42:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:47,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:47,094 INFO L225 Difference]: With dead ends: 226 [2020-02-10 20:42:47,094 INFO L226 Difference]: Without dead ends: 216 [2020-02-10 20:42:47,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-02-10 20:42:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2020-02-10 20:42:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:42:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 402 transitions. [2020-02-10 20:42:47,099 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 402 transitions. Word has length 19 [2020-02-10 20:42:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:47,099 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 402 transitions. [2020-02-10 20:42:47,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 402 transitions. [2020-02-10 20:42:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:47,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:47,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:47,099 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:47,100 INFO L82 PathProgramCache]: Analyzing trace with hash 857624794, now seen corresponding path program 504 times [2020-02-10 20:42:47,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:47,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168652171] [2020-02-10 20:42:47,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:47,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168652171] [2020-02-10 20:42:47,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:47,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:47,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999265915] [2020-02-10 20:42:47,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:47,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:47,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:47,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:47,319 INFO L87 Difference]: Start difference. First operand 147 states and 402 transitions. Second operand 8 states. [2020-02-10 20:42:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:47,407 INFO L93 Difference]: Finished difference Result 228 states and 520 transitions. [2020-02-10 20:42:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:47,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:47,408 INFO L225 Difference]: With dead ends: 228 [2020-02-10 20:42:47,408 INFO L226 Difference]: Without dead ends: 211 [2020-02-10 20:42:47,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-02-10 20:42:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 142. [2020-02-10 20:42:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 20:42:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 394 transitions. [2020-02-10 20:42:47,413 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 394 transitions. Word has length 19 [2020-02-10 20:42:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:47,413 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 394 transitions. [2020-02-10 20:42:47,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 394 transitions. [2020-02-10 20:42:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:47,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:47,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:47,414 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:47,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1123308150, now seen corresponding path program 505 times [2020-02-10 20:42:47,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:47,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725960590] [2020-02-10 20:42:47,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:47,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725960590] [2020-02-10 20:42:47,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:47,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:47,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176669316] [2020-02-10 20:42:47,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:47,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:47,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:47,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:47,600 INFO L87 Difference]: Start difference. First operand 142 states and 394 transitions. Second operand 8 states. [2020-02-10 20:42:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:47,663 INFO L93 Difference]: Finished difference Result 241 states and 546 transitions. [2020-02-10 20:42:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:47,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:47,664 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:42:47,664 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:42:47,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:42:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-02-10 20:42:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:42:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 398 transitions. [2020-02-10 20:42:47,667 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 398 transitions. Word has length 19 [2020-02-10 20:42:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:47,668 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 398 transitions. [2020-02-10 20:42:47,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 398 transitions. [2020-02-10 20:42:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:47,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:47,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:47,668 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:47,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1019932600, now seen corresponding path program 506 times [2020-02-10 20:42:47,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:47,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102726209] [2020-02-10 20:42:47,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:47,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102726209] [2020-02-10 20:42:47,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:47,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:47,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687858764] [2020-02-10 20:42:47,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:47,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:47,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:47,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:47,851 INFO L87 Difference]: Start difference. First operand 145 states and 398 transitions. Second operand 8 states. [2020-02-10 20:42:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:47,929 INFO L93 Difference]: Finished difference Result 235 states and 531 transitions. [2020-02-10 20:42:47,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:47,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:47,930 INFO L225 Difference]: With dead ends: 235 [2020-02-10 20:42:47,931 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 20:42:47,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 20:42:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 142. [2020-02-10 20:42:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 20:42:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 392 transitions. [2020-02-10 20:42:47,934 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 392 transitions. Word has length 19 [2020-02-10 20:42:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:47,934 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 392 transitions. [2020-02-10 20:42:47,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 392 transitions. [2020-02-10 20:42:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:47,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:47,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:47,935 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:47,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1571221292, now seen corresponding path program 507 times [2020-02-10 20:42:47,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:47,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249203390] [2020-02-10 20:42:47,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:48,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249203390] [2020-02-10 20:42:48,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:48,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:48,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642578450] [2020-02-10 20:42:48,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:48,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:48,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:48,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:48,126 INFO L87 Difference]: Start difference. First operand 142 states and 392 transitions. Second operand 8 states. [2020-02-10 20:42:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:48,180 INFO L93 Difference]: Finished difference Result 241 states and 544 transitions. [2020-02-10 20:42:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:48,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:48,181 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:42:48,181 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:42:48,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:42:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-02-10 20:42:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:42:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 396 transitions. [2020-02-10 20:42:48,185 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 396 transitions. Word has length 19 [2020-02-10 20:42:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:48,185 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 396 transitions. [2020-02-10 20:42:48,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 396 transitions. [2020-02-10 20:42:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:48,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:48,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:48,186 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1830279518, now seen corresponding path program 508 times [2020-02-10 20:42:48,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:48,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944042329] [2020-02-10 20:42:48,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:48,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944042329] [2020-02-10 20:42:48,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:48,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:48,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934180432] [2020-02-10 20:42:48,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:48,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:48,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:48,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:48,395 INFO L87 Difference]: Start difference. First operand 145 states and 396 transitions. Second operand 8 states. [2020-02-10 20:42:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:48,466 INFO L93 Difference]: Finished difference Result 235 states and 529 transitions. [2020-02-10 20:42:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:48,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:48,467 INFO L225 Difference]: With dead ends: 235 [2020-02-10 20:42:48,467 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 20:42:48,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 20:42:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 142. [2020-02-10 20:42:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 20:42:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 390 transitions. [2020-02-10 20:42:48,473 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 390 transitions. Word has length 19 [2020-02-10 20:42:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:48,473 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 390 transitions. [2020-02-10 20:42:48,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 390 transitions. [2020-02-10 20:42:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:48,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:48,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:48,474 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:48,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 589841196, now seen corresponding path program 509 times [2020-02-10 20:42:48,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:48,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438047892] [2020-02-10 20:42:48,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:48,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438047892] [2020-02-10 20:42:48,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:48,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:48,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142929800] [2020-02-10 20:42:48,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:48,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:48,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:48,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:48,705 INFO L87 Difference]: Start difference. First operand 142 states and 390 transitions. Second operand 8 states. [2020-02-10 20:42:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:48,790 INFO L93 Difference]: Finished difference Result 227 states and 513 transitions. [2020-02-10 20:42:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:48,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:48,791 INFO L225 Difference]: With dead ends: 227 [2020-02-10 20:42:48,791 INFO L226 Difference]: Without dead ends: 217 [2020-02-10 20:42:48,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-02-10 20:42:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 143. [2020-02-10 20:42:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:42:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2020-02-10 20:42:48,795 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 19 [2020-02-10 20:42:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:48,796 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2020-02-10 20:42:48,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2020-02-10 20:42:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:48,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:48,796 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:48,796 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:48,797 INFO L82 PathProgramCache]: Analyzing trace with hash 350198858, now seen corresponding path program 510 times [2020-02-10 20:42:48,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:48,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850818559] [2020-02-10 20:42:48,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:48,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850818559] [2020-02-10 20:42:48,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:48,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:48,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78291529] [2020-02-10 20:42:48,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:48,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:48,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:48,997 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand 8 states. [2020-02-10 20:42:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:49,064 INFO L93 Difference]: Finished difference Result 227 states and 512 transitions. [2020-02-10 20:42:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:49,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:49,065 INFO L225 Difference]: With dead ends: 227 [2020-02-10 20:42:49,065 INFO L226 Difference]: Without dead ends: 214 [2020-02-10 20:42:49,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-02-10 20:42:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 140. [2020-02-10 20:42:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 20:42:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 386 transitions. [2020-02-10 20:42:49,069 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 386 transitions. Word has length 19 [2020-02-10 20:42:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:49,070 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 386 transitions. [2020-02-10 20:42:49,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 386 transitions. [2020-02-10 20:42:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:49,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:49,070 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:49,070 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1566207290, now seen corresponding path program 511 times [2020-02-10 20:42:49,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:49,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052481032] [2020-02-10 20:42:49,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:49,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052481032] [2020-02-10 20:42:49,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:49,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:49,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380854217] [2020-02-10 20:42:49,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:49,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:49,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:49,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:49,249 INFO L87 Difference]: Start difference. First operand 140 states and 386 transitions. Second operand 8 states. [2020-02-10 20:42:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:49,312 INFO L93 Difference]: Finished difference Result 246 states and 561 transitions. [2020-02-10 20:42:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:49,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:49,313 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:42:49,314 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:42:49,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:42:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2020-02-10 20:42:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 20:42:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 400 transitions. [2020-02-10 20:42:49,317 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 400 transitions. Word has length 19 [2020-02-10 20:42:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:49,318 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 400 transitions. [2020-02-10 20:42:49,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 400 transitions. [2020-02-10 20:42:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:49,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:49,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:49,318 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash 577033460, now seen corresponding path program 512 times [2020-02-10 20:42:49,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:49,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415261102] [2020-02-10 20:42:49,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:49,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415261102] [2020-02-10 20:42:49,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:49,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:49,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702121249] [2020-02-10 20:42:49,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:49,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:49,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:49,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:49,494 INFO L87 Difference]: Start difference. First operand 146 states and 400 transitions. Second operand 8 states. [2020-02-10 20:42:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:49,577 INFO L93 Difference]: Finished difference Result 240 states and 546 transitions. [2020-02-10 20:42:49,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:49,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:49,578 INFO L225 Difference]: With dead ends: 240 [2020-02-10 20:42:49,578 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 20:42:49,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 20:42:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-02-10 20:42:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:42:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 393 transitions. [2020-02-10 20:42:49,582 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 393 transitions. Word has length 19 [2020-02-10 20:42:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:49,582 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 393 transitions. [2020-02-10 20:42:49,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 393 transitions. [2020-02-10 20:42:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:49,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:49,583 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:49,583 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:49,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2072553556, now seen corresponding path program 513 times [2020-02-10 20:42:49,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:49,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293105838] [2020-02-10 20:42:49,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:49,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293105838] [2020-02-10 20:42:49,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:49,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:49,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847750566] [2020-02-10 20:42:49,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:49,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:49,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:49,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:49,763 INFO L87 Difference]: Start difference. First operand 143 states and 393 transitions. Second operand 8 states. [2020-02-10 20:42:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:49,827 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-02-10 20:42:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:49,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:49,828 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:42:49,828 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:42:49,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:42:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 20:42:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 404 transitions. [2020-02-10 20:42:49,832 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 404 transitions. Word has length 19 [2020-02-10 20:42:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:49,832 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 404 transitions. [2020-02-10 20:42:49,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 404 transitions. [2020-02-10 20:42:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:49,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:49,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:49,833 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:49,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:49,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1246208990, now seen corresponding path program 514 times [2020-02-10 20:42:49,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:49,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131432874] [2020-02-10 20:42:49,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:50,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131432874] [2020-02-10 20:42:50,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:50,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:50,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713907000] [2020-02-10 20:42:50,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:50,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:50,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:50,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:50,012 INFO L87 Difference]: Start difference. First operand 149 states and 404 transitions. Second operand 8 states. [2020-02-10 20:42:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:50,095 INFO L93 Difference]: Finished difference Result 232 states and 540 transitions. [2020-02-10 20:42:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:50,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:50,096 INFO L225 Difference]: With dead ends: 232 [2020-02-10 20:42:50,097 INFO L226 Difference]: Without dead ends: 213 [2020-02-10 20:42:50,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-02-10 20:42:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2020-02-10 20:42:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:42:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 390 transitions. [2020-02-10 20:42:50,100 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 390 transitions. Word has length 19 [2020-02-10 20:42:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:50,100 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 390 transitions. [2020-02-10 20:42:50,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 390 transitions. [2020-02-10 20:42:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:50,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:50,101 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:50,101 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:50,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:50,101 INFO L82 PathProgramCache]: Analyzing trace with hash 692674962, now seen corresponding path program 515 times [2020-02-10 20:42:50,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:50,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280117498] [2020-02-10 20:42:50,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:50,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280117498] [2020-02-10 20:42:50,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:50,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:50,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914569785] [2020-02-10 20:42:50,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:50,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:50,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:50,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:50,272 INFO L87 Difference]: Start difference. First operand 143 states and 390 transitions. Second operand 8 states. [2020-02-10 20:42:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:50,353 INFO L93 Difference]: Finished difference Result 234 states and 533 transitions. [2020-02-10 20:42:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:50,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:50,354 INFO L225 Difference]: With dead ends: 234 [2020-02-10 20:42:50,354 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:42:50,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:42:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 145. [2020-02-10 20:42:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:42:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 393 transitions. [2020-02-10 20:42:50,358 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 393 transitions. Word has length 19 [2020-02-10 20:42:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:50,358 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 393 transitions. [2020-02-10 20:42:50,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 393 transitions. [2020-02-10 20:42:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:50,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:50,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:50,358 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1036372372, now seen corresponding path program 516 times [2020-02-10 20:42:50,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:50,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689815518] [2020-02-10 20:42:50,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:50,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689815518] [2020-02-10 20:42:50,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:50,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:50,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999841148] [2020-02-10 20:42:50,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:50,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:50,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:50,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:50,530 INFO L87 Difference]: Start difference. First operand 145 states and 393 transitions. Second operand 8 states. [2020-02-10 20:42:50,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:50,614 INFO L93 Difference]: Finished difference Result 228 states and 529 transitions. [2020-02-10 20:42:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:50,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:50,615 INFO L225 Difference]: With dead ends: 228 [2020-02-10 20:42:50,615 INFO L226 Difference]: Without dead ends: 210 [2020-02-10 20:42:50,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-02-10 20:42:50,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 140. [2020-02-10 20:42:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 20:42:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 384 transitions. [2020-02-10 20:42:50,619 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 384 transitions. Word has length 19 [2020-02-10 20:42:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:50,619 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 384 transitions. [2020-02-10 20:42:50,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 384 transitions. [2020-02-10 20:42:50,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:50,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:50,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:50,620 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:50,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1240611066, now seen corresponding path program 517 times [2020-02-10 20:42:50,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:50,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477050877] [2020-02-10 20:42:50,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:50,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477050877] [2020-02-10 20:42:50,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:50,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:50,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374350127] [2020-02-10 20:42:50,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:50,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:50,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:50,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:50,806 INFO L87 Difference]: Start difference. First operand 140 states and 384 transitions. Second operand 8 states. [2020-02-10 20:42:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:50,868 INFO L93 Difference]: Finished difference Result 246 states and 559 transitions. [2020-02-10 20:42:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:50,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:50,869 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:42:50,869 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:42:50,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:50,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:42:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2020-02-10 20:42:50,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 20:42:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 398 transitions. [2020-02-10 20:42:50,873 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 398 transitions. Word has length 19 [2020-02-10 20:42:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:50,873 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 398 transitions. [2020-02-10 20:42:50,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 398 transitions. [2020-02-10 20:42:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:50,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:50,874 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:50,874 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash -981552840, now seen corresponding path program 518 times [2020-02-10 20:42:50,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:50,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199952852] [2020-02-10 20:42:50,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:51,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199952852] [2020-02-10 20:42:51,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:51,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:51,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590228713] [2020-02-10 20:42:51,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:51,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:51,061 INFO L87 Difference]: Start difference. First operand 146 states and 398 transitions. Second operand 8 states. [2020-02-10 20:42:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:51,124 INFO L93 Difference]: Finished difference Result 240 states and 544 transitions. [2020-02-10 20:42:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:51,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:51,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:51,125 INFO L225 Difference]: With dead ends: 240 [2020-02-10 20:42:51,125 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 20:42:51,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 20:42:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-02-10 20:42:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:42:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2020-02-10 20:42:51,128 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 19 [2020-02-10 20:42:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:51,128 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2020-02-10 20:42:51,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2020-02-10 20:42:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:51,129 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:51,129 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:51,129 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:51,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash -146519478, now seen corresponding path program 519 times [2020-02-10 20:42:51,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:51,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987259052] [2020-02-10 20:42:51,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:51,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987259052] [2020-02-10 20:42:51,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:51,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:51,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831621464] [2020-02-10 20:42:51,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:51,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:51,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:51,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:51,318 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand 8 states. [2020-02-10 20:42:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:51,384 INFO L93 Difference]: Finished difference Result 244 states and 558 transitions. [2020-02-10 20:42:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:51,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:51,385 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:42:51,385 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:42:51,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:42:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 20:42:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:42:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 402 transitions. [2020-02-10 20:42:51,388 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 402 transitions. Word has length 19 [2020-02-10 20:42:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:51,388 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 402 transitions. [2020-02-10 20:42:51,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 402 transitions. [2020-02-10 20:42:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:51,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:51,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:51,389 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:51,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:51,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1122724228, now seen corresponding path program 520 times [2020-02-10 20:42:51,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:51,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061153285] [2020-02-10 20:42:51,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:51,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061153285] [2020-02-10 20:42:51,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:51,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:51,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790705556] [2020-02-10 20:42:51,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:51,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:51,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:51,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:51,574 INFO L87 Difference]: Start difference. First operand 149 states and 402 transitions. Second operand 8 states. [2020-02-10 20:42:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:51,664 INFO L93 Difference]: Finished difference Result 232 states and 538 transitions. [2020-02-10 20:42:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:51,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:51,665 INFO L225 Difference]: With dead ends: 232 [2020-02-10 20:42:51,665 INFO L226 Difference]: Without dead ends: 213 [2020-02-10 20:42:51,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-02-10 20:42:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2020-02-10 20:42:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:42:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 388 transitions. [2020-02-10 20:42:51,668 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 388 transitions. Word has length 19 [2020-02-10 20:42:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:51,668 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 388 transitions. [2020-02-10 20:42:51,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 388 transitions. [2020-02-10 20:42:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:51,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:51,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:51,669 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:51,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1864843108, now seen corresponding path program 521 times [2020-02-10 20:42:51,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:51,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091753079] [2020-02-10 20:42:51,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:51,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091753079] [2020-02-10 20:42:51,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:51,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:51,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657049516] [2020-02-10 20:42:51,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:51,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:51,853 INFO L87 Difference]: Start difference. First operand 143 states and 388 transitions. Second operand 8 states. [2020-02-10 20:42:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:51,917 INFO L93 Difference]: Finished difference Result 234 states and 531 transitions. [2020-02-10 20:42:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:51,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:51,918 INFO L225 Difference]: With dead ends: 234 [2020-02-10 20:42:51,918 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:42:51,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:42:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 145. [2020-02-10 20:42:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:42:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 391 transitions. [2020-02-10 20:42:51,922 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 391 transitions. Word has length 19 [2020-02-10 20:42:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:51,923 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 391 transitions. [2020-02-10 20:42:51,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 391 transitions. [2020-02-10 20:42:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:51,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:51,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:51,924 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash -940719192, now seen corresponding path program 522 times [2020-02-10 20:42:51,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:51,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890412444] [2020-02-10 20:42:51,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:52,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890412444] [2020-02-10 20:42:52,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:52,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:52,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373257523] [2020-02-10 20:42:52,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:52,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:52,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:52,106 INFO L87 Difference]: Start difference. First operand 145 states and 391 transitions. Second operand 8 states. [2020-02-10 20:42:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:52,191 INFO L93 Difference]: Finished difference Result 228 states and 527 transitions. [2020-02-10 20:42:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:52,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:52,192 INFO L225 Difference]: With dead ends: 228 [2020-02-10 20:42:52,192 INFO L226 Difference]: Without dead ends: 210 [2020-02-10 20:42:52,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-02-10 20:42:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 140. [2020-02-10 20:42:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 20:42:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 382 transitions. [2020-02-10 20:42:52,196 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 382 transitions. Word has length 19 [2020-02-10 20:42:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:52,197 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 382 transitions. [2020-02-10 20:42:52,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 382 transitions. [2020-02-10 20:42:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:52,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:52,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:52,197 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1366197632, now seen corresponding path program 523 times [2020-02-10 20:42:52,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:52,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133180329] [2020-02-10 20:42:52,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:52,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133180329] [2020-02-10 20:42:52,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:52,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:52,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566192725] [2020-02-10 20:42:52,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:52,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:52,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:52,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:52,390 INFO L87 Difference]: Start difference. First operand 140 states and 382 transitions. Second operand 8 states. [2020-02-10 20:42:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:52,479 INFO L93 Difference]: Finished difference Result 220 states and 497 transitions. [2020-02-10 20:42:52,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:52,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:52,480 INFO L225 Difference]: With dead ends: 220 [2020-02-10 20:42:52,481 INFO L226 Difference]: Without dead ends: 210 [2020-02-10 20:42:52,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-02-10 20:42:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 142. [2020-02-10 20:42:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 20:42:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 386 transitions. [2020-02-10 20:42:52,484 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 386 transitions. Word has length 19 [2020-02-10 20:42:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:52,484 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 386 transitions. [2020-02-10 20:42:52,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 386 transitions. [2020-02-10 20:42:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:52,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:52,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:52,485 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:52,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1605839970, now seen corresponding path program 524 times [2020-02-10 20:42:52,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:52,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982065946] [2020-02-10 20:42:52,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:52,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982065946] [2020-02-10 20:42:52,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:52,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:52,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102710266] [2020-02-10 20:42:52,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:52,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:52,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:52,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:52,699 INFO L87 Difference]: Start difference. First operand 142 states and 386 transitions. Second operand 8 states. [2020-02-10 20:42:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:52,760 INFO L93 Difference]: Finished difference Result 220 states and 496 transitions. [2020-02-10 20:42:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:52,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:52,761 INFO L225 Difference]: With dead ends: 220 [2020-02-10 20:42:52,761 INFO L226 Difference]: Without dead ends: 209 [2020-02-10 20:42:52,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-02-10 20:42:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 141. [2020-02-10 20:42:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-02-10 20:42:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 384 transitions. [2020-02-10 20:42:52,765 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 384 transitions. Word has length 19 [2020-02-10 20:42:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:52,765 INFO L479 AbstractCegarLoop]: Abstraction has 141 states and 384 transitions. [2020-02-10 20:42:52,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 384 transitions. [2020-02-10 20:42:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:52,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:52,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:52,766 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:52,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1855684284, now seen corresponding path program 525 times [2020-02-10 20:42:52,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:52,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049661838] [2020-02-10 20:42:52,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:52,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049661838] [2020-02-10 20:42:52,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:52,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:52,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278635162] [2020-02-10 20:42:52,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:52,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:52,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:52,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:52,954 INFO L87 Difference]: Start difference. First operand 141 states and 384 transitions. Second operand 8 states. [2020-02-10 20:42:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:53,029 INFO L93 Difference]: Finished difference Result 222 states and 503 transitions. [2020-02-10 20:42:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:53,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:53,030 INFO L225 Difference]: With dead ends: 222 [2020-02-10 20:42:53,031 INFO L226 Difference]: Without dead ends: 212 [2020-02-10 20:42:53,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-02-10 20:42:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2020-02-10 20:42:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:42:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 387 transitions. [2020-02-10 20:42:53,035 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 387 transitions. Word has length 19 [2020-02-10 20:42:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:53,035 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 387 transitions. [2020-02-10 20:42:53,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 387 transitions. [2020-02-10 20:42:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:53,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:53,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:53,035 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:53,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1484304008, now seen corresponding path program 526 times [2020-02-10 20:42:53,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:53,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181955826] [2020-02-10 20:42:53,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:53,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181955826] [2020-02-10 20:42:53,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:53,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:53,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418549781] [2020-02-10 20:42:53,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:53,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:53,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:53,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:53,218 INFO L87 Difference]: Start difference. First operand 143 states and 387 transitions. Second operand 8 states. [2020-02-10 20:42:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:53,303 INFO L93 Difference]: Finished difference Result 216 states and 499 transitions. [2020-02-10 20:42:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:53,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:53,304 INFO L225 Difference]: With dead ends: 216 [2020-02-10 20:42:53,304 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 20:42:53,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 20:42:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 141. [2020-02-10 20:42:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-02-10 20:42:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 383 transitions. [2020-02-10 20:42:53,308 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 383 transitions. Word has length 19 [2020-02-10 20:42:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:53,308 INFO L479 AbstractCegarLoop]: Abstraction has 141 states and 383 transitions. [2020-02-10 20:42:53,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 383 transitions. [2020-02-10 20:42:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:53,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:53,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:53,308 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:53,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:53,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1067984392, now seen corresponding path program 527 times [2020-02-10 20:42:53,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:53,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720175541] [2020-02-10 20:42:53,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:53,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720175541] [2020-02-10 20:42:53,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:53,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:53,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116307592] [2020-02-10 20:42:53,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:53,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:53,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:53,503 INFO L87 Difference]: Start difference. First operand 141 states and 383 transitions. Second operand 8 states. [2020-02-10 20:42:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:53,567 INFO L93 Difference]: Finished difference Result 222 states and 502 transitions. [2020-02-10 20:42:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:53,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:53,568 INFO L225 Difference]: With dead ends: 222 [2020-02-10 20:42:53,569 INFO L226 Difference]: Without dead ends: 212 [2020-02-10 20:42:53,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-02-10 20:42:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2020-02-10 20:42:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:42:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 386 transitions. [2020-02-10 20:42:53,572 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 386 transitions. Word has length 19 [2020-02-10 20:42:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:53,572 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 386 transitions. [2020-02-10 20:42:53,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 386 transitions. [2020-02-10 20:42:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:53,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:53,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:53,573 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:53,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:53,573 INFO L82 PathProgramCache]: Analyzing trace with hash 421420604, now seen corresponding path program 528 times [2020-02-10 20:42:53,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:53,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578990048] [2020-02-10 20:42:53,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:53,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578990048] [2020-02-10 20:42:53,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:53,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:53,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560587311] [2020-02-10 20:42:53,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:53,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:53,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:53,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:53,759 INFO L87 Difference]: Start difference. First operand 143 states and 386 transitions. Second operand 8 states. [2020-02-10 20:42:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:53,846 INFO L93 Difference]: Finished difference Result 216 states and 498 transitions. [2020-02-10 20:42:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:53,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:53,847 INFO L225 Difference]: With dead ends: 216 [2020-02-10 20:42:53,847 INFO L226 Difference]: Without dead ends: 198 [2020-02-10 20:42:53,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-02-10 20:42:53,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 138. [2020-02-10 20:42:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 20:42:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 378 transitions. [2020-02-10 20:42:53,850 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 378 transitions. Word has length 19 [2020-02-10 20:42:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:53,850 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 378 transitions. [2020-02-10 20:42:53,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 378 transitions. [2020-02-10 20:42:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:53,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:53,851 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:53,851 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:53,851 INFO L82 PathProgramCache]: Analyzing trace with hash 380240202, now seen corresponding path program 529 times [2020-02-10 20:42:53,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:53,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429644864] [2020-02-10 20:42:53,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:54,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429644864] [2020-02-10 20:42:54,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:54,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:54,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620966113] [2020-02-10 20:42:54,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:54,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:54,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:54,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:54,063 INFO L87 Difference]: Start difference. First operand 138 states and 378 transitions. Second operand 8 states. [2020-02-10 20:42:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:54,132 INFO L93 Difference]: Finished difference Result 245 states and 557 transitions. [2020-02-10 20:42:54,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:54,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:54,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:54,133 INFO L225 Difference]: With dead ends: 245 [2020-02-10 20:42:54,133 INFO L226 Difference]: Without dead ends: 229 [2020-02-10 20:42:54,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-02-10 20:42:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 141. [2020-02-10 20:42:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-02-10 20:42:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 382 transitions. [2020-02-10 20:42:54,137 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 382 transitions. Word has length 19 [2020-02-10 20:42:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:54,137 INFO L479 AbstractCegarLoop]: Abstraction has 141 states and 382 transitions. [2020-02-10 20:42:54,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 382 transitions. [2020-02-10 20:42:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:54,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:54,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:54,137 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:54,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1771486344, now seen corresponding path program 530 times [2020-02-10 20:42:54,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:54,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157678089] [2020-02-10 20:42:54,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:54,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157678089] [2020-02-10 20:42:54,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:54,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:54,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054541542] [2020-02-10 20:42:54,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:54,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:54,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:54,330 INFO L87 Difference]: Start difference. First operand 141 states and 382 transitions. Second operand 8 states. [2020-02-10 20:42:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:54,409 INFO L93 Difference]: Finished difference Result 239 states and 542 transitions. [2020-02-10 20:42:54,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:54,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:54,410 INFO L225 Difference]: With dead ends: 239 [2020-02-10 20:42:54,410 INFO L226 Difference]: Without dead ends: 226 [2020-02-10 20:42:54,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-02-10 20:42:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 138. [2020-02-10 20:42:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 20:42:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 375 transitions. [2020-02-10 20:42:54,414 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 375 transitions. Word has length 19 [2020-02-10 20:42:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:54,415 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 375 transitions. [2020-02-10 20:42:54,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 375 transitions. [2020-02-10 20:42:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:54,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:54,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:54,415 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:54,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:54,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1474331790, now seen corresponding path program 531 times [2020-02-10 20:42:54,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:54,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497257626] [2020-02-10 20:42:54,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:54,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497257626] [2020-02-10 20:42:54,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:54,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:54,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830768926] [2020-02-10 20:42:54,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:54,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:54,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:54,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:54,616 INFO L87 Difference]: Start difference. First operand 138 states and 375 transitions. Second operand 8 states. [2020-02-10 20:42:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:54,676 INFO L93 Difference]: Finished difference Result 249 states and 566 transitions. [2020-02-10 20:42:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:54,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:54,677 INFO L225 Difference]: With dead ends: 249 [2020-02-10 20:42:54,677 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 20:42:54,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 20:42:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 143. [2020-02-10 20:42:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:42:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 384 transitions. [2020-02-10 20:42:54,680 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 384 transitions. Word has length 19 [2020-02-10 20:42:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:54,681 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 384 transitions. [2020-02-10 20:42:54,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 384 transitions. [2020-02-10 20:42:54,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:54,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:54,681 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:54,681 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:54,681 INFO L82 PathProgramCache]: Analyzing trace with hash 723269696, now seen corresponding path program 532 times [2020-02-10 20:42:54,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:54,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737886391] [2020-02-10 20:42:54,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:54,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737886391] [2020-02-10 20:42:54,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:54,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:54,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172622351] [2020-02-10 20:42:54,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:54,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:54,878 INFO L87 Difference]: Start difference. First operand 143 states and 384 transitions. Second operand 8 states. [2020-02-10 20:42:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:54,962 INFO L93 Difference]: Finished difference Result 245 states and 554 transitions. [2020-02-10 20:42:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:54,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:54,963 INFO L225 Difference]: With dead ends: 245 [2020-02-10 20:42:54,963 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:42:54,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:42:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 138. [2020-02-10 20:42:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 20:42:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 372 transitions. [2020-02-10 20:42:54,966 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 372 transitions. Word has length 19 [2020-02-10 20:42:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:54,966 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 372 transitions. [2020-02-10 20:42:54,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 372 transitions. [2020-02-10 20:42:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:54,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:54,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:54,967 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1883916852, now seen corresponding path program 533 times [2020-02-10 20:42:54,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:54,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531623815] [2020-02-10 20:42:54,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:55,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531623815] [2020-02-10 20:42:55,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:55,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:55,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220578335] [2020-02-10 20:42:55,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:55,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:55,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:55,160 INFO L87 Difference]: Start difference. First operand 138 states and 372 transitions. Second operand 8 states. [2020-02-10 20:42:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:55,241 INFO L93 Difference]: Finished difference Result 234 states and 530 transitions. [2020-02-10 20:42:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:55,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:55,242 INFO L225 Difference]: With dead ends: 234 [2020-02-10 20:42:55,242 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:42:55,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:42:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2020-02-10 20:42:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 20:42:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 375 transitions. [2020-02-10 20:42:55,246 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 375 transitions. Word has length 19 [2020-02-10 20:42:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:55,247 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 375 transitions. [2020-02-10 20:42:55,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 375 transitions. [2020-02-10 20:42:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:55,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:55,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:55,248 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash -700437136, now seen corresponding path program 534 times [2020-02-10 20:42:55,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:55,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675998018] [2020-02-10 20:42:55,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:55,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675998018] [2020-02-10 20:42:55,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:55,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:55,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903078739] [2020-02-10 20:42:55,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:55,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:55,450 INFO L87 Difference]: Start difference. First operand 140 states and 375 transitions. Second operand 8 states. [2020-02-10 20:42:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:55,534 INFO L93 Difference]: Finished difference Result 236 states and 533 transitions. [2020-02-10 20:42:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:55,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:55,535 INFO L225 Difference]: With dead ends: 236 [2020-02-10 20:42:55,535 INFO L226 Difference]: Without dead ends: 219 [2020-02-10 20:42:55,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:55,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-02-10 20:42:55,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 135. [2020-02-10 20:42:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-02-10 20:42:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 365 transitions. [2020-02-10 20:42:55,538 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 365 transitions. Word has length 19 [2020-02-10 20:42:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:55,538 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 365 transitions. [2020-02-10 20:42:55,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 365 transitions. [2020-02-10 20:42:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:55,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:55,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:55,539 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:55,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:55,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1988693016, now seen corresponding path program 535 times [2020-02-10 20:42:55,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:55,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259333273] [2020-02-10 20:42:55,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:55,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259333273] [2020-02-10 20:42:55,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:55,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:55,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512048442] [2020-02-10 20:42:55,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:55,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:55,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:55,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:55,712 INFO L87 Difference]: Start difference. First operand 135 states and 365 transitions. Second operand 8 states. [2020-02-10 20:42:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:55,773 INFO L93 Difference]: Finished difference Result 241 states and 542 transitions. [2020-02-10 20:42:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:55,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:55,774 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:42:55,774 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:42:55,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:42:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 135. [2020-02-10 20:42:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-02-10 20:42:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 362 transitions. [2020-02-10 20:42:55,776 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 362 transitions. Word has length 19 [2020-02-10 20:42:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:55,777 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 362 transitions. [2020-02-10 20:42:55,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 362 transitions. [2020-02-10 20:42:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:55,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:55,777 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:55,777 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:55,777 INFO L82 PathProgramCache]: Analyzing trace with hash 154547734, now seen corresponding path program 536 times [2020-02-10 20:42:55,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:55,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145289790] [2020-02-10 20:42:55,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:55,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145289790] [2020-02-10 20:42:55,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:55,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:55,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983535105] [2020-02-10 20:42:55,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:55,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:55,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:55,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:55,951 INFO L87 Difference]: Start difference. First operand 135 states and 362 transitions. Second operand 8 states. [2020-02-10 20:42:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:56,027 INFO L93 Difference]: Finished difference Result 235 states and 527 transitions. [2020-02-10 20:42:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:56,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:56,028 INFO L225 Difference]: With dead ends: 235 [2020-02-10 20:42:56,028 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 20:42:56,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 20:42:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 132. [2020-02-10 20:42:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-02-10 20:42:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 355 transitions. [2020-02-10 20:42:56,031 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 355 transitions. Word has length 19 [2020-02-10 20:42:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:56,032 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 355 transitions. [2020-02-10 20:42:56,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 355 transitions. [2020-02-10 20:42:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:56,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:56,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:56,032 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:56,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:56,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1799928014, now seen corresponding path program 537 times [2020-02-10 20:42:56,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:56,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883544620] [2020-02-10 20:42:56,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:56,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883544620] [2020-02-10 20:42:56,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:56,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:56,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688840134] [2020-02-10 20:42:56,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:56,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:56,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:56,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:56,218 INFO L87 Difference]: Start difference. First operand 132 states and 355 transitions. Second operand 8 states. [2020-02-10 20:42:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:56,280 INFO L93 Difference]: Finished difference Result 239 states and 541 transitions. [2020-02-10 20:42:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:56,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:56,281 INFO L225 Difference]: With dead ends: 239 [2020-02-10 20:42:56,281 INFO L226 Difference]: Without dead ends: 223 [2020-02-10 20:42:56,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-02-10 20:42:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 138. [2020-02-10 20:42:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 20:42:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 366 transitions. [2020-02-10 20:42:56,285 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 366 transitions. Word has length 19 [2020-02-10 20:42:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:56,285 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 366 transitions. [2020-02-10 20:42:56,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 366 transitions. [2020-02-10 20:42:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:56,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:56,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:56,286 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:56,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:56,286 INFO L82 PathProgramCache]: Analyzing trace with hash 823723264, now seen corresponding path program 538 times [2020-02-10 20:42:56,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:56,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661581783] [2020-02-10 20:42:56,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:56,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661581783] [2020-02-10 20:42:56,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:56,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:56,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590604548] [2020-02-10 20:42:56,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:56,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:56,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:56,463 INFO L87 Difference]: Start difference. First operand 138 states and 366 transitions. Second operand 8 states. [2020-02-10 20:42:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:56,544 INFO L93 Difference]: Finished difference Result 227 states and 521 transitions. [2020-02-10 20:42:56,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:56,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:56,545 INFO L225 Difference]: With dead ends: 227 [2020-02-10 20:42:56,545 INFO L226 Difference]: Without dead ends: 208 [2020-02-10 20:42:56,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-02-10 20:42:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 132. [2020-02-10 20:42:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-02-10 20:42:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 352 transitions. [2020-02-10 20:42:56,549 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 352 transitions. Word has length 19 [2020-02-10 20:42:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:56,549 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 352 transitions. [2020-02-10 20:42:56,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 352 transitions. [2020-02-10 20:42:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:56,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:56,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:56,550 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:56,550 INFO L82 PathProgramCache]: Analyzing trace with hash 270189236, now seen corresponding path program 539 times [2020-02-10 20:42:56,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:56,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478774455] [2020-02-10 20:42:56,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:56,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478774455] [2020-02-10 20:42:56,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:56,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:56,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181176605] [2020-02-10 20:42:56,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:56,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:56,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:56,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:56,722 INFO L87 Difference]: Start difference. First operand 132 states and 352 transitions. Second operand 8 states. [2020-02-10 20:42:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:56,794 INFO L93 Difference]: Finished difference Result 229 states and 514 transitions. [2020-02-10 20:42:56,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:56,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:56,795 INFO L225 Difference]: With dead ends: 229 [2020-02-10 20:42:56,795 INFO L226 Difference]: Without dead ends: 219 [2020-02-10 20:42:56,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-02-10 20:42:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 134. [2020-02-10 20:42:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-02-10 20:42:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2020-02-10 20:42:56,798 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 19 [2020-02-10 20:42:56,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:56,798 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2020-02-10 20:42:56,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:56,799 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2020-02-10 20:42:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:56,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:56,799 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:56,799 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:56,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1458858098, now seen corresponding path program 540 times [2020-02-10 20:42:56,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:56,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425204244] [2020-02-10 20:42:56,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:56,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425204244] [2020-02-10 20:42:56,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:56,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:56,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447040243] [2020-02-10 20:42:56,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:56,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:56,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:56,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:56,968 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 8 states. [2020-02-10 20:42:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:57,049 INFO L93 Difference]: Finished difference Result 223 states and 510 transitions. [2020-02-10 20:42:57,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:57,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:57,050 INFO L225 Difference]: With dead ends: 223 [2020-02-10 20:42:57,050 INFO L226 Difference]: Without dead ends: 205 [2020-02-10 20:42:57,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-02-10 20:42:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 129. [2020-02-10 20:42:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-02-10 20:42:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 345 transitions. [2020-02-10 20:42:57,053 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 345 transitions. Word has length 19 [2020-02-10 20:42:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:57,054 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 345 transitions. [2020-02-10 20:42:57,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 345 transitions. [2020-02-10 20:42:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:57,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:57,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:57,054 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:57,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:57,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1337500568, now seen corresponding path program 541 times [2020-02-10 20:42:57,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:57,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379750751] [2020-02-10 20:42:57,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:57,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379750751] [2020-02-10 20:42:57,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:57,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:57,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720412451] [2020-02-10 20:42:57,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:57,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:57,256 INFO L87 Difference]: Start difference. First operand 129 states and 345 transitions. Second operand 8 states. [2020-02-10 20:42:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:57,319 INFO L93 Difference]: Finished difference Result 243 states and 557 transitions. [2020-02-10 20:42:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:57,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:57,320 INFO L225 Difference]: With dead ends: 243 [2020-02-10 20:42:57,320 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 20:42:57,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 20:42:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 139. [2020-02-10 20:42:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-02-10 20:42:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 373 transitions. [2020-02-10 20:42:57,323 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 373 transitions. Word has length 19 [2020-02-10 20:42:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:57,323 INFO L479 AbstractCegarLoop]: Abstraction has 139 states and 373 transitions. [2020-02-10 20:42:57,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 373 transitions. [2020-02-10 20:42:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:57,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:57,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:57,324 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2088562662, now seen corresponding path program 542 times [2020-02-10 20:42:57,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:57,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479130958] [2020-02-10 20:42:57,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:57,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479130958] [2020-02-10 20:42:57,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:57,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:57,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137886456] [2020-02-10 20:42:57,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:57,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:57,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:57,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:57,520 INFO L87 Difference]: Start difference. First operand 139 states and 373 transitions. Second operand 8 states. [2020-02-10 20:42:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:57,602 INFO L93 Difference]: Finished difference Result 239 states and 545 transitions. [2020-02-10 20:42:57,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:57,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:57,603 INFO L225 Difference]: With dead ends: 239 [2020-02-10 20:42:57,603 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 20:42:57,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 20:42:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 134. [2020-02-10 20:42:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-02-10 20:42:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 359 transitions. [2020-02-10 20:42:57,606 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 359 transitions. Word has length 19 [2020-02-10 20:42:57,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:57,606 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 359 transitions. [2020-02-10 20:42:57,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:57,606 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 359 transitions. [2020-02-10 20:42:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:57,607 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:57,607 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:57,607 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:57,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1357028874, now seen corresponding path program 543 times [2020-02-10 20:42:57,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:57,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569599069] [2020-02-10 20:42:57,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:57,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569599069] [2020-02-10 20:42:57,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:57,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:57,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688494652] [2020-02-10 20:42:57,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:57,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:57,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:57,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:57,802 INFO L87 Difference]: Start difference. First operand 134 states and 359 transitions. Second operand 8 states. [2020-02-10 20:42:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:57,867 INFO L93 Difference]: Finished difference Result 231 states and 525 transitions. [2020-02-10 20:42:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:57,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:57,868 INFO L225 Difference]: With dead ends: 231 [2020-02-10 20:42:57,868 INFO L226 Difference]: Without dead ends: 215 [2020-02-10 20:42:57,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-02-10 20:42:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 140. [2020-02-10 20:42:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 20:42:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 370 transitions. [2020-02-10 20:42:57,871 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 370 transitions. Word has length 19 [2020-02-10 20:42:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:57,872 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 370 transitions. [2020-02-10 20:42:57,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 370 transitions. [2020-02-10 20:42:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:57,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:57,872 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:57,872 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash 380824124, now seen corresponding path program 544 times [2020-02-10 20:42:57,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:57,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241405586] [2020-02-10 20:42:57,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:58,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241405586] [2020-02-10 20:42:58,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:58,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:58,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090058901] [2020-02-10 20:42:58,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:58,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:58,067 INFO L87 Difference]: Start difference. First operand 140 states and 370 transitions. Second operand 8 states. [2020-02-10 20:42:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:58,149 INFO L93 Difference]: Finished difference Result 219 states and 505 transitions. [2020-02-10 20:42:58,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:58,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:58,150 INFO L225 Difference]: With dead ends: 219 [2020-02-10 20:42:58,150 INFO L226 Difference]: Without dead ends: 200 [2020-02-10 20:42:58,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-02-10 20:42:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 134. [2020-02-10 20:42:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-02-10 20:42:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 354 transitions. [2020-02-10 20:42:58,154 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 354 transitions. Word has length 19 [2020-02-10 20:42:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:58,154 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 354 transitions. [2020-02-10 20:42:58,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 354 transitions. [2020-02-10 20:42:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:58,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:58,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:58,155 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:58,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:58,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2008828456, now seen corresponding path program 545 times [2020-02-10 20:42:58,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:58,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758912360] [2020-02-10 20:42:58,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:58,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758912360] [2020-02-10 20:42:58,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:58,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:58,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838792518] [2020-02-10 20:42:58,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:58,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:58,346 INFO L87 Difference]: Start difference. First operand 134 states and 354 transitions. Second operand 8 states. [2020-02-10 20:42:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:58,429 INFO L93 Difference]: Finished difference Result 216 states and 499 transitions. [2020-02-10 20:42:58,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:58,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:58,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:58,430 INFO L225 Difference]: With dead ends: 216 [2020-02-10 20:42:58,430 INFO L226 Difference]: Without dead ends: 204 [2020-02-10 20:42:58,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-02-10 20:42:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 138. [2020-02-10 20:42:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 20:42:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 362 transitions. [2020-02-10 20:42:58,433 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 362 transitions. Word has length 19 [2020-02-10 20:42:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:58,434 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 362 transitions. [2020-02-10 20:42:58,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 362 transitions. [2020-02-10 20:42:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:58,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:58,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:58,434 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:58,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1427264310, now seen corresponding path program 546 times [2020-02-10 20:42:58,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:58,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228599659] [2020-02-10 20:42:58,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:58,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228599659] [2020-02-10 20:42:58,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:58,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:58,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70055528] [2020-02-10 20:42:58,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:58,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:58,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:58,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:58,624 INFO L87 Difference]: Start difference. First operand 138 states and 362 transitions. Second operand 8 states. [2020-02-10 20:42:58,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:58,704 INFO L93 Difference]: Finished difference Result 203 states and 478 transitions. [2020-02-10 20:42:58,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:58,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:58,705 INFO L225 Difference]: With dead ends: 203 [2020-02-10 20:42:58,705 INFO L226 Difference]: Without dead ends: 181 [2020-02-10 20:42:58,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-02-10 20:42:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 129. [2020-02-10 20:42:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-02-10 20:42:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 342 transitions. [2020-02-10 20:42:58,709 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 342 transitions. Word has length 19 [2020-02-10 20:42:58,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:58,709 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 342 transitions. [2020-02-10 20:42:58,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 342 transitions. [2020-02-10 20:42:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:58,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:58,710 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:58,710 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1173836118, now seen corresponding path program 547 times [2020-02-10 20:42:58,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:58,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309899735] [2020-02-10 20:42:58,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:58,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309899735] [2020-02-10 20:42:58,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:58,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:58,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319624533] [2020-02-10 20:42:58,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:58,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:58,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:58,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:58,904 INFO L87 Difference]: Start difference. First operand 129 states and 342 transitions. Second operand 8 states. [2020-02-10 20:42:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:58,989 INFO L93 Difference]: Finished difference Result 221 states and 497 transitions. [2020-02-10 20:42:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:58,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:58,990 INFO L225 Difference]: With dead ends: 221 [2020-02-10 20:42:58,991 INFO L226 Difference]: Without dead ends: 211 [2020-02-10 20:42:58,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-02-10 20:42:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 133. [2020-02-10 20:42:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-02-10 20:42:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 352 transitions. [2020-02-10 20:42:58,994 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 352 transitions. Word has length 19 [2020-02-10 20:42:58,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:58,995 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 352 transitions. [2020-02-10 20:42:58,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 352 transitions. [2020-02-10 20:42:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:58,995 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:58,995 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:58,995 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:58,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:58,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1410517870, now seen corresponding path program 548 times [2020-02-10 20:42:58,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:58,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640171413] [2020-02-10 20:42:58,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:59,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640171413] [2020-02-10 20:42:59,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:59,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:59,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76653768] [2020-02-10 20:42:59,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:59,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:59,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:59,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:59,188 INFO L87 Difference]: Start difference. First operand 133 states and 352 transitions. Second operand 8 states. [2020-02-10 20:42:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:59,273 INFO L93 Difference]: Finished difference Result 223 states and 500 transitions. [2020-02-10 20:42:59,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:59,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:59,274 INFO L225 Difference]: With dead ends: 223 [2020-02-10 20:42:59,274 INFO L226 Difference]: Without dead ends: 209 [2020-02-10 20:42:59,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-02-10 20:42:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 131. [2020-02-10 20:42:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-02-10 20:42:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 347 transitions. [2020-02-10 20:42:59,278 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 347 transitions. Word has length 19 [2020-02-10 20:42:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:59,278 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 347 transitions. [2020-02-10 20:42:59,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 347 transitions. [2020-02-10 20:42:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:59,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:59,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:59,279 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:59,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1918538616, now seen corresponding path program 549 times [2020-02-10 20:42:59,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:59,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103595269] [2020-02-10 20:42:59,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:59,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103595269] [2020-02-10 20:42:59,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:59,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:59,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707309522] [2020-02-10 20:42:59,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:59,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:59,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:59,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:59,467 INFO L87 Difference]: Start difference. First operand 131 states and 347 transitions. Second operand 8 states. [2020-02-10 20:42:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:59,552 INFO L93 Difference]: Finished difference Result 218 states and 489 transitions. [2020-02-10 20:42:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:59,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:59,553 INFO L225 Difference]: With dead ends: 218 [2020-02-10 20:42:59,553 INFO L226 Difference]: Without dead ends: 208 [2020-02-10 20:42:59,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-02-10 20:42:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2020-02-10 20:42:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-02-10 20:42:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 350 transitions. [2020-02-10 20:42:59,556 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 350 transitions. Word has length 19 [2020-02-10 20:42:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:59,557 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 350 transitions. [2020-02-10 20:42:59,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 350 transitions. [2020-02-10 20:42:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:59,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:59,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:59,557 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash 189491282, now seen corresponding path program 550 times [2020-02-10 20:42:59,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:59,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054016244] [2020-02-10 20:42:59,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:59,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054016244] [2020-02-10 20:42:59,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:59,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:42:59,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723702948] [2020-02-10 20:42:59,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:42:59,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:59,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:42:59,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:42:59,748 INFO L87 Difference]: Start difference. First operand 133 states and 350 transitions. Second operand 8 states. [2020-02-10 20:42:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:59,832 INFO L93 Difference]: Finished difference Result 212 states and 485 transitions. [2020-02-10 20:42:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:42:59,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:42:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:59,833 INFO L225 Difference]: With dead ends: 212 [2020-02-10 20:42:59,833 INFO L226 Difference]: Without dead ends: 197 [2020-02-10 20:42:59,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:42:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-02-10 20:42:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2020-02-10 20:42:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-02-10 20:42:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 345 transitions. [2020-02-10 20:42:59,836 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 345 transitions. Word has length 19 [2020-02-10 20:42:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:59,836 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 345 transitions. [2020-02-10 20:42:59,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:42:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 345 transitions. [2020-02-10 20:42:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:42:59,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:59,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:59,837 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash 823589624, now seen corresponding path program 551 times [2020-02-10 20:42:59,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:59,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327904512] [2020-02-10 20:42:59,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:00,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327904512] [2020-02-10 20:43:00,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:00,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:00,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865572925] [2020-02-10 20:43:00,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:00,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:00,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:00,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:00,023 INFO L87 Difference]: Start difference. First operand 131 states and 345 transitions. Second operand 8 states. [2020-02-10 20:43:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:00,104 INFO L93 Difference]: Finished difference Result 213 states and 490 transitions. [2020-02-10 20:43:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:00,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:00,105 INFO L225 Difference]: With dead ends: 213 [2020-02-10 20:43:00,105 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 20:43:00,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 20:43:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2020-02-10 20:43:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-02-10 20:43:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 353 transitions. [2020-02-10 20:43:00,108 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 353 transitions. Word has length 19 [2020-02-10 20:43:00,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:00,108 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 353 transitions. [2020-02-10 20:43:00,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:00,108 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 353 transitions. [2020-02-10 20:43:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:00,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:00,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:00,109 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:00,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:00,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1678896278, now seen corresponding path program 552 times [2020-02-10 20:43:00,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:00,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686109716] [2020-02-10 20:43:00,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:00,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686109716] [2020-02-10 20:43:00,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:00,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:00,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057994745] [2020-02-10 20:43:00,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:00,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:00,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:00,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:00,298 INFO L87 Difference]: Start difference. First operand 135 states and 353 transitions. Second operand 8 states. [2020-02-10 20:43:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:00,379 INFO L93 Difference]: Finished difference Result 200 states and 469 transitions. [2020-02-10 20:43:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:00,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:00,380 INFO L225 Difference]: With dead ends: 200 [2020-02-10 20:43:00,380 INFO L226 Difference]: Without dead ends: 178 [2020-02-10 20:43:00,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-02-10 20:43:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 126. [2020-02-10 20:43:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 20:43:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 336 transitions. [2020-02-10 20:43:00,384 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 336 transitions. Word has length 19 [2020-02-10 20:43:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:00,384 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 336 transitions. [2020-02-10 20:43:00,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 336 transitions. [2020-02-10 20:43:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:00,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:00,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:00,385 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:00,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:00,385 INFO L82 PathProgramCache]: Analyzing trace with hash 283350700, now seen corresponding path program 553 times [2020-02-10 20:43:00,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:00,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369110638] [2020-02-10 20:43:00,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:00,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369110638] [2020-02-10 20:43:00,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:00,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:00,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118650857] [2020-02-10 20:43:00,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:00,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:00,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:00,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:00,578 INFO L87 Difference]: Start difference. First operand 126 states and 336 transitions. Second operand 8 states. [2020-02-10 20:43:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:00,633 INFO L93 Difference]: Finished difference Result 220 states and 486 transitions. [2020-02-10 20:43:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:00,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:00,633 INFO L225 Difference]: With dead ends: 220 [2020-02-10 20:43:00,633 INFO L226 Difference]: Without dead ends: 204 [2020-02-10 20:43:00,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-02-10 20:43:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 129. [2020-02-10 20:43:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-02-10 20:43:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 340 transitions. [2020-02-10 20:43:00,636 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 340 transitions. Word has length 19 [2020-02-10 20:43:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:00,637 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 340 transitions. [2020-02-10 20:43:00,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 340 transitions. [2020-02-10 20:43:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:00,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:00,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:00,637 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:00,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:00,637 INFO L82 PathProgramCache]: Analyzing trace with hash 542408926, now seen corresponding path program 554 times [2020-02-10 20:43:00,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:00,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389395077] [2020-02-10 20:43:00,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:00,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389395077] [2020-02-10 20:43:00,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:00,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:00,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89662740] [2020-02-10 20:43:00,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:00,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:00,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:00,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:00,833 INFO L87 Difference]: Start difference. First operand 129 states and 340 transitions. Second operand 8 states. [2020-02-10 20:43:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:00,893 INFO L93 Difference]: Finished difference Result 214 states and 471 transitions. [2020-02-10 20:43:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:00,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:00,894 INFO L225 Difference]: With dead ends: 214 [2020-02-10 20:43:00,894 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 20:43:00,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 20:43:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 126. [2020-02-10 20:43:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 20:43:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 333 transitions. [2020-02-10 20:43:00,897 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 333 transitions. Word has length 19 [2020-02-10 20:43:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:00,897 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 333 transitions. [2020-02-10 20:43:00,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 333 transitions. [2020-02-10 20:43:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:00,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:00,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:00,898 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:00,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:00,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1317087154, now seen corresponding path program 555 times [2020-02-10 20:43:00,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:00,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172628588] [2020-02-10 20:43:00,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:01,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172628588] [2020-02-10 20:43:01,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:01,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:01,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793099722] [2020-02-10 20:43:01,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:01,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:01,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:01,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:01,099 INFO L87 Difference]: Start difference. First operand 126 states and 333 transitions. Second operand 8 states. [2020-02-10 20:43:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:01,160 INFO L93 Difference]: Finished difference Result 224 states and 495 transitions. [2020-02-10 20:43:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:01,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:01,161 INFO L225 Difference]: With dead ends: 224 [2020-02-10 20:43:01,161 INFO L226 Difference]: Without dead ends: 208 [2020-02-10 20:43:01,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-02-10 20:43:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 131. [2020-02-10 20:43:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-02-10 20:43:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 342 transitions. [2020-02-10 20:43:01,165 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 342 transitions. Word has length 19 [2020-02-10 20:43:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:01,165 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 342 transitions. [2020-02-10 20:43:01,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 342 transitions. [2020-02-10 20:43:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:01,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:01,165 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:01,165 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:01,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:01,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2068149248, now seen corresponding path program 556 times [2020-02-10 20:43:01,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:01,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728731555] [2020-02-10 20:43:01,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:01,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728731555] [2020-02-10 20:43:01,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:01,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:01,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486630035] [2020-02-10 20:43:01,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:01,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:01,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:01,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:01,366 INFO L87 Difference]: Start difference. First operand 131 states and 342 transitions. Second operand 8 states. [2020-02-10 20:43:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:01,446 INFO L93 Difference]: Finished difference Result 220 states and 483 transitions. [2020-02-10 20:43:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:01,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:01,447 INFO L225 Difference]: With dead ends: 220 [2020-02-10 20:43:01,447 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 20:43:01,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 20:43:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2020-02-10 20:43:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 20:43:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 330 transitions. [2020-02-10 20:43:01,450 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 330 transitions. Word has length 19 [2020-02-10 20:43:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:01,450 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 330 transitions. [2020-02-10 20:43:01,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 330 transitions. [2020-02-10 20:43:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:01,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:01,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:01,451 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:01,451 INFO L82 PathProgramCache]: Analyzing trace with hash -916665526, now seen corresponding path program 557 times [2020-02-10 20:43:01,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:01,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777712345] [2020-02-10 20:43:01,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:01,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777712345] [2020-02-10 20:43:01,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:01,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:01,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927123205] [2020-02-10 20:43:01,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:01,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:01,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:01,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:01,651 INFO L87 Difference]: Start difference. First operand 126 states and 330 transitions. Second operand 8 states. [2020-02-10 20:43:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:01,714 INFO L93 Difference]: Finished difference Result 209 states and 459 transitions. [2020-02-10 20:43:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:01,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:01,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:01,715 INFO L225 Difference]: With dead ends: 209 [2020-02-10 20:43:01,716 INFO L226 Difference]: Without dead ends: 199 [2020-02-10 20:43:01,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-02-10 20:43:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 128. [2020-02-10 20:43:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-02-10 20:43:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 333 transitions. [2020-02-10 20:43:01,719 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 333 transitions. Word has length 19 [2020-02-10 20:43:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:01,719 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 333 transitions. [2020-02-10 20:43:01,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 333 transitions. [2020-02-10 20:43:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:01,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:01,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:01,720 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1771972180, now seen corresponding path program 558 times [2020-02-10 20:43:01,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:01,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183104880] [2020-02-10 20:43:01,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:01,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183104880] [2020-02-10 20:43:01,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:01,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:01,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979852824] [2020-02-10 20:43:01,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:01,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:01,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:01,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:01,914 INFO L87 Difference]: Start difference. First operand 128 states and 333 transitions. Second operand 8 states. [2020-02-10 20:43:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:01,999 INFO L93 Difference]: Finished difference Result 211 states and 462 transitions. [2020-02-10 20:43:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:02,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:02,000 INFO L225 Difference]: With dead ends: 211 [2020-02-10 20:43:02,000 INFO L226 Difference]: Without dead ends: 194 [2020-02-10 20:43:02,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-02-10 20:43:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 123. [2020-02-10 20:43:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-02-10 20:43:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 323 transitions. [2020-02-10 20:43:02,004 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 323 transitions. Word has length 19 [2020-02-10 20:43:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:02,004 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 323 transitions. [2020-02-10 20:43:02,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 323 transitions. [2020-02-10 20:43:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:02,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:02,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:02,005 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2085582518, now seen corresponding path program 559 times [2020-02-10 20:43:02,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:02,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236065620] [2020-02-10 20:43:02,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:02,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236065620] [2020-02-10 20:43:02,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:02,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:02,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044805649] [2020-02-10 20:43:02,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:02,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:02,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:02,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:02,192 INFO L87 Difference]: Start difference. First operand 123 states and 323 transitions. Second operand 8 states. [2020-02-10 20:43:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:02,251 INFO L93 Difference]: Finished difference Result 215 states and 468 transitions. [2020-02-10 20:43:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:02,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:02,252 INFO L225 Difference]: With dead ends: 215 [2020-02-10 20:43:02,252 INFO L226 Difference]: Without dead ends: 199 [2020-02-10 20:43:02,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-02-10 20:43:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2020-02-10 20:43:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-02-10 20:43:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 320 transitions. [2020-02-10 20:43:02,256 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 320 transitions. Word has length 19 [2020-02-10 20:43:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:02,256 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 320 transitions. [2020-02-10 20:43:02,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 320 transitions. [2020-02-10 20:43:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:02,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:02,257 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:02,257 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1826524292, now seen corresponding path program 560 times [2020-02-10 20:43:02,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:02,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773807050] [2020-02-10 20:43:02,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:02,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773807050] [2020-02-10 20:43:02,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:02,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:02,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676327786] [2020-02-10 20:43:02,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:02,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:02,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:02,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:02,439 INFO L87 Difference]: Start difference. First operand 123 states and 320 transitions. Second operand 8 states. [2020-02-10 20:43:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:02,501 INFO L93 Difference]: Finished difference Result 209 states and 453 transitions. [2020-02-10 20:43:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:02,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:02,502 INFO L225 Difference]: With dead ends: 209 [2020-02-10 20:43:02,502 INFO L226 Difference]: Without dead ends: 196 [2020-02-10 20:43:02,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:02,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-02-10 20:43:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 120. [2020-02-10 20:43:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-02-10 20:43:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 313 transitions. [2020-02-10 20:43:02,506 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 313 transitions. Word has length 19 [2020-02-10 20:43:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:02,506 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 313 transitions. [2020-02-10 20:43:02,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 313 transitions. [2020-02-10 20:43:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:02,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:02,507 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:02,507 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash -991490930, now seen corresponding path program 561 times [2020-02-10 20:43:02,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:02,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750239847] [2020-02-10 20:43:02,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:02,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750239847] [2020-02-10 20:43:02,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:02,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:02,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69687870] [2020-02-10 20:43:02,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:02,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:02,697 INFO L87 Difference]: Start difference. First operand 120 states and 313 transitions. Second operand 8 states. [2020-02-10 20:43:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:02,757 INFO L93 Difference]: Finished difference Result 213 states and 467 transitions. [2020-02-10 20:43:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:02,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:02,758 INFO L225 Difference]: With dead ends: 213 [2020-02-10 20:43:02,758 INFO L226 Difference]: Without dead ends: 197 [2020-02-10 20:43:02,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-02-10 20:43:02,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 126. [2020-02-10 20:43:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 20:43:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 324 transitions. [2020-02-10 20:43:02,762 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 324 transitions. Word has length 19 [2020-02-10 20:43:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:02,762 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 324 transitions. [2020-02-10 20:43:02,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 324 transitions. [2020-02-10 20:43:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:02,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:02,762 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:02,762 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:02,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:02,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1967695680, now seen corresponding path program 562 times [2020-02-10 20:43:02,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:02,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421647637] [2020-02-10 20:43:02,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:02,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421647637] [2020-02-10 20:43:02,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:02,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:02,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594658488] [2020-02-10 20:43:02,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:02,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:02,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:02,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:02,948 INFO L87 Difference]: Start difference. First operand 126 states and 324 transitions. Second operand 8 states. [2020-02-10 20:43:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:03,028 INFO L93 Difference]: Finished difference Result 201 states and 447 transitions. [2020-02-10 20:43:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:03,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:03,029 INFO L225 Difference]: With dead ends: 201 [2020-02-10 20:43:03,029 INFO L226 Difference]: Without dead ends: 182 [2020-02-10 20:43:03,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:03,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-02-10 20:43:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 120. [2020-02-10 20:43:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-02-10 20:43:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 310 transitions. [2020-02-10 20:43:03,032 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 310 transitions. Word has length 19 [2020-02-10 20:43:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:03,032 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 310 transitions. [2020-02-10 20:43:03,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 310 transitions. [2020-02-10 20:43:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:03,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:03,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:03,033 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:03,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1019871656, now seen corresponding path program 563 times [2020-02-10 20:43:03,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:03,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541196867] [2020-02-10 20:43:03,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:03,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541196867] [2020-02-10 20:43:03,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:03,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:03,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281795458] [2020-02-10 20:43:03,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:03,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:03,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:03,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:03,222 INFO L87 Difference]: Start difference. First operand 120 states and 310 transitions. Second operand 8 states. [2020-02-10 20:43:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:03,284 INFO L93 Difference]: Finished difference Result 203 states and 440 transitions. [2020-02-10 20:43:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:03,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:03,285 INFO L225 Difference]: With dead ends: 203 [2020-02-10 20:43:03,285 INFO L226 Difference]: Without dead ends: 193 [2020-02-10 20:43:03,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-02-10 20:43:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 122. [2020-02-10 20:43:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-02-10 20:43:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 313 transitions. [2020-02-10 20:43:03,288 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 313 transitions. Word has length 19 [2020-02-10 20:43:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:03,288 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 313 transitions. [2020-02-10 20:43:03,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 313 transitions. [2020-02-10 20:43:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:03,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:03,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:03,289 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1785690644, now seen corresponding path program 564 times [2020-02-10 20:43:03,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:03,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258839543] [2020-02-10 20:43:03,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:03,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258839543] [2020-02-10 20:43:03,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:03,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:03,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839026541] [2020-02-10 20:43:03,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:03,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:03,468 INFO L87 Difference]: Start difference. First operand 122 states and 313 transitions. Second operand 8 states. [2020-02-10 20:43:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:03,540 INFO L93 Difference]: Finished difference Result 197 states and 436 transitions. [2020-02-10 20:43:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:03,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:03,541 INFO L225 Difference]: With dead ends: 197 [2020-02-10 20:43:03,542 INFO L226 Difference]: Without dead ends: 179 [2020-02-10 20:43:03,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-02-10 20:43:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2020-02-10 20:43:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-02-10 20:43:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 303 transitions. [2020-02-10 20:43:03,544 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 303 transitions. Word has length 19 [2020-02-10 20:43:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:03,545 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 303 transitions. [2020-02-10 20:43:03,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 303 transitions. [2020-02-10 20:43:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:03,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:03,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:03,545 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:03,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:03,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1759986294, now seen corresponding path program 565 times [2020-02-10 20:43:03,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:03,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779919203] [2020-02-10 20:43:03,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:03,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779919203] [2020-02-10 20:43:03,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:03,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:03,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573520519] [2020-02-10 20:43:03,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:03,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:03,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:03,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:03,741 INFO L87 Difference]: Start difference. First operand 117 states and 303 transitions. Second operand 8 states. [2020-02-10 20:43:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:03,803 INFO L93 Difference]: Finished difference Result 207 states and 450 transitions. [2020-02-10 20:43:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:03,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:03,804 INFO L225 Difference]: With dead ends: 207 [2020-02-10 20:43:03,804 INFO L226 Difference]: Without dead ends: 191 [2020-02-10 20:43:03,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-02-10 20:43:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 117. [2020-02-10 20:43:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-02-10 20:43:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 298 transitions. [2020-02-10 20:43:03,807 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 298 transitions. Word has length 19 [2020-02-10 20:43:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:03,808 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 298 transitions. [2020-02-10 20:43:03,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 298 transitions. [2020-02-10 20:43:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:03,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:03,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:03,808 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1783918908, now seen corresponding path program 566 times [2020-02-10 20:43:03,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:03,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842906348] [2020-02-10 20:43:03,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:04,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842906348] [2020-02-10 20:43:04,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:04,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:04,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345952180] [2020-02-10 20:43:04,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:04,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:04,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:04,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:04,035 INFO L87 Difference]: Start difference. First operand 117 states and 298 transitions. Second operand 8 states. [2020-02-10 20:43:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:04,114 INFO L93 Difference]: Finished difference Result 203 states and 438 transitions. [2020-02-10 20:43:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:04,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:04,115 INFO L225 Difference]: With dead ends: 203 [2020-02-10 20:43:04,115 INFO L226 Difference]: Without dead ends: 186 [2020-02-10 20:43:04,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:04,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-02-10 20:43:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2020-02-10 20:43:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-02-10 20:43:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 284 transitions. [2020-02-10 20:43:04,118 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 284 transitions. Word has length 19 [2020-02-10 20:43:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:04,118 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 284 transitions. [2020-02-10 20:43:04,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 284 transitions. [2020-02-10 20:43:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:04,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:04,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:04,118 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:04,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:04,119 INFO L82 PathProgramCache]: Analyzing trace with hash 934543148, now seen corresponding path program 567 times [2020-02-10 20:43:04,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:04,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325630380] [2020-02-10 20:43:04,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:04,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325630380] [2020-02-10 20:43:04,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:04,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:04,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868935328] [2020-02-10 20:43:04,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:04,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:04,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:04,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:04,316 INFO L87 Difference]: Start difference. First operand 112 states and 284 transitions. Second operand 8 states. [2020-02-10 20:43:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:04,371 INFO L93 Difference]: Finished difference Result 195 states and 418 transitions. [2020-02-10 20:43:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:04,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:04,372 INFO L225 Difference]: With dead ends: 195 [2020-02-10 20:43:04,372 INFO L226 Difference]: Without dead ends: 179 [2020-02-10 20:43:04,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-02-10 20:43:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 104. [2020-02-10 20:43:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-02-10 20:43:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 263 transitions. [2020-02-10 20:43:04,374 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 263 transitions. Word has length 19 [2020-02-10 20:43:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:04,374 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 263 transitions. [2020-02-10 20:43:04,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 263 transitions. [2020-02-10 20:43:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:04,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:04,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:04,375 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -41661602, now seen corresponding path program 568 times [2020-02-10 20:43:04,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:04,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677610718] [2020-02-10 20:43:04,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:04,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677610718] [2020-02-10 20:43:04,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:04,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:04,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006252569] [2020-02-10 20:43:04,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:04,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:04,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:04,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:04,589 INFO L87 Difference]: Start difference. First operand 104 states and 263 transitions. Second operand 8 states. [2020-02-10 20:43:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:04,668 INFO L93 Difference]: Finished difference Result 183 states and 398 transitions. [2020-02-10 20:43:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:04,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:04,669 INFO L225 Difference]: With dead ends: 183 [2020-02-10 20:43:04,670 INFO L226 Difference]: Without dead ends: 164 [2020-02-10 20:43:04,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-02-10 20:43:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 98. [2020-02-10 20:43:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 20:43:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 247 transitions. [2020-02-10 20:43:04,673 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 247 transitions. Word has length 19 [2020-02-10 20:43:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:04,673 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 247 transitions. [2020-02-10 20:43:04,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 247 transitions. [2020-02-10 20:43:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:04,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:04,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:04,674 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1586342730, now seen corresponding path program 569 times [2020-02-10 20:43:04,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:04,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786974510] [2020-02-10 20:43:04,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:04,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786974510] [2020-02-10 20:43:04,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:04,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:04,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506453243] [2020-02-10 20:43:04,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:04,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:04,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:04,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:04,863 INFO L87 Difference]: Start difference. First operand 98 states and 247 transitions. Second operand 8 states. [2020-02-10 20:43:04,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:04,942 INFO L93 Difference]: Finished difference Result 180 states and 392 transitions. [2020-02-10 20:43:04,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:04,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:04,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:04,943 INFO L225 Difference]: With dead ends: 180 [2020-02-10 20:43:04,943 INFO L226 Difference]: Without dead ends: 168 [2020-02-10 20:43:04,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-02-10 20:43:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 102. [2020-02-10 20:43:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-02-10 20:43:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 255 transitions. [2020-02-10 20:43:04,945 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 255 transitions. Word has length 19 [2020-02-10 20:43:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:04,946 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 255 transitions. [2020-02-10 20:43:04,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 255 transitions. [2020-02-10 20:43:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:04,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:04,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:04,946 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:04,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1849750036, now seen corresponding path program 570 times [2020-02-10 20:43:04,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:04,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371966689] [2020-02-10 20:43:04,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:05,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371966689] [2020-02-10 20:43:05,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:05,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:05,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631277430] [2020-02-10 20:43:05,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:05,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:05,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:05,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:05,144 INFO L87 Difference]: Start difference. First operand 102 states and 255 transitions. Second operand 8 states. [2020-02-10 20:43:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:05,233 INFO L93 Difference]: Finished difference Result 167 states and 371 transitions. [2020-02-10 20:43:05,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:05,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:05,234 INFO L225 Difference]: With dead ends: 167 [2020-02-10 20:43:05,234 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:43:05,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:43:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-02-10 20:43:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:43:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 235 transitions. [2020-02-10 20:43:05,237 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 235 transitions. Word has length 19 [2020-02-10 20:43:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:05,237 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 235 transitions. [2020-02-10 20:43:05,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 235 transitions. [2020-02-10 20:43:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:05,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:05,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:05,238 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:05,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:05,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1422262942, now seen corresponding path program 571 times [2020-02-10 20:43:05,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:05,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572059008] [2020-02-10 20:43:05,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:05,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572059008] [2020-02-10 20:43:05,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:05,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:05,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624073582] [2020-02-10 20:43:05,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:05,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:05,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:05,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:05,440 INFO L87 Difference]: Start difference. First operand 93 states and 235 transitions. Second operand 8 states. [2020-02-10 20:43:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:05,511 INFO L93 Difference]: Finished difference Result 172 states and 373 transitions. [2020-02-10 20:43:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:05,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:05,512 INFO L225 Difference]: With dead ends: 172 [2020-02-10 20:43:05,512 INFO L226 Difference]: Without dead ends: 162 [2020-02-10 20:43:05,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-02-10 20:43:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 97. [2020-02-10 20:43:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:43:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 245 transitions. [2020-02-10 20:43:05,516 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 245 transitions. Word has length 19 [2020-02-10 20:43:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:05,516 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 245 transitions. [2020-02-10 20:43:05,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 245 transitions. [2020-02-10 20:43:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:05,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:05,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:05,516 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:05,516 INFO L82 PathProgramCache]: Analyzing trace with hash 566956288, now seen corresponding path program 572 times [2020-02-10 20:43:05,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:05,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379454013] [2020-02-10 20:43:05,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:05,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379454013] [2020-02-10 20:43:05,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:05,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:05,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903003874] [2020-02-10 20:43:05,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:05,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:05,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:05,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:05,734 INFO L87 Difference]: Start difference. First operand 97 states and 245 transitions. Second operand 8 states. [2020-02-10 20:43:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:05,823 INFO L93 Difference]: Finished difference Result 174 states and 376 transitions. [2020-02-10 20:43:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:05,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:05,824 INFO L225 Difference]: With dead ends: 174 [2020-02-10 20:43:05,824 INFO L226 Difference]: Without dead ends: 160 [2020-02-10 20:43:05,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-02-10 20:43:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 95. [2020-02-10 20:43:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:43:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 240 transitions. [2020-02-10 20:43:05,828 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 240 transitions. Word has length 19 [2020-02-10 20:43:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:05,828 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 240 transitions. [2020-02-10 20:43:05,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 240 transitions. [2020-02-10 20:43:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:05,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:05,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:05,829 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:05,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:05,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763396, now seen corresponding path program 573 times [2020-02-10 20:43:05,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:05,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447349099] [2020-02-10 20:43:05,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:06,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447349099] [2020-02-10 20:43:06,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:06,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:06,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734098320] [2020-02-10 20:43:06,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:06,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:06,028 INFO L87 Difference]: Start difference. First operand 95 states and 240 transitions. Second operand 8 states. [2020-02-10 20:43:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:06,098 INFO L93 Difference]: Finished difference Result 168 states and 363 transitions. [2020-02-10 20:43:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:06,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:06,099 INFO L225 Difference]: With dead ends: 168 [2020-02-10 20:43:06,100 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 20:43:06,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 20:43:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 97. [2020-02-10 20:43:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:43:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 243 transitions. [2020-02-10 20:43:06,102 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 243 transitions. Word has length 19 [2020-02-10 20:43:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:06,103 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 243 transitions. [2020-02-10 20:43:06,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 243 transitions. [2020-02-10 20:43:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:06,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:06,103 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:06,103 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:06,103 INFO L82 PathProgramCache]: Analyzing trace with hash 227641600, now seen corresponding path program 574 times [2020-02-10 20:43:06,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:06,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742056671] [2020-02-10 20:43:06,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:06,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742056671] [2020-02-10 20:43:06,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:06,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:06,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766386640] [2020-02-10 20:43:06,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:06,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:06,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:06,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:06,290 INFO L87 Difference]: Start difference. First operand 97 states and 243 transitions. Second operand 8 states. [2020-02-10 20:43:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:06,376 INFO L93 Difference]: Finished difference Result 162 states and 359 transitions. [2020-02-10 20:43:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:06,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:06,377 INFO L225 Difference]: With dead ends: 162 [2020-02-10 20:43:06,377 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:43:06,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:43:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 95. [2020-02-10 20:43:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:43:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-02-10 20:43:06,380 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 19 [2020-02-10 20:43:06,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:06,380 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-02-10 20:43:06,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-02-10 20:43:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:06,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:06,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:06,380 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash -506129092, now seen corresponding path program 575 times [2020-02-10 20:43:06,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:06,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329777689] [2020-02-10 20:43:06,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:06,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329777689] [2020-02-10 20:43:06,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:06,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:06,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099552719] [2020-02-10 20:43:06,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:06,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:06,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:06,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:06,576 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 8 states. [2020-02-10 20:43:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:06,663 INFO L93 Difference]: Finished difference Result 155 states and 344 transitions. [2020-02-10 20:43:06,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:06,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:06,664 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:43:06,664 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 20:43:06,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:06,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 20:43:06,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 99. [2020-02-10 20:43:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 20:43:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 246 transitions. [2020-02-10 20:43:06,667 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 246 transitions. Word has length 19 [2020-02-10 20:43:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:06,667 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 246 transitions. [2020-02-10 20:43:06,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 246 transitions. [2020-02-10 20:43:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:06,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:06,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:06,668 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763396, now seen corresponding path program 576 times [2020-02-10 20:43:06,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:06,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128872476] [2020-02-10 20:43:06,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:06,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128872476] [2020-02-10 20:43:06,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:06,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:06,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438210874] [2020-02-10 20:43:06,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:06,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:06,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:06,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:06,857 INFO L87 Difference]: Start difference. First operand 99 states and 246 transitions. Second operand 8 states. [2020-02-10 20:43:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:06,936 INFO L93 Difference]: Finished difference Result 142 states and 323 transitions. [2020-02-10 20:43:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:06,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:06,937 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:43:06,938 INFO L226 Difference]: Without dead ends: 120 [2020-02-10 20:43:06,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-02-10 20:43:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2020-02-10 20:43:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 229 transitions. [2020-02-10 20:43:06,940 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 229 transitions. Word has length 19 [2020-02-10 20:43:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:06,940 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 229 transitions. [2020-02-10 20:43:06,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 229 transitions. [2020-02-10 20:43:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:06,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:06,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:06,941 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:06,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:06,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1776969654, now seen corresponding path program 577 times [2020-02-10 20:43:06,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:06,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82867839] [2020-02-10 20:43:06,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:07,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82867839] [2020-02-10 20:43:07,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:07,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:07,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449012458] [2020-02-10 20:43:07,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:07,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:07,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:07,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:07,153 INFO L87 Difference]: Start difference. First operand 90 states and 229 transitions. Second operand 8 states. [2020-02-10 20:43:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:07,240 INFO L93 Difference]: Finished difference Result 165 states and 357 transitions. [2020-02-10 20:43:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:07,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:07,241 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:43:07,241 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 20:43:07,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 20:43:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 93. [2020-02-10 20:43:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:43:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 237 transitions. [2020-02-10 20:43:07,244 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 237 transitions. Word has length 19 [2020-02-10 20:43:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:07,244 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 237 transitions. [2020-02-10 20:43:07,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 237 transitions. [2020-02-10 20:43:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:07,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:07,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:07,244 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:07,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2016611992, now seen corresponding path program 578 times [2020-02-10 20:43:07,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:07,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775221105] [2020-02-10 20:43:07,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:07,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775221105] [2020-02-10 20:43:07,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:07,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:07,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987809540] [2020-02-10 20:43:07,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:07,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:07,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:07,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:07,460 INFO L87 Difference]: Start difference. First operand 93 states and 237 transitions. Second operand 8 states. [2020-02-10 20:43:07,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:07,528 INFO L93 Difference]: Finished difference Result 165 states and 356 transitions. [2020-02-10 20:43:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:07,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:07,529 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:43:07,529 INFO L226 Difference]: Without dead ends: 154 [2020-02-10 20:43:07,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-02-10 20:43:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 92. [2020-02-10 20:43:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:43:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 235 transitions. [2020-02-10 20:43:07,532 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 235 transitions. Word has length 19 [2020-02-10 20:43:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:07,532 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 235 transitions. [2020-02-10 20:43:07,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 235 transitions. [2020-02-10 20:43:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:07,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:07,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:07,533 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1773295144, now seen corresponding path program 579 times [2020-02-10 20:43:07,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:07,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978466822] [2020-02-10 20:43:07,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:07,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978466822] [2020-02-10 20:43:07,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:07,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:07,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858489988] [2020-02-10 20:43:07,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:07,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:07,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:07,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:07,736 INFO L87 Difference]: Start difference. First operand 92 states and 235 transitions. Second operand 8 states. [2020-02-10 20:43:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:07,820 INFO L93 Difference]: Finished difference Result 168 states and 364 transitions. [2020-02-10 20:43:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:07,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:07,820 INFO L225 Difference]: With dead ends: 168 [2020-02-10 20:43:07,821 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 20:43:07,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 20:43:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2020-02-10 20:43:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:43:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 238 transitions. [2020-02-10 20:43:07,823 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 238 transitions. Word has length 19 [2020-02-10 20:43:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:07,824 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 238 transitions. [2020-02-10 20:43:07,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 238 transitions. [2020-02-10 20:43:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:07,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:07,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:07,824 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:07,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash -811058844, now seen corresponding path program 580 times [2020-02-10 20:43:07,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:07,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155582310] [2020-02-10 20:43:07,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:08,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155582310] [2020-02-10 20:43:08,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:08,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:08,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698343438] [2020-02-10 20:43:08,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:08,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:08,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:08,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:08,029 INFO L87 Difference]: Start difference. First operand 94 states and 238 transitions. Second operand 8 states. [2020-02-10 20:43:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:08,120 INFO L93 Difference]: Finished difference Result 170 states and 367 transitions. [2020-02-10 20:43:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:08,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:08,121 INFO L225 Difference]: With dead ends: 170 [2020-02-10 20:43:08,121 INFO L226 Difference]: Without dead ends: 156 [2020-02-10 20:43:08,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-02-10 20:43:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 92. [2020-02-10 20:43:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:43:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-02-10 20:43:08,123 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-02-10 20:43:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:08,124 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-02-10 20:43:08,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-02-10 20:43:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:08,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:08,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:08,124 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1205269924, now seen corresponding path program 581 times [2020-02-10 20:43:08,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:08,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554941388] [2020-02-10 20:43:08,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:08,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554941388] [2020-02-10 20:43:08,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:08,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:08,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751640350] [2020-02-10 20:43:08,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:08,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:08,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:08,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:08,331 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-02-10 20:43:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:08,396 INFO L93 Difference]: Finished difference Result 168 states and 363 transitions. [2020-02-10 20:43:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:08,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:08,397 INFO L225 Difference]: With dead ends: 168 [2020-02-10 20:43:08,397 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 20:43:08,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 20:43:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2020-02-10 20:43:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:43:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-02-10 20:43:08,400 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-02-10 20:43:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:08,400 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-02-10 20:43:08,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-02-10 20:43:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:08,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:08,401 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:08,401 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash 349963270, now seen corresponding path program 582 times [2020-02-10 20:43:08,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:08,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490668842] [2020-02-10 20:43:08,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:08,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490668842] [2020-02-10 20:43:08,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:08,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:08,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614971536] [2020-02-10 20:43:08,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:08,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:08,606 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-02-10 20:43:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:08,686 INFO L93 Difference]: Finished difference Result 170 states and 366 transitions. [2020-02-10 20:43:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:08,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:08,687 INFO L225 Difference]: With dead ends: 170 [2020-02-10 20:43:08,687 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 20:43:08,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 20:43:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 91. [2020-02-10 20:43:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:43:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 232 transitions. [2020-02-10 20:43:08,690 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 232 transitions. Word has length 19 [2020-02-10 20:43:08,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:08,690 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 232 transitions. [2020-02-10 20:43:08,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 232 transitions. [2020-02-10 20:43:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:08,691 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:08,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:08,691 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash 917559788, now seen corresponding path program 583 times [2020-02-10 20:43:08,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:08,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090703399] [2020-02-10 20:43:08,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:08,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090703399] [2020-02-10 20:43:08,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:08,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:08,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289700728] [2020-02-10 20:43:08,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:08,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:08,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:08,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:08,923 INFO L87 Difference]: Start difference. First operand 91 states and 232 transitions. Second operand 8 states. [2020-02-10 20:43:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:09,011 INFO L93 Difference]: Finished difference Result 163 states and 351 transitions. [2020-02-10 20:43:09,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:09,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:09,012 INFO L225 Difference]: With dead ends: 163 [2020-02-10 20:43:09,012 INFO L226 Difference]: Without dead ends: 153 [2020-02-10 20:43:09,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-02-10 20:43:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 93. [2020-02-10 20:43:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:43:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 236 transitions. [2020-02-10 20:43:09,015 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 236 transitions. Word has length 19 [2020-02-10 20:43:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:09,015 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 236 transitions. [2020-02-10 20:43:09,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 236 transitions. [2020-02-10 20:43:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:09,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:09,016 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:09,016 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:09,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:09,016 INFO L82 PathProgramCache]: Analyzing trace with hash 677917450, now seen corresponding path program 584 times [2020-02-10 20:43:09,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:09,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281168582] [2020-02-10 20:43:09,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:09,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281168582] [2020-02-10 20:43:09,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:09,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:09,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998525514] [2020-02-10 20:43:09,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:09,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:09,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:09,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:09,227 INFO L87 Difference]: Start difference. First operand 93 states and 236 transitions. Second operand 8 states. [2020-02-10 20:43:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:09,297 INFO L93 Difference]: Finished difference Result 163 states and 350 transitions. [2020-02-10 20:43:09,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:09,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:09,298 INFO L225 Difference]: With dead ends: 163 [2020-02-10 20:43:09,298 INFO L226 Difference]: Without dead ends: 152 [2020-02-10 20:43:09,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-02-10 20:43:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2020-02-10 20:43:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:43:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-02-10 20:43:09,301 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-02-10 20:43:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:09,301 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-02-10 20:43:09,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-02-10 20:43:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:09,301 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:09,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:09,302 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash -155525592, now seen corresponding path program 585 times [2020-02-10 20:43:09,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:09,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195494634] [2020-02-10 20:43:09,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:09,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195494634] [2020-02-10 20:43:09,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:09,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:09,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906242217] [2020-02-10 20:43:09,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:09,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:09,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:09,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:09,496 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-02-10 20:43:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:09,585 INFO L93 Difference]: Finished difference Result 165 states and 357 transitions. [2020-02-10 20:43:09,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:09,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:09,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:09,586 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:43:09,586 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 20:43:09,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 20:43:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2020-02-10 20:43:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:43:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-02-10 20:43:09,589 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-02-10 20:43:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:09,590 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-02-10 20:43:09,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-02-10 20:43:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:09,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:09,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:09,590 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash 799453412, now seen corresponding path program 586 times [2020-02-10 20:43:09,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:09,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372648310] [2020-02-10 20:43:09,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:09,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372648310] [2020-02-10 20:43:09,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:09,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:09,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954671895] [2020-02-10 20:43:09,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:09,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:09,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:09,788 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-02-10 20:43:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:09,872 INFO L93 Difference]: Finished difference Result 159 states and 353 transitions. [2020-02-10 20:43:09,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:09,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:09,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:09,873 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:43:09,873 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 20:43:09,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 20:43:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2020-02-10 20:43:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:43:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 233 transitions. [2020-02-10 20:43:09,876 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 233 transitions. Word has length 19 [2020-02-10 20:43:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:09,876 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 233 transitions. [2020-02-10 20:43:09,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 233 transitions. [2020-02-10 20:43:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:09,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:09,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:09,877 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:09,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:09,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1215773028, now seen corresponding path program 587 times [2020-02-10 20:43:09,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:09,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119038156] [2020-02-10 20:43:09,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:10,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119038156] [2020-02-10 20:43:10,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:10,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:10,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913962889] [2020-02-10 20:43:10,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:10,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:10,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:10,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:10,075 INFO L87 Difference]: Start difference. First operand 92 states and 233 transitions. Second operand 8 states. [2020-02-10 20:43:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:10,144 INFO L93 Difference]: Finished difference Result 165 states and 356 transitions. [2020-02-10 20:43:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:10,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:10,145 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:43:10,145 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 20:43:10,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 20:43:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2020-02-10 20:43:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:43:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2020-02-10 20:43:10,147 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 19 [2020-02-10 20:43:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:10,147 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2020-02-10 20:43:10,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2020-02-10 20:43:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:10,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:10,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:10,148 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:10,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1589789272, now seen corresponding path program 588 times [2020-02-10 20:43:10,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:10,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520315594] [2020-02-10 20:43:10,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:10,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520315594] [2020-02-10 20:43:10,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:10,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:10,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527220479] [2020-02-10 20:43:10,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:10,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:10,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:10,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:10,346 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand 8 states. [2020-02-10 20:43:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:10,424 INFO L93 Difference]: Finished difference Result 159 states and 352 transitions. [2020-02-10 20:43:10,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:10,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:10,425 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:43:10,425 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 20:43:10,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 20:43:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 91. [2020-02-10 20:43:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:43:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-02-10 20:43:10,428 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 19 [2020-02-10 20:43:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:10,428 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-02-10 20:43:10,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-02-10 20:43:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:10,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:10,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:10,429 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1427580564, now seen corresponding path program 589 times [2020-02-10 20:43:10,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:10,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246708092] [2020-02-10 20:43:10,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:10,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246708092] [2020-02-10 20:43:10,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:10,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:10,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886932343] [2020-02-10 20:43:10,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:10,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:10,628 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 8 states. [2020-02-10 20:43:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:10,716 INFO L93 Difference]: Finished difference Result 161 states and 347 transitions. [2020-02-10 20:43:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:10,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:10,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:10,717 INFO L225 Difference]: With dead ends: 161 [2020-02-10 20:43:10,717 INFO L226 Difference]: Without dead ends: 151 [2020-02-10 20:43:10,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-02-10 20:43:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 95. [2020-02-10 20:43:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:43:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 241 transitions. [2020-02-10 20:43:10,719 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 241 transitions. Word has length 19 [2020-02-10 20:43:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:10,719 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 241 transitions. [2020-02-10 20:43:10,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 241 transitions. [2020-02-10 20:43:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:10,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:10,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:10,720 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash 283032744, now seen corresponding path program 590 times [2020-02-10 20:43:10,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:10,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951599282] [2020-02-10 20:43:10,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:10,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951599282] [2020-02-10 20:43:10,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:10,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:10,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998268931] [2020-02-10 20:43:10,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:10,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:10,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:10,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:10,918 INFO L87 Difference]: Start difference. First operand 95 states and 241 transitions. Second operand 8 states. [2020-02-10 20:43:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:11,005 INFO L93 Difference]: Finished difference Result 163 states and 350 transitions. [2020-02-10 20:43:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:11,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:11,006 INFO L225 Difference]: With dead ends: 163 [2020-02-10 20:43:11,006 INFO L226 Difference]: Without dead ends: 149 [2020-02-10 20:43:11,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-02-10 20:43:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2020-02-10 20:43:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:43:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 236 transitions. [2020-02-10 20:43:11,009 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 236 transitions. Word has length 19 [2020-02-10 20:43:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:11,010 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 236 transitions. [2020-02-10 20:43:11,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 236 transitions. [2020-02-10 20:43:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:11,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:11,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:11,010 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash 917559788, now seen corresponding path program 591 times [2020-02-10 20:43:11,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:11,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513063477] [2020-02-10 20:43:11,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:11,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513063477] [2020-02-10 20:43:11,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:11,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:11,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660079110] [2020-02-10 20:43:11,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:11,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:11,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:11,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:11,207 INFO L87 Difference]: Start difference. First operand 93 states and 236 transitions. Second operand 8 states. [2020-02-10 20:43:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:11,298 INFO L93 Difference]: Finished difference Result 158 states and 339 transitions. [2020-02-10 20:43:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:11,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:11,299 INFO L225 Difference]: With dead ends: 158 [2020-02-10 20:43:11,299 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 20:43:11,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 20:43:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2020-02-10 20:43:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:43:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 239 transitions. [2020-02-10 20:43:11,302 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 239 transitions. Word has length 19 [2020-02-10 20:43:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:11,302 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 239 transitions. [2020-02-10 20:43:11,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 239 transitions. [2020-02-10 20:43:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:11,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:11,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:11,302 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash -811487546, now seen corresponding path program 592 times [2020-02-10 20:43:11,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:11,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92387827] [2020-02-10 20:43:11,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:11,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92387827] [2020-02-10 20:43:11,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:11,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:11,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622879782] [2020-02-10 20:43:11,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:11,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:11,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:11,500 INFO L87 Difference]: Start difference. First operand 95 states and 239 transitions. Second operand 8 states. [2020-02-10 20:43:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:11,588 INFO L93 Difference]: Finished difference Result 152 states and 335 transitions. [2020-02-10 20:43:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:11,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:11,589 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:43:11,589 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:43:11,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:43:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2020-02-10 20:43:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:43:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 234 transitions. [2020-02-10 20:43:11,592 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 234 transitions. Word has length 19 [2020-02-10 20:43:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:11,592 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 234 transitions. [2020-02-10 20:43:11,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 234 transitions. [2020-02-10 20:43:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:11,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:11,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:11,592 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:11,593 INFO L82 PathProgramCache]: Analyzing trace with hash -177389204, now seen corresponding path program 593 times [2020-02-10 20:43:11,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:11,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540711359] [2020-02-10 20:43:11,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:11,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540711359] [2020-02-10 20:43:11,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:11,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:11,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953488226] [2020-02-10 20:43:11,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:11,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:11,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:11,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:11,794 INFO L87 Difference]: Start difference. First operand 93 states and 234 transitions. Second operand 8 states. [2020-02-10 20:43:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:11,871 INFO L93 Difference]: Finished difference Result 153 states and 340 transitions. [2020-02-10 20:43:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:11,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:11,872 INFO L225 Difference]: With dead ends: 153 [2020-02-10 20:43:11,872 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:43:11,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:43:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 97. [2020-02-10 20:43:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:43:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 242 transitions. [2020-02-10 20:43:11,875 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 242 transitions. Word has length 19 [2020-02-10 20:43:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:11,875 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 242 transitions. [2020-02-10 20:43:11,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 242 transitions. [2020-02-10 20:43:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:11,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:11,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:11,876 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:11,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:11,876 INFO L82 PathProgramCache]: Analyzing trace with hash 677917450, now seen corresponding path program 594 times [2020-02-10 20:43:11,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:11,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145877296] [2020-02-10 20:43:11,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:12,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145877296] [2020-02-10 20:43:12,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:12,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:12,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529421845] [2020-02-10 20:43:12,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:12,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:12,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:12,094 INFO L87 Difference]: Start difference. First operand 97 states and 242 transitions. Second operand 8 states. [2020-02-10 20:43:12,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:12,185 INFO L93 Difference]: Finished difference Result 140 states and 319 transitions. [2020-02-10 20:43:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:12,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:12,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:12,185 INFO L225 Difference]: With dead ends: 140 [2020-02-10 20:43:12,185 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 20:43:12,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 20:43:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2020-02-10 20:43:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:43:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 230 transitions. [2020-02-10 20:43:12,188 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 230 transitions. Word has length 19 [2020-02-10 20:43:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:12,188 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 230 transitions. [2020-02-10 20:43:12,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 230 transitions. [2020-02-10 20:43:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:12,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:12,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:12,189 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:12,189 INFO L82 PathProgramCache]: Analyzing trace with hash 698923658, now seen corresponding path program 595 times [2020-02-10 20:43:12,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:12,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279856649] [2020-02-10 20:43:12,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:12,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279856649] [2020-02-10 20:43:12,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:12,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:12,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757544752] [2020-02-10 20:43:12,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:12,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:12,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:12,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:12,396 INFO L87 Difference]: Start difference. First operand 91 states and 230 transitions. Second operand 8 states. [2020-02-10 20:43:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:12,448 INFO L93 Difference]: Finished difference Result 140 states and 309 transitions. [2020-02-10 20:43:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:12,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:12,449 INFO L225 Difference]: With dead ends: 140 [2020-02-10 20:43:12,449 INFO L226 Difference]: Without dead ends: 130 [2020-02-10 20:43:12,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-02-10 20:43:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2020-02-10 20:43:12,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:43:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 240 transitions. [2020-02-10 20:43:12,453 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 240 transitions. Word has length 19 [2020-02-10 20:43:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:12,453 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 240 transitions. [2020-02-10 20:43:12,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 240 transitions. [2020-02-10 20:43:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:12,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:12,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:12,454 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash -156382996, now seen corresponding path program 596 times [2020-02-10 20:43:12,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:12,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598024070] [2020-02-10 20:43:12,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:12,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598024070] [2020-02-10 20:43:12,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:12,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:12,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731731467] [2020-02-10 20:43:12,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:12,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:12,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:12,654 INFO L87 Difference]: Start difference. First operand 95 states and 240 transitions. Second operand 8 states. [2020-02-10 20:43:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:12,740 INFO L93 Difference]: Finished difference Result 142 states and 312 transitions. [2020-02-10 20:43:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:12,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:12,740 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:43:12,741 INFO L226 Difference]: Without dead ends: 128 [2020-02-10 20:43:12,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-02-10 20:43:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2020-02-10 20:43:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:43:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 235 transitions. [2020-02-10 20:43:12,743 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 235 transitions. Word has length 19 [2020-02-10 20:43:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:12,744 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 235 transitions. [2020-02-10 20:43:12,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 235 transitions. [2020-02-10 20:43:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:12,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:12,744 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:12,744 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:12,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1985102680, now seen corresponding path program 597 times [2020-02-10 20:43:12,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:12,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255554855] [2020-02-10 20:43:12,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:12,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255554855] [2020-02-10 20:43:12,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:12,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:12,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879831467] [2020-02-10 20:43:12,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:12,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:12,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:12,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:12,953 INFO L87 Difference]: Start difference. First operand 93 states and 235 transitions. Second operand 8 states. [2020-02-10 20:43:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:13,020 INFO L93 Difference]: Finished difference Result 136 states and 299 transitions. [2020-02-10 20:43:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:13,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:13,020 INFO L225 Difference]: With dead ends: 136 [2020-02-10 20:43:13,021 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 20:43:13,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 20:43:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2020-02-10 20:43:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:43:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-02-10 20:43:13,023 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 19 [2020-02-10 20:43:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:13,024 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-02-10 20:43:13,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-02-10 20:43:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:13,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:13,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:13,024 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:13,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:13,024 INFO L82 PathProgramCache]: Analyzing trace with hash -495697684, now seen corresponding path program 598 times [2020-02-10 20:43:13,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:13,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981281152] [2020-02-10 20:43:13,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:13,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981281152] [2020-02-10 20:43:13,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:13,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:13,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913097144] [2020-02-10 20:43:13,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:13,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:13,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:13,225 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 8 states. [2020-02-10 20:43:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:13,308 INFO L93 Difference]: Finished difference Result 130 states and 295 transitions. [2020-02-10 20:43:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:13,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:13,309 INFO L225 Difference]: With dead ends: 130 [2020-02-10 20:43:13,309 INFO L226 Difference]: Without dead ends: 115 [2020-02-10 20:43:13,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-02-10 20:43:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 93. [2020-02-10 20:43:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:43:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 233 transitions. [2020-02-10 20:43:13,311 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 233 transitions. Word has length 19 [2020-02-10 20:43:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:13,312 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 233 transitions. [2020-02-10 20:43:13,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 233 transitions. [2020-02-10 20:43:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:13,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:13,312 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:13,312 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:13,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1229468376, now seen corresponding path program 599 times [2020-02-10 20:43:13,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:13,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383501323] [2020-02-10 20:43:13,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:13,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383501323] [2020-02-10 20:43:13,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:13,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:13,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057544461] [2020-02-10 20:43:13,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:13,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:13,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:13,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:13,511 INFO L87 Difference]: Start difference. First operand 93 states and 233 transitions. Second operand 8 states. [2020-02-10 20:43:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:13,590 INFO L93 Difference]: Finished difference Result 123 states and 280 transitions. [2020-02-10 20:43:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:13,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:13,591 INFO L225 Difference]: With dead ends: 123 [2020-02-10 20:43:13,591 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:43:13,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:43:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2020-02-10 20:43:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:43:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 241 transitions. [2020-02-10 20:43:13,594 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 241 transitions. Word has length 19 [2020-02-10 20:43:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:13,594 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 241 transitions. [2020-02-10 20:43:13,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 241 transitions. [2020-02-10 20:43:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:13,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:13,595 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:13,595 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1985102680, now seen corresponding path program 600 times [2020-02-10 20:43:13,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:13,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566436032] [2020-02-10 20:43:13,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:13,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566436032] [2020-02-10 20:43:13,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:13,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:13,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685412802] [2020-02-10 20:43:13,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:13,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:13,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:13,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:13,795 INFO L87 Difference]: Start difference. First operand 97 states and 241 transitions. Second operand 8 states. [2020-02-10 20:43:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:13,873 INFO L93 Difference]: Finished difference Result 110 states and 259 transitions. [2020-02-10 20:43:13,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:13,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:13,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:13,874 INFO L225 Difference]: With dead ends: 110 [2020-02-10 20:43:13,874 INFO L226 Difference]: Without dead ends: 88 [2020-02-10 20:43:13,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-02-10 20:43:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-02-10 20:43:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 225 transitions. [2020-02-10 20:43:13,877 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 225 transitions. Word has length 19 [2020-02-10 20:43:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:13,877 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 225 transitions. [2020-02-10 20:43:13,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 225 transitions. [2020-02-10 20:43:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:13,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:13,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:13,878 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:13,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1155542588, now seen corresponding path program 601 times [2020-02-10 20:43:13,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:13,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427918875] [2020-02-10 20:43:13,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:14,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427918875] [2020-02-10 20:43:14,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:14,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:14,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591621819] [2020-02-10 20:43:14,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:14,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:14,064 INFO L87 Difference]: Start difference. First operand 88 states and 225 transitions. Second operand 8 states. [2020-02-10 20:43:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:14,144 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-02-10 20:43:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:14,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:14,144 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:43:14,145 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:43:14,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:14,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:43:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2020-02-10 20:43:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:43:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-02-10 20:43:14,147 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 19 [2020-02-10 20:43:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:14,147 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-02-10 20:43:14,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-02-10 20:43:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:14,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:14,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:14,148 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash 281207262, now seen corresponding path program 602 times [2020-02-10 20:43:14,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:14,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529081779] [2020-02-10 20:43:14,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:14,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529081779] [2020-02-10 20:43:14,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:14,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:14,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198268496] [2020-02-10 20:43:14,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:14,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:14,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:14,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:14,338 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 8 states. [2020-02-10 20:43:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:14,416 INFO L93 Difference]: Finished difference Result 151 states and 314 transitions. [2020-02-10 20:43:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:14,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:14,417 INFO L225 Difference]: With dead ends: 151 [2020-02-10 20:43:14,417 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:43:14,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:14,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:43:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 20:43:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:43:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 227 transitions. [2020-02-10 20:43:14,420 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 227 transitions. Word has length 19 [2020-02-10 20:43:14,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:14,420 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 227 transitions. [2020-02-10 20:43:14,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 227 transitions. [2020-02-10 20:43:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:14,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:14,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:14,421 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:14,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:14,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1978402594, now seen corresponding path program 603 times [2020-02-10 20:43:14,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:14,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477666215] [2020-02-10 20:43:14,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:14,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477666215] [2020-02-10 20:43:14,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:14,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:14,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027122401] [2020-02-10 20:43:14,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:14,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:14,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:14,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:14,606 INFO L87 Difference]: Start difference. First operand 89 states and 227 transitions. Second operand 8 states. [2020-02-10 20:43:14,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:14,683 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-02-10 20:43:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:14,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:14,684 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:43:14,684 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:43:14,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:43:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2020-02-10 20:43:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:43:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 230 transitions. [2020-02-10 20:43:14,686 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 230 transitions. Word has length 19 [2020-02-10 20:43:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:14,687 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 230 transitions. [2020-02-10 20:43:14,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 230 transitions. [2020-02-10 20:43:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:14,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:14,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:14,688 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:14,688 INFO L82 PathProgramCache]: Analyzing trace with hash -858272764, now seen corresponding path program 604 times [2020-02-10 20:43:14,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:14,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010930465] [2020-02-10 20:43:14,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:14,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010930465] [2020-02-10 20:43:14,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:14,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:14,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668043336] [2020-02-10 20:43:14,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:14,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:14,882 INFO L87 Difference]: Start difference. First operand 91 states and 230 transitions. Second operand 8 states. [2020-02-10 20:43:14,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:14,941 INFO L93 Difference]: Finished difference Result 151 states and 313 transitions. [2020-02-10 20:43:14,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:14,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:14,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:14,942 INFO L225 Difference]: With dead ends: 151 [2020-02-10 20:43:14,942 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:43:14,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:43:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 20:43:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:43:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 226 transitions. [2020-02-10 20:43:14,945 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 226 transitions. Word has length 19 [2020-02-10 20:43:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:14,945 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 226 transitions. [2020-02-10 20:43:14,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 226 transitions. [2020-02-10 20:43:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:14,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:14,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:14,946 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash -80774848, now seen corresponding path program 605 times [2020-02-10 20:43:14,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:14,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383875142] [2020-02-10 20:43:14,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:15,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383875142] [2020-02-10 20:43:15,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:15,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:15,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837211775] [2020-02-10 20:43:15,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:15,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:15,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:15,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:15,141 INFO L87 Difference]: Start difference. First operand 89 states and 226 transitions. Second operand 8 states. [2020-02-10 20:43:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:15,217 INFO L93 Difference]: Finished difference Result 146 states and 302 transitions. [2020-02-10 20:43:15,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:15,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:15,218 INFO L225 Difference]: With dead ends: 146 [2020-02-10 20:43:15,218 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 20:43:15,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 20:43:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 90. [2020-02-10 20:43:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 227 transitions. [2020-02-10 20:43:15,221 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 227 transitions. Word has length 19 [2020-02-10 20:43:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:15,221 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 227 transitions. [2020-02-10 20:43:15,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 227 transitions. [2020-02-10 20:43:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:15,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:15,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:15,222 INFO L427 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:15,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash -320417186, now seen corresponding path program 606 times [2020-02-10 20:43:15,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:15,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390728125] [2020-02-10 20:43:15,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:15,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390728125] [2020-02-10 20:43:15,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:15,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:15,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725420228] [2020-02-10 20:43:15,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:15,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:15,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:15,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:15,423 INFO L87 Difference]: Start difference. First operand 90 states and 227 transitions. Second operand 8 states. [2020-02-10 20:43:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:15,485 INFO L93 Difference]: Finished difference Result 146 states and 301 transitions. [2020-02-10 20:43:15,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:15,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:15,486 INFO L225 Difference]: With dead ends: 146 [2020-02-10 20:43:15,486 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:43:15,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:43:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2020-02-10 20:43:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 224 transitions. [2020-02-10 20:43:15,489 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 224 transitions. Word has length 19 [2020-02-10 20:43:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:15,489 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 224 transitions. [2020-02-10 20:43:15,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 224 transitions. [2020-02-10 20:43:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:15,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:15,490 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:15,490 INFO L427 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash -455398370, now seen corresponding path program 607 times [2020-02-10 20:43:15,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:15,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166257606] [2020-02-10 20:43:15,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:15,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166257606] [2020-02-10 20:43:15,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:15,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:15,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104822360] [2020-02-10 20:43:15,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:15,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:15,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:15,661 INFO L87 Difference]: Start difference. First operand 88 states and 224 transitions. Second operand 8 states. [2020-02-10 20:43:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:15,737 INFO L93 Difference]: Finished difference Result 161 states and 343 transitions. [2020-02-10 20:43:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:15,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:15,738 INFO L225 Difference]: With dead ends: 161 [2020-02-10 20:43:15,738 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:43:15,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:43:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2020-02-10 20:43:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:43:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-02-10 20:43:15,740 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-02-10 20:43:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:15,740 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-02-10 20:43:15,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-02-10 20:43:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:15,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:15,741 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:15,741 INFO L427 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:15,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:15,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1329733696, now seen corresponding path program 608 times [2020-02-10 20:43:15,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:15,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972302073] [2020-02-10 20:43:15,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:15,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972302073] [2020-02-10 20:43:15,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:15,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:15,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772356561] [2020-02-10 20:43:15,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:15,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:15,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:15,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:15,911 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-02-10 20:43:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:15,988 INFO L93 Difference]: Finished difference Result 157 states and 332 transitions. [2020-02-10 20:43:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:15,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:15,989 INFO L225 Difference]: With dead ends: 157 [2020-02-10 20:43:15,989 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:43:15,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:43:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 20:43:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 229 transitions. [2020-02-10 20:43:15,992 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 229 transitions. Word has length 19 [2020-02-10 20:43:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:15,992 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 229 transitions. [2020-02-10 20:43:15,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 229 transitions. [2020-02-10 20:43:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:15,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:15,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:15,993 INFO L427 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:15,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:15,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1034006626, now seen corresponding path program 609 times [2020-02-10 20:43:15,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:15,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276601666] [2020-02-10 20:43:15,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:16,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276601666] [2020-02-10 20:43:16,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:16,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:16,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438261366] [2020-02-10 20:43:16,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:16,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:16,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:16,181 INFO L87 Difference]: Start difference. First operand 90 states and 229 transitions. Second operand 8 states. [2020-02-10 20:43:16,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:16,257 INFO L93 Difference]: Finished difference Result 165 states and 353 transitions. [2020-02-10 20:43:16,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:16,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:16,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:16,257 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:43:16,257 INFO L226 Difference]: Without dead ends: 151 [2020-02-10 20:43:16,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-02-10 20:43:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2020-02-10 20:43:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:43:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-02-10 20:43:16,260 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-02-10 20:43:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:16,261 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-02-10 20:43:16,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-02-10 20:43:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:16,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:16,261 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:16,261 INFO L427 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash 288709482, now seen corresponding path program 610 times [2020-02-10 20:43:16,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:16,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658215458] [2020-02-10 20:43:16,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:16,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658215458] [2020-02-10 20:43:16,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:16,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:16,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905799542] [2020-02-10 20:43:16,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:16,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:16,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:16,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:16,437 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-02-10 20:43:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:16,516 INFO L93 Difference]: Finished difference Result 163 states and 345 transitions. [2020-02-10 20:43:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:16,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:16,517 INFO L225 Difference]: With dead ends: 163 [2020-02-10 20:43:16,517 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:43:16,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:43:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2020-02-10 20:43:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 227 transitions. [2020-02-10 20:43:16,519 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 227 transitions. Word has length 19 [2020-02-10 20:43:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:16,519 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 227 transitions. [2020-02-10 20:43:16,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 227 transitions. [2020-02-10 20:43:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:16,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:16,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:16,520 INFO L427 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:16,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:16,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1901188502, now seen corresponding path program 611 times [2020-02-10 20:43:16,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:16,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599222192] [2020-02-10 20:43:16,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:16,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599222192] [2020-02-10 20:43:16,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:16,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:16,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686591518] [2020-02-10 20:43:16,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:16,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:16,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:16,695 INFO L87 Difference]: Start difference. First operand 90 states and 227 transitions. Second operand 8 states. [2020-02-10 20:43:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:16,771 INFO L93 Difference]: Finished difference Result 155 states and 326 transitions. [2020-02-10 20:43:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:16,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:16,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:16,772 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:43:16,772 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:43:16,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:43:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-02-10 20:43:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:43:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 230 transitions. [2020-02-10 20:43:16,774 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 230 transitions. Word has length 19 [2020-02-10 20:43:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:16,774 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 230 transitions. [2020-02-10 20:43:16,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 230 transitions. [2020-02-10 20:43:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:16,775 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:16,775 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:16,775 INFO L427 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:16,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:16,776 INFO L82 PathProgramCache]: Analyzing trace with hash -190575194, now seen corresponding path program 612 times [2020-02-10 20:43:16,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:16,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713515252] [2020-02-10 20:43:16,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:16,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713515252] [2020-02-10 20:43:16,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:16,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:16,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448086113] [2020-02-10 20:43:16,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:16,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:16,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:16,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:16,951 INFO L87 Difference]: Start difference. First operand 92 states and 230 transitions. Second operand 8 states. [2020-02-10 20:43:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:17,031 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-02-10 20:43:17,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:17,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:17,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:17,031 INFO L225 Difference]: With dead ends: 157 [2020-02-10 20:43:17,032 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:43:17,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:43:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2020-02-10 20:43:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 223 transitions. [2020-02-10 20:43:17,034 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 223 transitions. Word has length 19 [2020-02-10 20:43:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:17,034 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 223 transitions. [2020-02-10 20:43:17,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 223 transitions. [2020-02-10 20:43:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:17,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:17,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:17,035 INFO L427 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash -884311006, now seen corresponding path program 613 times [2020-02-10 20:43:17,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:17,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762006571] [2020-02-10 20:43:17,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:17,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762006571] [2020-02-10 20:43:17,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:17,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:17,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734748945] [2020-02-10 20:43:17,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:17,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:17,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:17,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:17,204 INFO L87 Difference]: Start difference. First operand 88 states and 223 transitions. Second operand 8 states. [2020-02-10 20:43:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:17,279 INFO L93 Difference]: Finished difference Result 161 states and 342 transitions. [2020-02-10 20:43:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:17,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:17,280 INFO L225 Difference]: With dead ends: 161 [2020-02-10 20:43:17,280 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:43:17,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:43:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2020-02-10 20:43:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:43:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 233 transitions. [2020-02-10 20:43:17,283 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 233 transitions. Word has length 19 [2020-02-10 20:43:17,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:17,283 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 233 transitions. [2020-02-10 20:43:17,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 233 transitions. [2020-02-10 20:43:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:17,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:17,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:17,284 INFO L427 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash 235818824, now seen corresponding path program 614 times [2020-02-10 20:43:17,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:17,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883977308] [2020-02-10 20:43:17,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:17,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883977308] [2020-02-10 20:43:17,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:17,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:17,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077804088] [2020-02-10 20:43:17,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:17,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:17,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:17,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:17,462 INFO L87 Difference]: Start difference. First operand 92 states and 233 transitions. Second operand 8 states. [2020-02-10 20:43:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:17,520 INFO L93 Difference]: Finished difference Result 157 states and 331 transitions. [2020-02-10 20:43:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:17,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:17,521 INFO L225 Difference]: With dead ends: 157 [2020-02-10 20:43:17,521 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:43:17,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:43:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 20:43:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 228 transitions. [2020-02-10 20:43:17,524 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 228 transitions. Word has length 19 [2020-02-10 20:43:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:17,524 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 228 transitions. [2020-02-10 20:43:17,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 228 transitions. [2020-02-10 20:43:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:17,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:17,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:17,524 INFO L427 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1629013504, now seen corresponding path program 615 times [2020-02-10 20:43:17,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:17,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277294396] [2020-02-10 20:43:17,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:17,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277294396] [2020-02-10 20:43:17,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:17,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:17,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419075074] [2020-02-10 20:43:17,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:17,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:17,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:17,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:17,711 INFO L87 Difference]: Start difference. First operand 90 states and 228 transitions. Second operand 8 states. [2020-02-10 20:43:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:17,779 INFO L93 Difference]: Finished difference Result 165 states and 352 transitions. [2020-02-10 20:43:17,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:17,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:17,780 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:43:17,780 INFO L226 Difference]: Without dead ends: 151 [2020-02-10 20:43:17,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-02-10 20:43:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2020-02-10 20:43:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:43:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2020-02-10 20:43:17,783 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 19 [2020-02-10 20:43:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:17,783 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2020-02-10 20:43:17,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2020-02-10 20:43:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:17,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:17,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:17,784 INFO L427 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:17,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1920656648, now seen corresponding path program 616 times [2020-02-10 20:43:17,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:17,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880025197] [2020-02-10 20:43:17,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:17,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880025197] [2020-02-10 20:43:17,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:17,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:17,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455657109] [2020-02-10 20:43:17,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:17,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:17,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:17,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:17,954 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand 8 states. [2020-02-10 20:43:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:18,035 INFO L93 Difference]: Finished difference Result 163 states and 344 transitions. [2020-02-10 20:43:18,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:18,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:18,036 INFO L225 Difference]: With dead ends: 163 [2020-02-10 20:43:18,036 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:43:18,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:43:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2020-02-10 20:43:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-02-10 20:43:18,039 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-02-10 20:43:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:18,039 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-02-10 20:43:18,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-02-10 20:43:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:18,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:18,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:18,040 INFO L427 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash -299410978, now seen corresponding path program 617 times [2020-02-10 20:43:18,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:18,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526305429] [2020-02-10 20:43:18,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:18,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526305429] [2020-02-10 20:43:18,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:18,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:18,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811065090] [2020-02-10 20:43:18,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:18,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:18,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:18,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:18,222 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-02-10 20:43:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:18,281 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-02-10 20:43:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:18,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:18,282 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:43:18,282 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:43:18,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:43:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-02-10 20:43:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:43:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 229 transitions. [2020-02-10 20:43:18,285 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 229 transitions. Word has length 19 [2020-02-10 20:43:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:18,285 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 229 transitions. [2020-02-10 20:43:18,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 229 transitions. [2020-02-10 20:43:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:18,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:18,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:18,286 INFO L427 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:18,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1154717632, now seen corresponding path program 618 times [2020-02-10 20:43:18,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:18,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080484803] [2020-02-10 20:43:18,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:18,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080484803] [2020-02-10 20:43:18,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:18,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:18,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164966896] [2020-02-10 20:43:18,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:18,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:18,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:18,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:18,465 INFO L87 Difference]: Start difference. First operand 92 states and 229 transitions. Second operand 8 states. [2020-02-10 20:43:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:18,543 INFO L93 Difference]: Finished difference Result 157 states and 328 transitions. [2020-02-10 20:43:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:18,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:18,544 INFO L225 Difference]: With dead ends: 157 [2020-02-10 20:43:18,544 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:43:18,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:43:18,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2020-02-10 20:43:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 222 transitions. [2020-02-10 20:43:18,547 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 222 transitions. Word has length 19 [2020-02-10 20:43:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:18,548 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 222 transitions. [2020-02-10 20:43:18,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 222 transitions. [2020-02-10 20:43:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:18,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:18,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:18,548 INFO L427 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash 506970474, now seen corresponding path program 619 times [2020-02-10 20:43:18,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:18,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028131996] [2020-02-10 20:43:18,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:18,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028131996] [2020-02-10 20:43:18,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:18,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:18,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011422915] [2020-02-10 20:43:18,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:18,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:18,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:18,747 INFO L87 Difference]: Start difference. First operand 88 states and 222 transitions. Second operand 8 states. [2020-02-10 20:43:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:18,813 INFO L93 Difference]: Finished difference Result 144 states and 297 transitions. [2020-02-10 20:43:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:18,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:18,814 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:43:18,814 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:43:18,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:43:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 90. [2020-02-10 20:43:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-02-10 20:43:18,817 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-02-10 20:43:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:18,817 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-02-10 20:43:18,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:18,818 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-02-10 20:43:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:18,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:18,818 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:18,818 INFO L427 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:18,819 INFO L82 PathProgramCache]: Analyzing trace with hash 267328136, now seen corresponding path program 620 times [2020-02-10 20:43:18,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:18,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694406754] [2020-02-10 20:43:18,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:19,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694406754] [2020-02-10 20:43:19,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:19,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:19,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220188581] [2020-02-10 20:43:19,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:19,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:19,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:19,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:19,023 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-02-10 20:43:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:19,079 INFO L93 Difference]: Finished difference Result 144 states and 296 transitions. [2020-02-10 20:43:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:19,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:19,080 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:43:19,080 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 20:43:19,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 20:43:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 89. [2020-02-10 20:43:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:43:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 224 transitions. [2020-02-10 20:43:19,083 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 224 transitions. Word has length 19 [2020-02-10 20:43:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:19,083 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 224 transitions. [2020-02-10 20:43:19,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 224 transitions. [2020-02-10 20:43:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:19,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:19,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:19,084 INFO L427 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:19,085 INFO L82 PathProgramCache]: Analyzing trace with hash -237732024, now seen corresponding path program 621 times [2020-02-10 20:43:19,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:19,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028664492] [2020-02-10 20:43:19,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:19,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028664492] [2020-02-10 20:43:19,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:19,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:19,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484768177] [2020-02-10 20:43:19,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:19,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:19,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:19,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:19,281 INFO L87 Difference]: Start difference. First operand 89 states and 224 transitions. Second operand 8 states. [2020-02-10 20:43:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:19,353 INFO L93 Difference]: Finished difference Result 147 states and 304 transitions. [2020-02-10 20:43:19,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:19,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:19,354 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:43:19,355 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:43:19,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:43:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-02-10 20:43:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:43:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 227 transitions. [2020-02-10 20:43:19,357 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 227 transitions. Word has length 19 [2020-02-10 20:43:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:19,358 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 227 transitions. [2020-02-10 20:43:19,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 227 transitions. [2020-02-10 20:43:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:19,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:19,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:19,358 INFO L427 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:19,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1472881284, now seen corresponding path program 622 times [2020-02-10 20:43:19,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:19,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124579028] [2020-02-10 20:43:19,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:19,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124579028] [2020-02-10 20:43:19,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:19,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:19,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837709267] [2020-02-10 20:43:19,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:19,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:19,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:19,551 INFO L87 Difference]: Start difference. First operand 91 states and 227 transitions. Second operand 8 states. [2020-02-10 20:43:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:19,629 INFO L93 Difference]: Finished difference Result 149 states and 307 transitions. [2020-02-10 20:43:19,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:19,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:19,630 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:43:19,630 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 20:43:19,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 20:43:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 89. [2020-02-10 20:43:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:43:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2020-02-10 20:43:19,633 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 19 [2020-02-10 20:43:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:19,633 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-02-10 20:43:19,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2020-02-10 20:43:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:19,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:19,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:19,634 INFO L427 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:19,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:19,634 INFO L82 PathProgramCache]: Analyzing trace with hash -805757244, now seen corresponding path program 623 times [2020-02-10 20:43:19,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:19,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131556851] [2020-02-10 20:43:19,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:19,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131556851] [2020-02-10 20:43:19,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:19,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:19,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898432043] [2020-02-10 20:43:19,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:19,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:19,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:19,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:19,834 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand 8 states. [2020-02-10 20:43:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:19,890 INFO L93 Difference]: Finished difference Result 147 states and 303 transitions. [2020-02-10 20:43:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:19,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:19,891 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:43:19,891 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:43:19,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:43:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-02-10 20:43:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:43:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 226 transitions. [2020-02-10 20:43:19,894 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 226 transitions. Word has length 19 [2020-02-10 20:43:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:19,894 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 226 transitions. [2020-02-10 20:43:19,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 226 transitions. [2020-02-10 20:43:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:19,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:19,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:19,894 INFO L427 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1661063898, now seen corresponding path program 624 times [2020-02-10 20:43:19,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:19,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533246541] [2020-02-10 20:43:19,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:20,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533246541] [2020-02-10 20:43:20,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:20,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:20,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197787463] [2020-02-10 20:43:20,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:20,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:20,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:20,091 INFO L87 Difference]: Start difference. First operand 91 states and 226 transitions. Second operand 8 states. [2020-02-10 20:43:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:20,165 INFO L93 Difference]: Finished difference Result 149 states and 306 transitions. [2020-02-10 20:43:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:20,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:20,166 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:43:20,167 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 20:43:20,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:20,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 20:43:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 87. [2020-02-10 20:43:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:43:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 220 transitions. [2020-02-10 20:43:20,169 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 220 transitions. Word has length 19 [2020-02-10 20:43:20,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:20,170 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 220 transitions. [2020-02-10 20:43:20,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:20,170 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 220 transitions. [2020-02-10 20:43:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:20,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:20,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:20,170 INFO L427 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:20,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:20,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1213390630, now seen corresponding path program 625 times [2020-02-10 20:43:20,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:20,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607275657] [2020-02-10 20:43:20,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:20,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607275657] [2020-02-10 20:43:20,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:20,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:20,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638800662] [2020-02-10 20:43:20,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:20,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:20,350 INFO L87 Difference]: Start difference. First operand 87 states and 220 transitions. Second operand 8 states. [2020-02-10 20:43:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:20,429 INFO L93 Difference]: Finished difference Result 153 states and 317 transitions. [2020-02-10 20:43:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:20,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:20,430 INFO L225 Difference]: With dead ends: 153 [2020-02-10 20:43:20,430 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:43:20,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:43:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 20:43:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:43:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2020-02-10 20:43:20,432 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 19 [2020-02-10 20:43:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:20,433 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-02-10 20:43:20,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2020-02-10 20:43:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:20,433 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:20,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:20,433 INFO L427 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:20,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725956, now seen corresponding path program 626 times [2020-02-10 20:43:20,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:20,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077802190] [2020-02-10 20:43:20,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:20,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077802190] [2020-02-10 20:43:20,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:20,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:20,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052249029] [2020-02-10 20:43:20,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:20,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:20,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:20,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:20,609 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand 8 states. [2020-02-10 20:43:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:20,688 INFO L93 Difference]: Finished difference Result 149 states and 306 transitions. [2020-02-10 20:43:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:20,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:20,689 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:43:20,689 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:43:20,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:43:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 87. [2020-02-10 20:43:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:43:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 219 transitions. [2020-02-10 20:43:20,692 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 219 transitions. Word has length 19 [2020-02-10 20:43:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:20,692 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 219 transitions. [2020-02-10 20:43:20,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 219 transitions. [2020-02-10 20:43:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:20,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:20,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:20,692 INFO L427 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:20,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:20,693 INFO L82 PathProgramCache]: Analyzing trace with hash -52368516, now seen corresponding path program 627 times [2020-02-10 20:43:20,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:20,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631243088] [2020-02-10 20:43:20,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:20,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631243088] [2020-02-10 20:43:20,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:20,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:20,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524220766] [2020-02-10 20:43:20,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:20,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:20,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:20,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:20,874 INFO L87 Difference]: Start difference. First operand 87 states and 219 transitions. Second operand 8 states. [2020-02-10 20:43:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:20,944 INFO L93 Difference]: Finished difference Result 153 states and 316 transitions. [2020-02-10 20:43:20,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:20,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:20,945 INFO L225 Difference]: With dead ends: 153 [2020-02-10 20:43:20,945 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:43:20,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:43:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 20:43:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:43:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 222 transitions. [2020-02-10 20:43:20,948 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 222 transitions. Word has length 19 [2020-02-10 20:43:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:20,948 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 222 transitions. [2020-02-10 20:43:20,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 222 transitions. [2020-02-10 20:43:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:20,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:20,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:20,949 INFO L427 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:20,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:20,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1067761314, now seen corresponding path program 628 times [2020-02-10 20:43:20,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:20,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40294417] [2020-02-10 20:43:20,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:21,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40294417] [2020-02-10 20:43:21,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:21,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:21,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176051867] [2020-02-10 20:43:21,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:21,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:21,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:21,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:21,132 INFO L87 Difference]: Start difference. First operand 89 states and 222 transitions. Second operand 8 states. [2020-02-10 20:43:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:21,193 INFO L93 Difference]: Finished difference Result 149 states and 305 transitions. [2020-02-10 20:43:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:21,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:21,194 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:43:21,194 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:43:21,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:43:21,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 87. [2020-02-10 20:43:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:43:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 218 transitions. [2020-02-10 20:43:21,197 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 218 transitions. Word has length 19 [2020-02-10 20:43:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:21,197 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 218 transitions. [2020-02-10 20:43:21,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 218 transitions. [2020-02-10 20:43:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:21,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:21,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:21,198 INFO L427 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:21,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:21,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1845259230, now seen corresponding path program 629 times [2020-02-10 20:43:21,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:21,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633312032] [2020-02-10 20:43:21,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:21,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633312032] [2020-02-10 20:43:21,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:21,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:21,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428487952] [2020-02-10 20:43:21,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:21,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:21,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:21,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:21,393 INFO L87 Difference]: Start difference. First operand 87 states and 218 transitions. Second operand 8 states. [2020-02-10 20:43:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:21,472 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2020-02-10 20:43:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:21,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:21,472 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:43:21,472 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:43:21,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:21,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:43:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2020-02-10 20:43:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 219 transitions. [2020-02-10 20:43:21,475 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 219 transitions. Word has length 19 [2020-02-10 20:43:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:21,475 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 219 transitions. [2020-02-10 20:43:21,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 219 transitions. [2020-02-10 20:43:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:21,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:21,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:21,475 INFO L427 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1605616892, now seen corresponding path program 630 times [2020-02-10 20:43:21,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:21,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35352295] [2020-02-10 20:43:21,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:21,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35352295] [2020-02-10 20:43:21,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:21,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:21,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476302236] [2020-02-10 20:43:21,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:21,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:21,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:21,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:21,673 INFO L87 Difference]: Start difference. First operand 88 states and 219 transitions. Second operand 8 states. [2020-02-10 20:43:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:21,733 INFO L93 Difference]: Finished difference Result 144 states and 293 transitions. [2020-02-10 20:43:21,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:21,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:21,734 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:43:21,734 INFO L226 Difference]: Without dead ends: 132 [2020-02-10 20:43:21,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-02-10 20:43:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 86. [2020-02-10 20:43:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:43:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 216 transitions. [2020-02-10 20:43:21,737 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 216 transitions. Word has length 19 [2020-02-10 20:43:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:21,737 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 216 transitions. [2020-02-10 20:43:21,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 216 transitions. [2020-02-10 20:43:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:21,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:21,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:21,737 INFO L427 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash -119299042, now seen corresponding path program 631 times [2020-02-10 20:43:21,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:21,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695239704] [2020-02-10 20:43:21,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:21,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695239704] [2020-02-10 20:43:21,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:21,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:21,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61658597] [2020-02-10 20:43:21,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:21,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:21,906 INFO L87 Difference]: Start difference. First operand 86 states and 216 transitions. Second operand 8 states. [2020-02-10 20:43:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:21,985 INFO L93 Difference]: Finished difference Result 159 states and 335 transitions. [2020-02-10 20:43:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:21,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:21,986 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:43:21,986 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:43:21,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:43:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 20:43:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-02-10 20:43:21,988 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-02-10 20:43:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:21,988 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-02-10 20:43:21,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-02-10 20:43:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:21,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:21,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:21,989 INFO L427 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:21,989 INFO L82 PathProgramCache]: Analyzing trace with hash -993634368, now seen corresponding path program 632 times [2020-02-10 20:43:21,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:21,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586171783] [2020-02-10 20:43:21,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:22,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586171783] [2020-02-10 20:43:22,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:22,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:22,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019465043] [2020-02-10 20:43:22,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:22,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:22,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:22,161 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-02-10 20:43:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:22,233 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-02-10 20:43:22,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:22,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:22,234 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:43:22,234 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 20:43:22,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 20:43:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2020-02-10 20:43:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 221 transitions. [2020-02-10 20:43:22,237 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 221 transitions. Word has length 19 [2020-02-10 20:43:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:22,237 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 221 transitions. [2020-02-10 20:43:22,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 221 transitions. [2020-02-10 20:43:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:22,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:22,238 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:22,238 INFO L427 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:22,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:22,238 INFO L82 PathProgramCache]: Analyzing trace with hash -579720990, now seen corresponding path program 633 times [2020-02-10 20:43:22,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:22,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081931867] [2020-02-10 20:43:22,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:22,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081931867] [2020-02-10 20:43:22,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:22,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:22,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935259668] [2020-02-10 20:43:22,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:22,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:22,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:22,415 INFO L87 Difference]: Start difference. First operand 88 states and 221 transitions. Second operand 8 states. [2020-02-10 20:43:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:22,495 INFO L93 Difference]: Finished difference Result 159 states and 338 transitions. [2020-02-10 20:43:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:22,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:22,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:22,495 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:43:22,496 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:43:22,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:43:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-02-10 20:43:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:43:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 231 transitions. [2020-02-10 20:43:22,498 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 231 transitions. Word has length 19 [2020-02-10 20:43:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:22,498 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 231 transitions. [2020-02-10 20:43:22,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 231 transitions. [2020-02-10 20:43:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:22,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:22,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:22,499 INFO L427 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash 389163050, now seen corresponding path program 634 times [2020-02-10 20:43:22,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:22,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124231255] [2020-02-10 20:43:22,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:22,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124231255] [2020-02-10 20:43:22,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:22,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:22,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067991531] [2020-02-10 20:43:22,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:22,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:22,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:22,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:22,695 INFO L87 Difference]: Start difference. First operand 93 states and 231 transitions. Second operand 8 states. [2020-02-10 20:43:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:22,780 INFO L93 Difference]: Finished difference Result 149 states and 322 transitions. [2020-02-10 20:43:22,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:22,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:22,781 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:43:22,781 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 20:43:22,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 20:43:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-02-10 20:43:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 219 transitions. [2020-02-10 20:43:22,784 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 219 transitions. Word has length 19 [2020-02-10 20:43:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:22,784 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 219 transitions. [2020-02-10 20:43:22,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 219 transitions. [2020-02-10 20:43:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:22,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:22,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:22,785 INFO L427 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:22,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:22,785 INFO L82 PathProgramCache]: Analyzing trace with hash 780051178, now seen corresponding path program 635 times [2020-02-10 20:43:22,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:22,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973386346] [2020-02-10 20:43:22,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:22,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973386346] [2020-02-10 20:43:22,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:22,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:22,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124362218] [2020-02-10 20:43:22,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:22,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:22,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:22,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:22,970 INFO L87 Difference]: Start difference. First operand 88 states and 219 transitions. Second operand 8 states. [2020-02-10 20:43:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:23,047 INFO L93 Difference]: Finished difference Result 152 states and 317 transitions. [2020-02-10 20:43:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:23,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:23,048 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:43:23,048 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 20:43:23,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:23,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 20:43:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2020-02-10 20:43:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 222 transitions. [2020-02-10 20:43:23,050 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 222 transitions. Word has length 19 [2020-02-10 20:43:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:23,050 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 222 transitions. [2020-02-10 20:43:23,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 222 transitions. [2020-02-10 20:43:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:23,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:23,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:23,051 INFO L427 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash -948996156, now seen corresponding path program 636 times [2020-02-10 20:43:23,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:23,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533459552] [2020-02-10 20:43:23,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:23,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533459552] [2020-02-10 20:43:23,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:23,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:23,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416170335] [2020-02-10 20:43:23,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:23,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:23,231 INFO L87 Difference]: Start difference. First operand 90 states and 222 transitions. Second operand 8 states. [2020-02-10 20:43:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:23,314 INFO L93 Difference]: Finished difference Result 146 states and 313 transitions. [2020-02-10 20:43:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:23,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:23,315 INFO L225 Difference]: With dead ends: 146 [2020-02-10 20:43:23,315 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 20:43:23,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 20:43:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-02-10 20:43:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:43:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 215 transitions. [2020-02-10 20:43:23,319 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 215 transitions. Word has length 19 [2020-02-10 20:43:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:23,319 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 215 transitions. [2020-02-10 20:43:23,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 215 transitions. [2020-02-10 20:43:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:23,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:23,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:23,320 INFO L427 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:23,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:23,320 INFO L82 PathProgramCache]: Analyzing trace with hash -558714782, now seen corresponding path program 637 times [2020-02-10 20:43:23,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:23,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098973543] [2020-02-10 20:43:23,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:23,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098973543] [2020-02-10 20:43:23,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:23,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:23,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567369595] [2020-02-10 20:43:23,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:23,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:23,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:23,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:23,504 INFO L87 Difference]: Start difference. First operand 86 states and 215 transitions. Second operand 8 states. [2020-02-10 20:43:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:23,578 INFO L93 Difference]: Finished difference Result 159 states and 334 transitions. [2020-02-10 20:43:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:23,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:23,578 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:43:23,579 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:43:23,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:43:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 20:43:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 225 transitions. [2020-02-10 20:43:23,582 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 225 transitions. Word has length 19 [2020-02-10 20:43:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:23,582 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 225 transitions. [2020-02-10 20:43:23,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 225 transitions. [2020-02-10 20:43:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:23,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:23,582 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:23,582 INFO L427 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash 561415048, now seen corresponding path program 638 times [2020-02-10 20:43:23,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:23,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24406500] [2020-02-10 20:43:23,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:23,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24406500] [2020-02-10 20:43:23,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:23,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:23,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680445874] [2020-02-10 20:43:23,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:23,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:23,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:23,768 INFO L87 Difference]: Start difference. First operand 90 states and 225 transitions. Second operand 8 states. [2020-02-10 20:43:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:23,821 INFO L93 Difference]: Finished difference Result 155 states and 323 transitions. [2020-02-10 20:43:23,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:23,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:23,822 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:43:23,822 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 20:43:23,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 20:43:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2020-02-10 20:43:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 220 transitions. [2020-02-10 20:43:23,824 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 220 transitions. Word has length 19 [2020-02-10 20:43:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:23,825 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 220 transitions. [2020-02-10 20:43:23,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 220 transitions. [2020-02-10 20:43:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:23,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:23,825 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:23,825 INFO L427 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:23,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1631800162, now seen corresponding path program 639 times [2020-02-10 20:43:23,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:23,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637918185] [2020-02-10 20:43:23,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:24,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637918185] [2020-02-10 20:43:24,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:24,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:24,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334439511] [2020-02-10 20:43:24,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:24,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:24,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:24,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:24,012 INFO L87 Difference]: Start difference. First operand 88 states and 220 transitions. Second operand 8 states. [2020-02-10 20:43:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:24,089 INFO L93 Difference]: Finished difference Result 159 states and 337 transitions. [2020-02-10 20:43:24,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:24,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:24,090 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:43:24,091 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:43:24,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:24,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:43:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-02-10 20:43:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:43:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 230 transitions. [2020-02-10 20:43:24,093 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 230 transitions. Word has length 19 [2020-02-10 20:43:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:24,094 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 230 transitions. [2020-02-10 20:43:24,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 230 transitions. [2020-02-10 20:43:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:24,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:24,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:24,094 INFO L427 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2021110216, now seen corresponding path program 640 times [2020-02-10 20:43:24,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:24,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580420023] [2020-02-10 20:43:24,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:24,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580420023] [2020-02-10 20:43:24,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:24,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:24,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728215583] [2020-02-10 20:43:24,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:24,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:24,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:24,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:24,287 INFO L87 Difference]: Start difference. First operand 93 states and 230 transitions. Second operand 8 states. [2020-02-10 20:43:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:24,366 INFO L93 Difference]: Finished difference Result 149 states and 321 transitions. [2020-02-10 20:43:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:24,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:24,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:24,367 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:43:24,367 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 20:43:24,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 20:43:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-02-10 20:43:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2020-02-10 20:43:24,370 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 19 [2020-02-10 20:43:24,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:24,370 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2020-02-10 20:43:24,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2020-02-10 20:43:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:24,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:24,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:24,371 INFO L427 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:24,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1637126204, now seen corresponding path program 641 times [2020-02-10 20:43:24,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:24,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147037124] [2020-02-10 20:43:24,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:24,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147037124] [2020-02-10 20:43:24,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:24,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:24,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520973849] [2020-02-10 20:43:24,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:24,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:24,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:24,560 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand 8 states. [2020-02-10 20:43:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:24,620 INFO L93 Difference]: Finished difference Result 152 states and 316 transitions. [2020-02-10 20:43:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:24,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:24,621 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:43:24,621 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 20:43:24,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 20:43:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2020-02-10 20:43:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:43:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 221 transitions. [2020-02-10 20:43:24,624 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 221 transitions. Word has length 19 [2020-02-10 20:43:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:24,624 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 221 transitions. [2020-02-10 20:43:24,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 221 transitions. [2020-02-10 20:43:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:24,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:24,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:24,625 INFO L427 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:24,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:24,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1168436096, now seen corresponding path program 642 times [2020-02-10 20:43:24,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:24,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995884832] [2020-02-10 20:43:24,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:24,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995884832] [2020-02-10 20:43:24,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:24,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:24,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103037956] [2020-02-10 20:43:24,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:24,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:24,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:24,809 INFO L87 Difference]: Start difference. First operand 90 states and 221 transitions. Second operand 8 states. [2020-02-10 20:43:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:24,890 INFO L93 Difference]: Finished difference Result 146 states and 312 transitions. [2020-02-10 20:43:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:24,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:24,891 INFO L225 Difference]: With dead ends: 146 [2020-02-10 20:43:24,891 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 20:43:24,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 20:43:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-02-10 20:43:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:43:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 214 transitions. [2020-02-10 20:43:24,894 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 214 transitions. Word has length 19 [2020-02-10 20:43:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:24,894 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 214 transitions. [2020-02-10 20:43:24,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 214 transitions. [2020-02-10 20:43:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:24,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:24,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:24,895 INFO L427 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:24,895 INFO L82 PathProgramCache]: Analyzing trace with hash 832566698, now seen corresponding path program 643 times [2020-02-10 20:43:24,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:24,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023281488] [2020-02-10 20:43:24,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:25,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023281488] [2020-02-10 20:43:25,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:25,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:25,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935195827] [2020-02-10 20:43:25,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:25,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:25,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:25,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:25,094 INFO L87 Difference]: Start difference. First operand 86 states and 214 transitions. Second operand 8 states. [2020-02-10 20:43:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:25,169 INFO L93 Difference]: Finished difference Result 142 states and 289 transitions. [2020-02-10 20:43:25,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:25,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:25,170 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:43:25,170 INFO L226 Difference]: Without dead ends: 132 [2020-02-10 20:43:25,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-02-10 20:43:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2020-02-10 20:43:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2020-02-10 20:43:25,173 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 19 [2020-02-10 20:43:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:25,173 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2020-02-10 20:43:25,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2020-02-10 20:43:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:25,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:25,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:25,173 INFO L427 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:25,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash 592924360, now seen corresponding path program 644 times [2020-02-10 20:43:25,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:25,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785153699] [2020-02-10 20:43:25,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:25,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785153699] [2020-02-10 20:43:25,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:25,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:25,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090494467] [2020-02-10 20:43:25,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:25,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:25,372 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand 8 states. [2020-02-10 20:43:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:25,419 INFO L93 Difference]: Finished difference Result 142 states and 288 transitions. [2020-02-10 20:43:25,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:25,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:25,420 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:43:25,420 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 20:43:25,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 20:43:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 87. [2020-02-10 20:43:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:43:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 216 transitions. [2020-02-10 20:43:25,423 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 216 transitions. Word has length 19 [2020-02-10 20:43:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:25,423 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 216 transitions. [2020-02-10 20:43:25,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 216 transitions. [2020-02-10 20:43:25,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:25,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:25,423 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:25,424 INFO L427 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:25,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:25,424 INFO L82 PathProgramCache]: Analyzing trace with hash -240518682, now seen corresponding path program 645 times [2020-02-10 20:43:25,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:25,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633597186] [2020-02-10 20:43:25,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:25,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633597186] [2020-02-10 20:43:25,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:25,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:25,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210834140] [2020-02-10 20:43:25,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:25,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:25,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:25,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:25,613 INFO L87 Difference]: Start difference. First operand 87 states and 216 transitions. Second operand 8 states. [2020-02-10 20:43:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:25,678 INFO L93 Difference]: Finished difference Result 144 states and 295 transitions. [2020-02-10 20:43:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:25,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:25,679 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:43:25,679 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:43:25,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:43:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2020-02-10 20:43:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:43:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 219 transitions. [2020-02-10 20:43:25,682 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 219 transitions. Word has length 19 [2020-02-10 20:43:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:25,682 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 219 transitions. [2020-02-10 20:43:25,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 219 transitions. [2020-02-10 20:43:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:25,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:25,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:25,683 INFO L427 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash 714460322, now seen corresponding path program 646 times [2020-02-10 20:43:25,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:25,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244199671] [2020-02-10 20:43:25,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:25,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244199671] [2020-02-10 20:43:25,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:25,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:25,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672898188] [2020-02-10 20:43:25,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:25,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:25,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:25,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:25,864 INFO L87 Difference]: Start difference. First operand 89 states and 219 transitions. Second operand 8 states. [2020-02-10 20:43:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:25,932 INFO L93 Difference]: Finished difference Result 138 states and 291 transitions. [2020-02-10 20:43:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:25,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:25,933 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:43:25,933 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 20:43:25,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 20:43:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2020-02-10 20:43:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:43:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2020-02-10 20:43:25,936 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 19 [2020-02-10 20:43:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:25,936 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2020-02-10 20:43:25,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2020-02-10 20:43:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:25,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:25,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:25,937 INFO L427 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:25,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1130779938, now seen corresponding path program 647 times [2020-02-10 20:43:25,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:25,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208262866] [2020-02-10 20:43:25,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:26,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208262866] [2020-02-10 20:43:26,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:26,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:26,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845504455] [2020-02-10 20:43:26,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:26,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:26,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:26,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:26,134 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand 8 states. [2020-02-10 20:43:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:26,182 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2020-02-10 20:43:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:26,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:26,183 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:43:26,183 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:43:26,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:43:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2020-02-10 20:43:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:43:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 218 transitions. [2020-02-10 20:43:26,186 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 218 transitions. Word has length 19 [2020-02-10 20:43:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:26,186 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 218 transitions. [2020-02-10 20:43:26,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 218 transitions. [2020-02-10 20:43:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:26,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:26,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:26,187 INFO L427 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:26,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:26,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1674782362, now seen corresponding path program 648 times [2020-02-10 20:43:26,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:26,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047455484] [2020-02-10 20:43:26,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:26,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047455484] [2020-02-10 20:43:26,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:26,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:26,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726677004] [2020-02-10 20:43:26,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:26,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:26,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:26,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:26,374 INFO L87 Difference]: Start difference. First operand 89 states and 218 transitions. Second operand 8 states. [2020-02-10 20:43:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:26,441 INFO L93 Difference]: Finished difference Result 138 states and 290 transitions. [2020-02-10 20:43:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:26,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:26,442 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:43:26,442 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 20:43:26,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 20:43:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2020-02-10 20:43:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:43:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 212 transitions. [2020-02-10 20:43:26,445 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 212 transitions. Word has length 19 [2020-02-10 20:43:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:26,445 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 212 transitions. [2020-02-10 20:43:26,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 212 transitions. [2020-02-10 20:43:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:26,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:26,445 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:26,446 INFO L427 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:26,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:26,446 INFO L82 PathProgramCache]: Analyzing trace with hash -898297510, now seen corresponding path program 649 times [2020-02-10 20:43:26,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:26,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006867125] [2020-02-10 20:43:26,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:26,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006867125] [2020-02-10 20:43:26,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:26,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:26,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197771000] [2020-02-10 20:43:26,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:26,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:26,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:26,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:26,618 INFO L87 Difference]: Start difference. First operand 85 states and 212 transitions. Second operand 8 states. [2020-02-10 20:43:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:26,683 INFO L93 Difference]: Finished difference Result 154 states and 319 transitions. [2020-02-10 20:43:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:26,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:26,684 INFO L225 Difference]: With dead ends: 154 [2020-02-10 20:43:26,684 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 20:43:26,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 20:43:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 87. [2020-02-10 20:43:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:43:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2020-02-10 20:43:26,686 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 19 [2020-02-10 20:43:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:26,686 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2020-02-10 20:43:26,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2020-02-10 20:43:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:26,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:26,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:26,687 INFO L427 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:26,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:26,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1772632836, now seen corresponding path program 650 times [2020-02-10 20:43:26,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:26,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130772017] [2020-02-10 20:43:26,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:26,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130772017] [2020-02-10 20:43:26,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:26,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:26,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674649994] [2020-02-10 20:43:26,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:26,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:26,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:26,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:26,859 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand 8 states. [2020-02-10 20:43:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:26,925 INFO L93 Difference]: Finished difference Result 150 states and 308 transitions. [2020-02-10 20:43:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:26,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:26,926 INFO L225 Difference]: With dead ends: 150 [2020-02-10 20:43:26,926 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:43:26,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:43:26,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2020-02-10 20:43:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:43:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 210 transitions. [2020-02-10 20:43:26,928 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 210 transitions. Word has length 19 [2020-02-10 20:43:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:26,929 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 210 transitions. [2020-02-10 20:43:26,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 210 transitions. [2020-02-10 20:43:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:26,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:26,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:26,929 INFO L427 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:26,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:26,929 INFO L82 PathProgramCache]: Analyzing trace with hash 591107486, now seen corresponding path program 651 times [2020-02-10 20:43:26,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:26,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173187] [2020-02-10 20:43:26,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:27,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173187] [2020-02-10 20:43:27,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:27,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:27,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270139963] [2020-02-10 20:43:27,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:27,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:27,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:27,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:27,103 INFO L87 Difference]: Start difference. First operand 85 states and 210 transitions. Second operand 8 states. [2020-02-10 20:43:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:27,168 INFO L93 Difference]: Finished difference Result 158 states and 329 transitions. [2020-02-10 20:43:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:27,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:27,169 INFO L225 Difference]: With dead ends: 158 [2020-02-10 20:43:27,169 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 20:43:27,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 20:43:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 89. [2020-02-10 20:43:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:43:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 218 transitions. [2020-02-10 20:43:27,172 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 218 transitions. Word has length 19 [2020-02-10 20:43:27,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:27,172 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 218 transitions. [2020-02-10 20:43:27,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 218 transitions. [2020-02-10 20:43:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:27,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:27,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:27,172 INFO L427 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:27,173 INFO L82 PathProgramCache]: Analyzing trace with hash -154189658, now seen corresponding path program 652 times [2020-02-10 20:43:27,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:27,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789863729] [2020-02-10 20:43:27,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:27,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789863729] [2020-02-10 20:43:27,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:27,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:27,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501823328] [2020-02-10 20:43:27,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:27,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:27,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:27,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:27,346 INFO L87 Difference]: Start difference. First operand 89 states and 218 transitions. Second operand 8 states. [2020-02-10 20:43:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:27,415 INFO L93 Difference]: Finished difference Result 156 states and 321 transitions. [2020-02-10 20:43:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:27,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:27,416 INFO L225 Difference]: With dead ends: 156 [2020-02-10 20:43:27,416 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 20:43:27,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 20:43:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 85. [2020-02-10 20:43:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:43:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 208 transitions. [2020-02-10 20:43:27,419 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 208 transitions. Word has length 19 [2020-02-10 20:43:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:27,419 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 208 transitions. [2020-02-10 20:43:27,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 208 transitions. [2020-02-10 20:43:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:27,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:27,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:27,420 INFO L427 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1950879654, now seen corresponding path program 653 times [2020-02-10 20:43:27,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:27,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204711774] [2020-02-10 20:43:27,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:27,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204711774] [2020-02-10 20:43:27,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:27,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:27,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862109214] [2020-02-10 20:43:27,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:27,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:27,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:27,597 INFO L87 Difference]: Start difference. First operand 85 states and 208 transitions. Second operand 8 states. [2020-02-10 20:43:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:27,659 INFO L93 Difference]: Finished difference Result 148 states and 302 transitions. [2020-02-10 20:43:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:27,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:27,660 INFO L225 Difference]: With dead ends: 148 [2020-02-10 20:43:27,660 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:43:27,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:43:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 87. [2020-02-10 20:43:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:43:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 211 transitions. [2020-02-10 20:43:27,662 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 211 transitions. Word has length 19 [2020-02-10 20:43:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:27,662 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 211 transitions. [2020-02-10 20:43:27,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 211 transitions. [2020-02-10 20:43:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:27,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:27,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:27,663 INFO L427 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash -633474334, now seen corresponding path program 654 times [2020-02-10 20:43:27,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:27,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819178013] [2020-02-10 20:43:27,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:27,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819178013] [2020-02-10 20:43:27,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:27,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:27,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930049939] [2020-02-10 20:43:27,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:27,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:27,839 INFO L87 Difference]: Start difference. First operand 87 states and 211 transitions. Second operand 8 states. [2020-02-10 20:43:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:27,904 INFO L93 Difference]: Finished difference Result 150 states and 305 transitions. [2020-02-10 20:43:27,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:27,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:27,905 INFO L225 Difference]: With dead ends: 150 [2020-02-10 20:43:27,905 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:43:27,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:43:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2020-02-10 20:43:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:43:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 203 transitions. [2020-02-10 20:43:27,908 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 203 transitions. Word has length 19 [2020-02-10 20:43:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:27,908 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 203 transitions. [2020-02-10 20:43:27,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 203 transitions. [2020-02-10 20:43:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:27,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:27,908 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:27,908 INFO L427 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1213390630, now seen corresponding path program 655 times [2020-02-10 20:43:27,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:27,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732353418] [2020-02-10 20:43:27,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:28,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732353418] [2020-02-10 20:43:28,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:28,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:28,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232970988] [2020-02-10 20:43:28,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:28,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:28,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:28,078 INFO L87 Difference]: Start difference. First operand 83 states and 203 transitions. Second operand 8 states. [2020-02-10 20:43:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:28,142 INFO L93 Difference]: Finished difference Result 152 states and 310 transitions. [2020-02-10 20:43:28,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:28,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:28,143 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:43:28,143 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:43:28,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:43:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2020-02-10 20:43:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:43:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 201 transitions. [2020-02-10 20:43:28,146 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 201 transitions. Word has length 19 [2020-02-10 20:43:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:28,146 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 201 transitions. [2020-02-10 20:43:28,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 201 transitions. [2020-02-10 20:43:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:28,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:28,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:28,147 INFO L427 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:28,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725956, now seen corresponding path program 656 times [2020-02-10 20:43:28,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:28,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828340996] [2020-02-10 20:43:28,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:28,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828340996] [2020-02-10 20:43:28,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:28,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:28,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415012251] [2020-02-10 20:43:28,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:28,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:28,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:28,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:28,314 INFO L87 Difference]: Start difference. First operand 83 states and 201 transitions. Second operand 8 states. [2020-02-10 20:43:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:28,379 INFO L93 Difference]: Finished difference Result 148 states and 299 transitions. [2020-02-10 20:43:28,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:28,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:28,380 INFO L225 Difference]: With dead ends: 148 [2020-02-10 20:43:28,380 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 20:43:28,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 20:43:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2020-02-10 20:43:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:43:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 196 transitions. [2020-02-10 20:43:28,383 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 196 transitions. Word has length 19 [2020-02-10 20:43:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:28,383 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 196 transitions. [2020-02-10 20:43:28,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 196 transitions. [2020-02-10 20:43:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:28,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:28,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:28,384 INFO L427 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1020716864, now seen corresponding path program 657 times [2020-02-10 20:43:28,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:28,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691646666] [2020-02-10 20:43:28,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:28,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691646666] [2020-02-10 20:43:28,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:28,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:28,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115968599] [2020-02-10 20:43:28,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:28,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:28,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:28,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:28,562 INFO L87 Difference]: Start difference. First operand 81 states and 196 transitions. Second operand 8 states. [2020-02-10 20:43:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:28,627 INFO L93 Difference]: Finished difference Result 152 states and 313 transitions. [2020-02-10 20:43:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:28,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:28,628 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:43:28,628 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:43:28,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:43:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 86. [2020-02-10 20:43:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:43:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 206 transitions. [2020-02-10 20:43:28,631 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 206 transitions. Word has length 19 [2020-02-10 20:43:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:28,631 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 206 transitions. [2020-02-10 20:43:28,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 206 transitions. [2020-02-10 20:43:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:28,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:28,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:28,632 INFO L427 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:28,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:28,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1989600904, now seen corresponding path program 658 times [2020-02-10 20:43:28,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:28,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169704912] [2020-02-10 20:43:28,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:28,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169704912] [2020-02-10 20:43:28,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:28,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:28,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289889361] [2020-02-10 20:43:28,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:28,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:28,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:28,807 INFO L87 Difference]: Start difference. First operand 86 states and 206 transitions. Second operand 8 states. [2020-02-10 20:43:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:28,873 INFO L93 Difference]: Finished difference Result 142 states and 297 transitions. [2020-02-10 20:43:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:28,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:28,874 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:43:28,874 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 20:43:28,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 20:43:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2020-02-10 20:43:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:43:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 194 transitions. [2020-02-10 20:43:28,877 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 194 transitions. Word has length 19 [2020-02-10 20:43:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:28,877 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 194 transitions. [2020-02-10 20:43:28,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 194 transitions. [2020-02-10 20:43:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:28,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:28,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:28,877 INFO L427 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:28,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1914478264, now seen corresponding path program 659 times [2020-02-10 20:43:28,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:28,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720745931] [2020-02-10 20:43:28,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:29,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720745931] [2020-02-10 20:43:29,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:29,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:29,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836894313] [2020-02-10 20:43:29,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:29,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:29,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:29,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:29,045 INFO L87 Difference]: Start difference. First operand 81 states and 194 transitions. Second operand 8 states. [2020-02-10 20:43:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:29,109 INFO L93 Difference]: Finished difference Result 145 states and 292 transitions. [2020-02-10 20:43:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:29,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:29,110 INFO L225 Difference]: With dead ends: 145 [2020-02-10 20:43:29,110 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 20:43:29,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 20:43:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2020-02-10 20:43:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:43:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-02-10 20:43:29,113 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-02-10 20:43:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:29,113 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-02-10 20:43:29,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-02-10 20:43:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:29,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:29,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:29,114 INFO L427 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:29,114 INFO L82 PathProgramCache]: Analyzing trace with hash 651441698, now seen corresponding path program 660 times [2020-02-10 20:43:29,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:29,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80372288] [2020-02-10 20:43:29,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:29,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80372288] [2020-02-10 20:43:29,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:29,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:29,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008183557] [2020-02-10 20:43:29,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:29,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:29,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:29,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:29,279 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-02-10 20:43:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:29,347 INFO L93 Difference]: Finished difference Result 139 states and 288 transitions. [2020-02-10 20:43:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:29,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:29,348 INFO L225 Difference]: With dead ends: 139 [2020-02-10 20:43:29,348 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 20:43:29,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 20:43:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2020-02-10 20:43:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:43:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 189 transitions. [2020-02-10 20:43:29,350 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 189 transitions. Word has length 19 [2020-02-10 20:43:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:29,351 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 189 transitions. [2020-02-10 20:43:29,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 189 transitions. [2020-02-10 20:43:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:29,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:29,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:29,352 INFO L427 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:29,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:29,352 INFO L82 PathProgramCache]: Analyzing trace with hash -797071014, now seen corresponding path program 661 times [2020-02-10 20:43:29,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:29,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276793092] [2020-02-10 20:43:29,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:29,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276793092] [2020-02-10 20:43:29,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:29,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:29,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532425127] [2020-02-10 20:43:29,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:29,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:29,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:29,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:29,539 INFO L87 Difference]: Start difference. First operand 79 states and 189 transitions. Second operand 8 states. [2020-02-10 20:43:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:29,602 INFO L93 Difference]: Finished difference Result 156 states and 329 transitions. [2020-02-10 20:43:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:29,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:29,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:29,602 INFO L225 Difference]: With dead ends: 156 [2020-02-10 20:43:29,603 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 20:43:29,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 20:43:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2020-02-10 20:43:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:43:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 213 transitions. [2020-02-10 20:43:29,604 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 213 transitions. Word has length 19 [2020-02-10 20:43:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:29,605 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 213 transitions. [2020-02-10 20:43:29,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 213 transitions. [2020-02-10 20:43:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:29,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:29,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:29,606 INFO L427 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:29,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:29,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1542368158, now seen corresponding path program 662 times [2020-02-10 20:43:29,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:29,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296225074] [2020-02-10 20:43:29,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:29,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296225074] [2020-02-10 20:43:29,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:29,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:29,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400139458] [2020-02-10 20:43:29,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:29,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:29,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:29,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:29,788 INFO L87 Difference]: Start difference. First operand 87 states and 213 transitions. Second operand 8 states. [2020-02-10 20:43:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:29,854 INFO L93 Difference]: Finished difference Result 154 states and 321 transitions. [2020-02-10 20:43:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:29,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:29,855 INFO L225 Difference]: With dead ends: 154 [2020-02-10 20:43:29,855 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:43:29,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:43:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2020-02-10 20:43:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:43:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 201 transitions. [2020-02-10 20:43:29,857 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 201 transitions. Word has length 19 [2020-02-10 20:43:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:29,857 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 201 transitions. [2020-02-10 20:43:29,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 201 transitions. [2020-02-10 20:43:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:29,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:29,858 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:29,858 INFO L427 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:29,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:29,858 INFO L82 PathProgramCache]: Analyzing trace with hash -52368516, now seen corresponding path program 663 times [2020-02-10 20:43:29,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:29,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118214970] [2020-02-10 20:43:29,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:30,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118214970] [2020-02-10 20:43:30,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:30,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:30,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992843015] [2020-02-10 20:43:30,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:30,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:30,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:30,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:30,049 INFO L87 Difference]: Start difference. First operand 83 states and 201 transitions. Second operand 8 states. [2020-02-10 20:43:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:30,113 INFO L93 Difference]: Finished difference Result 147 states and 303 transitions. [2020-02-10 20:43:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:30,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:30,114 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:43:30,114 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 20:43:30,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 20:43:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2020-02-10 20:43:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:43:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 211 transitions. [2020-02-10 20:43:30,116 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 211 transitions. Word has length 19 [2020-02-10 20:43:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:30,117 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 211 transitions. [2020-02-10 20:43:30,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 211 transitions. [2020-02-10 20:43:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:30,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:30,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:30,118 INFO L427 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:30,118 INFO L82 PathProgramCache]: Analyzing trace with hash 916515524, now seen corresponding path program 664 times [2020-02-10 20:43:30,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:30,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876265880] [2020-02-10 20:43:30,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:30,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876265880] [2020-02-10 20:43:30,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:30,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:30,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112956249] [2020-02-10 20:43:30,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:30,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:30,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:30,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:30,306 INFO L87 Difference]: Start difference. First operand 88 states and 211 transitions. Second operand 8 states. [2020-02-10 20:43:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:30,371 INFO L93 Difference]: Finished difference Result 137 states and 287 transitions. [2020-02-10 20:43:30,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:30,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:30,372 INFO L225 Difference]: With dead ends: 137 [2020-02-10 20:43:30,372 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 20:43:30,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 20:43:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2020-02-10 20:43:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:43:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-02-10 20:43:30,374 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-02-10 20:43:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:30,374 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-02-10 20:43:30,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-02-10 20:43:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:30,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:30,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:30,375 INFO L427 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:30,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:30,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1571733990, now seen corresponding path program 665 times [2020-02-10 20:43:30,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:30,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427634156] [2020-02-10 20:43:30,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:30,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427634156] [2020-02-10 20:43:30,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:30,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:30,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913599389] [2020-02-10 20:43:30,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:30,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:30,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:30,564 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-02-10 20:43:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:30,629 INFO L93 Difference]: Finished difference Result 135 states and 283 transitions. [2020-02-10 20:43:30,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:30,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:30,630 INFO L225 Difference]: With dead ends: 135 [2020-02-10 20:43:30,630 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 20:43:30,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 20:43:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2020-02-10 20:43:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:43:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 205 transitions. [2020-02-10 20:43:30,632 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 205 transitions. Word has length 19 [2020-02-10 20:43:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:30,632 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 205 transitions. [2020-02-10 20:43:30,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 205 transitions. [2020-02-10 20:43:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:30,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:30,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:30,633 INFO L427 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:30,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:30,633 INFO L82 PathProgramCache]: Analyzing trace with hash -712859460, now seen corresponding path program 666 times [2020-02-10 20:43:30,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:30,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093229698] [2020-02-10 20:43:30,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:30,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093229698] [2020-02-10 20:43:30,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:30,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:30,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088518495] [2020-02-10 20:43:30,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:30,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:30,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:30,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:30,825 INFO L87 Difference]: Start difference. First operand 87 states and 205 transitions. Second operand 8 states. [2020-02-10 20:43:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:30,889 INFO L93 Difference]: Finished difference Result 122 states and 262 transitions. [2020-02-10 20:43:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:30,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:30,890 INFO L225 Difference]: With dead ends: 122 [2020-02-10 20:43:30,890 INFO L226 Difference]: Without dead ends: 101 [2020-02-10 20:43:30,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-02-10 20:43:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2020-02-10 20:43:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:43:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 187 transitions. [2020-02-10 20:43:30,892 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 187 transitions. Word has length 19 [2020-02-10 20:43:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:30,893 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 187 transitions. [2020-02-10 20:43:30,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 187 transitions. [2020-02-10 20:43:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:30,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:30,893 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:30,893 INFO L427 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1100556732, now seen corresponding path program 667 times [2020-02-10 20:43:30,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:30,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788296579] [2020-02-10 20:43:30,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:31,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788296579] [2020-02-10 20:43:31,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:31,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:31,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936965747] [2020-02-10 20:43:31,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:31,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:31,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:31,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:31,083 INFO L87 Difference]: Start difference. First operand 79 states and 187 transitions. Second operand 8 states. [2020-02-10 20:43:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:31,147 INFO L93 Difference]: Finished difference Result 141 states and 283 transitions. [2020-02-10 20:43:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:31,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:31,148 INFO L225 Difference]: With dead ends: 141 [2020-02-10 20:43:31,148 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 20:43:31,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 20:43:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2020-02-10 20:43:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:43:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-02-10 20:43:31,151 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-02-10 20:43:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:31,151 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-02-10 20:43:31,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-02-10 20:43:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:31,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:31,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:31,152 INFO L427 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:31,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:31,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1483797256, now seen corresponding path program 668 times [2020-02-10 20:43:31,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:31,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334905855] [2020-02-10 20:43:31,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:31,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334905855] [2020-02-10 20:43:31,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:31,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:31,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615449377] [2020-02-10 20:43:31,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:31,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:31,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:31,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:31,338 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-02-10 20:43:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:31,402 INFO L93 Difference]: Finished difference Result 143 states and 286 transitions. [2020-02-10 20:43:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:31,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:31,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:31,403 INFO L225 Difference]: With dead ends: 143 [2020-02-10 20:43:31,403 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 20:43:31,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 20:43:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 81. [2020-02-10 20:43:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:43:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 192 transitions. [2020-02-10 20:43:31,405 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 192 transitions. Word has length 19 [2020-02-10 20:43:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:31,406 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 192 transitions. [2020-02-10 20:43:31,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 192 transitions. [2020-02-10 20:43:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:31,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:31,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:31,406 INFO L427 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1845259230, now seen corresponding path program 669 times [2020-02-10 20:43:31,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:31,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282789802] [2020-02-10 20:43:31,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:31,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282789802] [2020-02-10 20:43:31,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:31,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:31,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186137492] [2020-02-10 20:43:31,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:31,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:31,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:31,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:31,592 INFO L87 Difference]: Start difference. First operand 81 states and 192 transitions. Second operand 8 states. [2020-02-10 20:43:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:31,657 INFO L93 Difference]: Finished difference Result 138 states and 275 transitions. [2020-02-10 20:43:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:31,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:31,658 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:43:31,658 INFO L226 Difference]: Without dead ends: 128 [2020-02-10 20:43:31,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-02-10 20:43:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2020-02-10 20:43:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:43:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 195 transitions. [2020-02-10 20:43:31,661 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 195 transitions. Word has length 19 [2020-02-10 20:43:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:31,661 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 195 transitions. [2020-02-10 20:43:31,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 195 transitions. [2020-02-10 20:43:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:31,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:31,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:31,662 INFO L427 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:31,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash 116211896, now seen corresponding path program 670 times [2020-02-10 20:43:31,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:31,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670211278] [2020-02-10 20:43:31,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:31,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670211278] [2020-02-10 20:43:31,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:31,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:31,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422365702] [2020-02-10 20:43:31,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:31,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:31,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:31,849 INFO L87 Difference]: Start difference. First operand 83 states and 195 transitions. Second operand 8 states. [2020-02-10 20:43:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:31,921 INFO L93 Difference]: Finished difference Result 132 states and 271 transitions. [2020-02-10 20:43:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:31,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:31,922 INFO L225 Difference]: With dead ends: 132 [2020-02-10 20:43:31,922 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 20:43:31,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 20:43:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2020-02-10 20:43:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:43:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 190 transitions. [2020-02-10 20:43:31,924 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 190 transitions. Word has length 19 [2020-02-10 20:43:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:31,925 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 190 transitions. [2020-02-10 20:43:31,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 190 transitions. [2020-02-10 20:43:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:31,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:31,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:31,925 INFO L427 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash 750310238, now seen corresponding path program 671 times [2020-02-10 20:43:31,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:31,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16777926] [2020-02-10 20:43:31,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:32,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16777926] [2020-02-10 20:43:32,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:32,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:32,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867843811] [2020-02-10 20:43:32,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:32,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:32,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:32,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:32,113 INFO L87 Difference]: Start difference. First operand 81 states and 190 transitions. Second operand 8 states. [2020-02-10 20:43:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:32,183 INFO L93 Difference]: Finished difference Result 133 states and 276 transitions. [2020-02-10 20:43:32,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:32,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:32,184 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:43:32,184 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 20:43:32,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 20:43:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2020-02-10 20:43:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:43:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 198 transitions. [2020-02-10 20:43:32,187 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 198 transitions. Word has length 19 [2020-02-10 20:43:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:32,187 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 198 transitions. [2020-02-10 20:43:32,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 198 transitions. [2020-02-10 20:43:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:32,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:32,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:32,187 INFO L427 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:32,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1605616892, now seen corresponding path program 672 times [2020-02-10 20:43:32,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:32,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865752367] [2020-02-10 20:43:32,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:32,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865752367] [2020-02-10 20:43:32,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:32,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:32,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772490946] [2020-02-10 20:43:32,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:32,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:32,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:32,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:32,375 INFO L87 Difference]: Start difference. First operand 85 states and 198 transitions. Second operand 8 states. [2020-02-10 20:43:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:32,435 INFO L93 Difference]: Finished difference Result 120 states and 255 transitions. [2020-02-10 20:43:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:32,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:32,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:32,436 INFO L225 Difference]: With dead ends: 120 [2020-02-10 20:43:32,436 INFO L226 Difference]: Without dead ends: 99 [2020-02-10 20:43:32,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-02-10 20:43:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2020-02-10 20:43:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:43:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 183 transitions. [2020-02-10 20:43:32,439 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 183 transitions. Word has length 19 [2020-02-10 20:43:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:32,439 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 183 transitions. [2020-02-10 20:43:32,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 183 transitions. [2020-02-10 20:43:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:32,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:32,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:32,440 INFO L427 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:32,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:32,440 INFO L82 PathProgramCache]: Analyzing trace with hash 598823932, now seen corresponding path program 673 times [2020-02-10 20:43:32,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:32,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554626051] [2020-02-10 20:43:32,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:32,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554626051] [2020-02-10 20:43:32,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:32,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:32,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079373265] [2020-02-10 20:43:32,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:32,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:32,614 INFO L87 Difference]: Start difference. First operand 77 states and 183 transitions. Second operand 8 states. [2020-02-10 20:43:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:32,677 INFO L93 Difference]: Finished difference Result 136 states and 266 transitions. [2020-02-10 20:43:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:32,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:32,678 INFO L225 Difference]: With dead ends: 136 [2020-02-10 20:43:32,678 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 20:43:32,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 20:43:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2020-02-10 20:43:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:43:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 186 transitions. [2020-02-10 20:43:32,681 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 186 transitions. Word has length 19 [2020-02-10 20:43:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:32,681 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 186 transitions. [2020-02-10 20:43:32,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 186 transitions. [2020-02-10 20:43:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:32,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:32,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:32,682 INFO L427 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1718953762, now seen corresponding path program 674 times [2020-02-10 20:43:32,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:32,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217584544] [2020-02-10 20:43:32,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:32,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217584544] [2020-02-10 20:43:32,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:32,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:32,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067930634] [2020-02-10 20:43:32,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:32,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:32,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:32,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:32,859 INFO L87 Difference]: Start difference. First operand 79 states and 186 transitions. Second operand 8 states. [2020-02-10 20:43:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:32,905 INFO L93 Difference]: Finished difference Result 132 states and 255 transitions. [2020-02-10 20:43:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:32,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:32,906 INFO L225 Difference]: With dead ends: 132 [2020-02-10 20:43:32,906 INFO L226 Difference]: Without dead ends: 120 [2020-02-10 20:43:32,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-02-10 20:43:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 77. [2020-02-10 20:43:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:43:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 181 transitions. [2020-02-10 20:43:32,908 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 181 transitions. Word has length 19 [2020-02-10 20:43:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:32,908 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 181 transitions. [2020-02-10 20:43:32,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 181 transitions. [2020-02-10 20:43:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:32,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:32,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:32,909 INFO L427 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash -145878566, now seen corresponding path program 675 times [2020-02-10 20:43:32,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:32,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098523978] [2020-02-10 20:43:32,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:33,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098523978] [2020-02-10 20:43:33,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:33,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:33,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927972595] [2020-02-10 20:43:33,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:33,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:33,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:33,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:33,088 INFO L87 Difference]: Start difference. First operand 77 states and 181 transitions. Second operand 8 states. [2020-02-10 20:43:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:33,147 INFO L93 Difference]: Finished difference Result 140 states and 276 transitions. [2020-02-10 20:43:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:33,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:33,148 INFO L225 Difference]: With dead ends: 140 [2020-02-10 20:43:33,148 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 20:43:33,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 20:43:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2020-02-10 20:43:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:43:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 189 transitions. [2020-02-10 20:43:33,151 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 189 transitions. Word has length 19 [2020-02-10 20:43:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:33,151 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 189 transitions. [2020-02-10 20:43:33,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 189 transitions. [2020-02-10 20:43:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:33,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:33,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:33,151 INFO L427 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:33,151 INFO L82 PathProgramCache]: Analyzing trace with hash -891175710, now seen corresponding path program 676 times [2020-02-10 20:43:33,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:33,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485999952] [2020-02-10 20:43:33,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:33,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485999952] [2020-02-10 20:43:33,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:33,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:33,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761115440] [2020-02-10 20:43:33,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:33,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:33,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:33,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:33,323 INFO L87 Difference]: Start difference. First operand 81 states and 189 transitions. Second operand 8 states. [2020-02-10 20:43:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:33,385 INFO L93 Difference]: Finished difference Result 138 states and 268 transitions. [2020-02-10 20:43:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:33,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:33,386 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:43:33,386 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 20:43:33,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 20:43:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2020-02-10 20:43:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:43:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 179 transitions. [2020-02-10 20:43:33,389 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 179 transitions. Word has length 19 [2020-02-10 20:43:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:33,389 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 179 transitions. [2020-02-10 20:43:33,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 179 transitions. [2020-02-10 20:43:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:33,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:33,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:33,390 INFO L427 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:33,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:33,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1183723960, now seen corresponding path program 677 times [2020-02-10 20:43:33,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:33,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773756589] [2020-02-10 20:43:33,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:33,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773756589] [2020-02-10 20:43:33,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:33,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:33,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911445360] [2020-02-10 20:43:33,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:33,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:33,571 INFO L87 Difference]: Start difference. First operand 77 states and 179 transitions. Second operand 8 states. [2020-02-10 20:43:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:33,614 INFO L93 Difference]: Finished difference Result 130 states and 249 transitions. [2020-02-10 20:43:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:33,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:33,615 INFO L225 Difference]: With dead ends: 130 [2020-02-10 20:43:33,615 INFO L226 Difference]: Without dead ends: 120 [2020-02-10 20:43:33,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-02-10 20:43:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 79. [2020-02-10 20:43:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:43:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 182 transitions. [2020-02-10 20:43:33,618 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 182 transitions. Word has length 19 [2020-02-10 20:43:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:33,618 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 182 transitions. [2020-02-10 20:43:33,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 182 transitions. [2020-02-10 20:43:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:33,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:33,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:33,619 INFO L427 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:33,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:33,619 INFO L82 PathProgramCache]: Analyzing trace with hash 328417306, now seen corresponding path program 678 times [2020-02-10 20:43:33,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:33,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626261905] [2020-02-10 20:43:33,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:33,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626261905] [2020-02-10 20:43:33,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:33,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:33,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813824740] [2020-02-10 20:43:33,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:33,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:33,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:33,796 INFO L87 Difference]: Start difference. First operand 79 states and 182 transitions. Second operand 8 states. [2020-02-10 20:43:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:33,859 INFO L93 Difference]: Finished difference Result 132 states and 252 transitions. [2020-02-10 20:43:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:33,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:33,860 INFO L225 Difference]: With dead ends: 132 [2020-02-10 20:43:33,860 INFO L226 Difference]: Without dead ends: 116 [2020-02-10 20:43:33,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:33,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-02-10 20:43:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-02-10 20:43:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:43:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 174 transitions. [2020-02-10 20:43:33,863 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 174 transitions. Word has length 19 [2020-02-10 20:43:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:33,863 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 174 transitions. [2020-02-10 20:43:33,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 174 transitions. [2020-02-10 20:43:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:33,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:33,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:33,864 INFO L427 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:33,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:33,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1001613922, now seen corresponding path program 679 times [2020-02-10 20:43:33,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:33,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53859041] [2020-02-10 20:43:33,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:34,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53859041] [2020-02-10 20:43:34,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:34,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:34,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136606303] [2020-02-10 20:43:34,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:34,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:34,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:34,057 INFO L87 Difference]: Start difference. First operand 75 states and 174 transitions. Second operand 8 states. [2020-02-10 20:43:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:34,131 INFO L93 Difference]: Finished difference Result 133 states and 254 transitions. [2020-02-10 20:43:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:34,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:34,131 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:43:34,131 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 20:43:34,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 20:43:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 75. [2020-02-10 20:43:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:43:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 172 transitions. [2020-02-10 20:43:34,133 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 172 transitions. Word has length 19 [2020-02-10 20:43:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:34,134 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 172 transitions. [2020-02-10 20:43:34,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 172 transitions. [2020-02-10 20:43:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:34,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:34,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:34,135 INFO L427 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:34,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:34,135 INFO L82 PathProgramCache]: Analyzing trace with hash 118515908, now seen corresponding path program 680 times [2020-02-10 20:43:34,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:34,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896340842] [2020-02-10 20:43:34,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:34,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896340842] [2020-02-10 20:43:34,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:34,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:34,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415478014] [2020-02-10 20:43:34,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:34,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:34,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:34,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:34,336 INFO L87 Difference]: Start difference. First operand 75 states and 172 transitions. Second operand 8 states. [2020-02-10 20:43:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:34,390 INFO L93 Difference]: Finished difference Result 129 states and 243 transitions. [2020-02-10 20:43:34,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:34,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:34,391 INFO L225 Difference]: With dead ends: 129 [2020-02-10 20:43:34,391 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 20:43:34,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 20:43:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2020-02-10 20:43:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 20:43:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 167 transitions. [2020-02-10 20:43:34,394 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 167 transitions. Word has length 19 [2020-02-10 20:43:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:34,394 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 167 transitions. [2020-02-10 20:43:34,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 167 transitions. [2020-02-10 20:43:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:34,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:34,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:34,395 INFO L427 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:34,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2074699302, now seen corresponding path program 681 times [2020-02-10 20:43:34,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:34,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955587150] [2020-02-10 20:43:34,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:34,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955587150] [2020-02-10 20:43:34,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:34,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:34,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193171921] [2020-02-10 20:43:34,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:34,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:34,578 INFO L87 Difference]: Start difference. First operand 73 states and 167 transitions. Second operand 8 states. [2020-02-10 20:43:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:34,641 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-02-10 20:43:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:34,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:34,642 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:43:34,642 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 20:43:34,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 20:43:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 78. [2020-02-10 20:43:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 20:43:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 177 transitions. [2020-02-10 20:43:34,644 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 177 transitions. Word has length 19 [2020-02-10 20:43:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:34,645 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 177 transitions. [2020-02-10 20:43:34,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 177 transitions. [2020-02-10 20:43:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:34,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:34,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:34,645 INFO L427 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1578211076, now seen corresponding path program 682 times [2020-02-10 20:43:34,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:34,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20667911] [2020-02-10 20:43:34,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:34,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20667911] [2020-02-10 20:43:34,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:34,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:34,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796982495] [2020-02-10 20:43:34,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:34,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:34,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:34,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:34,832 INFO L87 Difference]: Start difference. First operand 78 states and 177 transitions. Second operand 8 states. [2020-02-10 20:43:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:34,898 INFO L93 Difference]: Finished difference Result 123 states and 241 transitions. [2020-02-10 20:43:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:34,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:34,898 INFO L225 Difference]: With dead ends: 123 [2020-02-10 20:43:34,899 INFO L226 Difference]: Without dead ends: 105 [2020-02-10 20:43:34,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-02-10 20:43:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2020-02-10 20:43:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 20:43:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 165 transitions. [2020-02-10 20:43:34,902 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 165 transitions. Word has length 19 [2020-02-10 20:43:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:34,902 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 165 transitions. [2020-02-10 20:43:34,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 165 transitions. [2020-02-10 20:43:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:34,903 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:34,903 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:34,903 INFO L427 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:34,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1194227064, now seen corresponding path program 683 times [2020-02-10 20:43:34,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:34,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733098708] [2020-02-10 20:43:34,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:35,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733098708] [2020-02-10 20:43:35,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:35,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:35,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057874427] [2020-02-10 20:43:35,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:35,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:35,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:35,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:35,108 INFO L87 Difference]: Start difference. First operand 73 states and 165 transitions. Second operand 8 states. [2020-02-10 20:43:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:35,153 INFO L93 Difference]: Finished difference Result 126 states and 236 transitions. [2020-02-10 20:43:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:35,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:35,154 INFO L225 Difference]: With dead ends: 126 [2020-02-10 20:43:35,154 INFO L226 Difference]: Without dead ends: 116 [2020-02-10 20:43:35,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-02-10 20:43:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-02-10 20:43:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:43:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 168 transitions. [2020-02-10 20:43:35,157 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 168 transitions. Word has length 19 [2020-02-10 20:43:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:35,157 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 168 transitions. [2020-02-10 20:43:35,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 168 transitions. [2020-02-10 20:43:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:35,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:35,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:35,158 INFO L427 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1611335236, now seen corresponding path program 684 times [2020-02-10 20:43:35,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:35,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586931241] [2020-02-10 20:43:35,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:35,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586931241] [2020-02-10 20:43:35,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:35,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:35,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883701216] [2020-02-10 20:43:35,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:35,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:35,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:35,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:35,341 INFO L87 Difference]: Start difference. First operand 75 states and 168 transitions. Second operand 8 states. [2020-02-10 20:43:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:35,404 INFO L93 Difference]: Finished difference Result 120 states and 232 transitions. [2020-02-10 20:43:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:35,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:35,405 INFO L225 Difference]: With dead ends: 120 [2020-02-10 20:43:35,405 INFO L226 Difference]: Without dead ends: 103 [2020-02-10 20:43:35,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-02-10 20:43:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2020-02-10 20:43:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 20:43:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 160 transitions. [2020-02-10 20:43:35,408 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 160 transitions. Word has length 19 [2020-02-10 20:43:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:35,408 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 160 transitions. [2020-02-10 20:43:35,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 160 transitions. [2020-02-10 20:43:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:35,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:35,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:35,409 INFO L427 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:35,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:35,409 INFO L82 PathProgramCache]: Analyzing trace with hash 948213022, now seen corresponding path program 685 times [2020-02-10 20:43:35,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:35,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243951483] [2020-02-10 20:43:35,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:35,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243951483] [2020-02-10 20:43:35,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:35,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:35,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025963907] [2020-02-10 20:43:35,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:35,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:35,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:35,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:35,595 INFO L87 Difference]: Start difference. First operand 71 states and 160 transitions. Second operand 8 states. [2020-02-10 20:43:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:35,659 INFO L93 Difference]: Finished difference Result 129 states and 245 transitions. [2020-02-10 20:43:35,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:35,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:35,660 INFO L225 Difference]: With dead ends: 129 [2020-02-10 20:43:35,660 INFO L226 Difference]: Without dead ends: 115 [2020-02-10 20:43:35,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-02-10 20:43:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2020-02-10 20:43:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 20:43:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 156 transitions. [2020-02-10 20:43:35,663 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 156 transitions. Word has length 19 [2020-02-10 20:43:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:35,663 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 156 transitions. [2020-02-10 20:43:35,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 156 transitions. [2020-02-10 20:43:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:35,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:35,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:35,663 INFO L427 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:35,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:35,663 INFO L82 PathProgramCache]: Analyzing trace with hash 202915878, now seen corresponding path program 686 times [2020-02-10 20:43:35,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:35,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469015083] [2020-02-10 20:43:35,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:35,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469015083] [2020-02-10 20:43:35,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:35,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:35,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370756466] [2020-02-10 20:43:35,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:35,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:35,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:35,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:35,847 INFO L87 Difference]: Start difference. First operand 71 states and 156 transitions. Second operand 8 states. [2020-02-10 20:43:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:35,911 INFO L93 Difference]: Finished difference Result 127 states and 237 transitions. [2020-02-10 20:43:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:35,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:35,912 INFO L225 Difference]: With dead ends: 127 [2020-02-10 20:43:35,912 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:43:35,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:43:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 67. [2020-02-10 20:43:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-02-10 20:43:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 144 transitions. [2020-02-10 20:43:35,914 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 144 transitions. Word has length 19 [2020-02-10 20:43:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:35,914 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 144 transitions. [2020-02-10 20:43:35,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 144 transitions. [2020-02-10 20:43:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:35,915 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:35,915 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:35,915 INFO L427 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:35,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1001613922, now seen corresponding path program 687 times [2020-02-10 20:43:35,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:35,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165459576] [2020-02-10 20:43:35,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:36,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165459576] [2020-02-10 20:43:36,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:36,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:36,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360621030] [2020-02-10 20:43:36,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:36,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:36,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:36,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:36,108 INFO L87 Difference]: Start difference. First operand 67 states and 144 transitions. Second operand 8 states. [2020-02-10 20:43:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:36,170 INFO L93 Difference]: Finished difference Result 120 states and 219 transitions. [2020-02-10 20:43:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:36,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:36,171 INFO L225 Difference]: With dead ends: 120 [2020-02-10 20:43:36,171 INFO L226 Difference]: Without dead ends: 106 [2020-02-10 20:43:36,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:36,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-02-10 20:43:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2020-02-10 20:43:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-02-10 20:43:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2020-02-10 20:43:36,173 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 127 transitions. Word has length 19 [2020-02-10 20:43:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:36,174 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 127 transitions. [2020-02-10 20:43:36,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 127 transitions. [2020-02-10 20:43:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:36,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:36,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:36,175 INFO L427 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:36,175 INFO L82 PathProgramCache]: Analyzing trace with hash -32729882, now seen corresponding path program 688 times [2020-02-10 20:43:36,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:36,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551140073] [2020-02-10 20:43:36,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:36,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551140073] [2020-02-10 20:43:36,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:36,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:36,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698159506] [2020-02-10 20:43:36,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:36,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:36,369 INFO L87 Difference]: Start difference. First operand 61 states and 127 transitions. Second operand 8 states. [2020-02-10 20:43:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:36,434 INFO L93 Difference]: Finished difference Result 110 states and 203 transitions. [2020-02-10 20:43:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:36,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:36,435 INFO L225 Difference]: With dead ends: 110 [2020-02-10 20:43:36,435 INFO L226 Difference]: Without dead ends: 92 [2020-02-10 20:43:36,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-02-10 20:43:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2020-02-10 20:43:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-02-10 20:43:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 113 transitions. [2020-02-10 20:43:36,437 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 113 transitions. Word has length 19 [2020-02-10 20:43:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:36,437 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 113 transitions. [2020-02-10 20:43:36,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2020-02-10 20:43:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:36,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:36,438 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:36,438 INFO L427 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1773987900, now seen corresponding path program 689 times [2020-02-10 20:43:36,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:36,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981283789] [2020-02-10 20:43:36,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:36,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981283789] [2020-02-10 20:43:36,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:36,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:36,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776052586] [2020-02-10 20:43:36,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:36,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:36,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:36,629 INFO L87 Difference]: Start difference. First operand 56 states and 113 transitions. Second operand 8 states. [2020-02-10 20:43:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:36,692 INFO L93 Difference]: Finished difference Result 108 states and 199 transitions. [2020-02-10 20:43:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:36,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:36,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:36,693 INFO L225 Difference]: With dead ends: 108 [2020-02-10 20:43:36,693 INFO L226 Difference]: Without dead ends: 96 [2020-02-10 20:43:36,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-02-10 20:43:36,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 60. [2020-02-10 20:43:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-02-10 20:43:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 121 transitions. [2020-02-10 20:43:36,695 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 121 transitions. Word has length 19 [2020-02-10 20:43:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:36,695 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 121 transitions. [2020-02-10 20:43:36,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 121 transitions. [2020-02-10 20:43:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:36,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:36,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:36,696 INFO L427 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1662104866, now seen corresponding path program 690 times [2020-02-10 20:43:36,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:36,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941490528] [2020-02-10 20:43:36,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:36,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941490528] [2020-02-10 20:43:36,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:36,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:36,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827602587] [2020-02-10 20:43:36,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:36,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:36,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:36,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:36,893 INFO L87 Difference]: Start difference. First operand 60 states and 121 transitions. Second operand 8 states. [2020-02-10 20:43:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:36,956 INFO L93 Difference]: Finished difference Result 95 states and 178 transitions. [2020-02-10 20:43:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:36,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:36,956 INFO L225 Difference]: With dead ends: 95 [2020-02-10 20:43:36,957 INFO L226 Difference]: Without dead ends: 74 [2020-02-10 20:43:36,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-02-10 20:43:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2020-02-10 20:43:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-02-10 20:43:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 103 transitions. [2020-02-10 20:43:36,958 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 103 transitions. Word has length 19 [2020-02-10 20:43:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:36,959 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 103 transitions. [2020-02-10 20:43:36,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 103 transitions. [2020-02-10 20:43:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:36,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:36,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:36,959 INFO L427 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:36,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:36,960 INFO L82 PathProgramCache]: Analyzing trace with hash 171031428, now seen corresponding path program 691 times [2020-02-10 20:43:36,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:36,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238433718] [2020-02-10 20:43:36,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:37,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238433718] [2020-02-10 20:43:37,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:37,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:37,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252837369] [2020-02-10 20:43:37,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:37,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:37,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:37,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:37,157 INFO L87 Difference]: Start difference. First operand 52 states and 103 transitions. Second operand 8 states. [2020-02-10 20:43:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:37,201 INFO L93 Difference]: Finished difference Result 101 states and 182 transitions. [2020-02-10 20:43:37,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:37,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:37,202 INFO L225 Difference]: With dead ends: 101 [2020-02-10 20:43:37,202 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 20:43:37,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 20:43:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 56. [2020-02-10 20:43:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-02-10 20:43:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 113 transitions. [2020-02-10 20:43:37,204 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 113 transitions. Word has length 19 [2020-02-10 20:43:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:37,204 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 113 transitions. [2020-02-10 20:43:37,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2020-02-10 20:43:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:37,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:37,205 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:37,205 INFO L427 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash -684275226, now seen corresponding path program 692 times [2020-02-10 20:43:37,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:37,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130187192] [2020-02-10 20:43:37,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:37,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130187192] [2020-02-10 20:43:37,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:37,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:37,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486328598] [2020-02-10 20:43:37,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:37,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:37,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:37,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:37,399 INFO L87 Difference]: Start difference. First operand 56 states and 113 transitions. Second operand 8 states. [2020-02-10 20:43:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:37,463 INFO L93 Difference]: Finished difference Result 103 states and 185 transitions. [2020-02-10 20:43:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:37,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:37,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:37,464 INFO L225 Difference]: With dead ends: 103 [2020-02-10 20:43:37,464 INFO L226 Difference]: Without dead ends: 89 [2020-02-10 20:43:37,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-02-10 20:43:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 54. [2020-02-10 20:43:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-02-10 20:43:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 108 transitions. [2020-02-10 20:43:37,466 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 108 transitions. Word has length 19 [2020-02-10 20:43:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:37,466 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 108 transitions. [2020-02-10 20:43:37,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 108 transitions. [2020-02-10 20:43:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:37,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:37,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:37,467 INFO L427 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1781972386, now seen corresponding path program 693 times [2020-02-10 20:43:37,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:37,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656739535] [2020-02-10 20:43:37,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:37,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656739535] [2020-02-10 20:43:37,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:37,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:37,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282234946] [2020-02-10 20:43:37,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:37,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:37,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:37,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:37,656 INFO L87 Difference]: Start difference. First operand 54 states and 108 transitions. Second operand 8 states. [2020-02-10 20:43:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:37,701 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2020-02-10 20:43:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:37,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:37,702 INFO L225 Difference]: With dead ends: 97 [2020-02-10 20:43:37,702 INFO L226 Difference]: Without dead ends: 87 [2020-02-10 20:43:37,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-02-10 20:43:37,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2020-02-10 20:43:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-02-10 20:43:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 111 transitions. [2020-02-10 20:43:37,704 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 111 transitions. Word has length 19 [2020-02-10 20:43:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:37,704 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 111 transitions. [2020-02-10 20:43:37,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 111 transitions. [2020-02-10 20:43:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:37,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:37,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:37,705 INFO L427 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1023589914, now seen corresponding path program 694 times [2020-02-10 20:43:37,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:37,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229558025] [2020-02-10 20:43:37,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:37,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229558025] [2020-02-10 20:43:37,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:37,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:37,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053884505] [2020-02-10 20:43:37,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:37,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:37,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:37,892 INFO L87 Difference]: Start difference. First operand 56 states and 111 transitions. Second operand 8 states. [2020-02-10 20:43:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:37,956 INFO L93 Difference]: Finished difference Result 91 states and 168 transitions. [2020-02-10 20:43:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:37,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:37,957 INFO L225 Difference]: With dead ends: 91 [2020-02-10 20:43:37,957 INFO L226 Difference]: Without dead ends: 76 [2020-02-10 20:43:37,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-02-10 20:43:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2020-02-10 20:43:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-02-10 20:43:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 106 transitions. [2020-02-10 20:43:37,959 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 106 transitions. Word has length 19 [2020-02-10 20:43:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:37,959 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 106 transitions. [2020-02-10 20:43:37,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 106 transitions. [2020-02-10 20:43:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:37,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:37,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:37,959 INFO L427 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1757360606, now seen corresponding path program 695 times [2020-02-10 20:43:37,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:37,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517563821] [2020-02-10 20:43:37,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:38,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517563821] [2020-02-10 20:43:38,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:38,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:38,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099585294] [2020-02-10 20:43:38,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:38,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:38,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:38,151 INFO L87 Difference]: Start difference. First operand 54 states and 106 transitions. Second operand 8 states. [2020-02-10 20:43:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:38,212 INFO L93 Difference]: Finished difference Result 84 states and 153 transitions. [2020-02-10 20:43:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:38,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:38,212 INFO L225 Difference]: With dead ends: 84 [2020-02-10 20:43:38,213 INFO L226 Difference]: Without dead ends: 72 [2020-02-10 20:43:38,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-02-10 20:43:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2020-02-10 20:43:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-02-10 20:43:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 114 transitions. [2020-02-10 20:43:38,214 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 114 transitions. Word has length 19 [2020-02-10 20:43:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:38,215 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 114 transitions. [2020-02-10 20:43:38,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 114 transitions. [2020-02-10 20:43:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:38,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:38,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:38,215 INFO L427 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:38,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1781972386, now seen corresponding path program 696 times [2020-02-10 20:43:38,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:38,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470068771] [2020-02-10 20:43:38,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:38,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470068771] [2020-02-10 20:43:38,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:38,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:38,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629269434] [2020-02-10 20:43:38,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:38,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:38,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:38,420 INFO L87 Difference]: Start difference. First operand 58 states and 114 transitions. Second operand 8 states. [2020-02-10 20:43:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:38,480 INFO L93 Difference]: Finished difference Result 71 states and 132 transitions. [2020-02-10 20:43:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:38,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:38,481 INFO L225 Difference]: With dead ends: 71 [2020-02-10 20:43:38,481 INFO L226 Difference]: Without dead ends: 50 [2020-02-10 20:43:38,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-02-10 20:43:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-02-10 20:43:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:43:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 99 transitions. [2020-02-10 20:43:38,483 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 99 transitions. Word has length 19 [2020-02-10 20:43:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:38,483 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 99 transitions. [2020-02-10 20:43:38,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 99 transitions. [2020-02-10 20:43:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:38,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:38,483 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:38,483 INFO L427 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash -821726946, now seen corresponding path program 697 times [2020-02-10 20:43:38,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:38,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843777638] [2020-02-10 20:43:38,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:38,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843777638] [2020-02-10 20:43:38,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:38,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:38,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715020804] [2020-02-10 20:43:38,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:38,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:38,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:38,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:38,701 INFO L87 Difference]: Start difference. First operand 50 states and 99 transitions. Second operand 8 states. [2020-02-10 20:43:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:38,762 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-02-10 20:43:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:38,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:38,762 INFO L225 Difference]: With dead ends: 83 [2020-02-10 20:43:38,763 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 20:43:38,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 20:43:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2020-02-10 20:43:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-02-10 20:43:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 100 transitions. [2020-02-10 20:43:38,764 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 100 transitions. Word has length 19 [2020-02-10 20:43:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:38,765 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 100 transitions. [2020-02-10 20:43:38,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 100 transitions. [2020-02-10 20:43:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:38,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:38,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:38,765 INFO L427 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:38,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1061369284, now seen corresponding path program 698 times [2020-02-10 20:43:38,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:38,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144819743] [2020-02-10 20:43:38,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:38,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144819743] [2020-02-10 20:43:38,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:38,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:38,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257496915] [2020-02-10 20:43:38,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:38,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:38,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:38,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:38,976 INFO L87 Difference]: Start difference. First operand 51 states and 100 transitions. Second operand 8 states. [2020-02-10 20:43:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:39,023 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-02-10 20:43:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:39,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:39,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:39,024 INFO L225 Difference]: With dead ends: 83 [2020-02-10 20:43:39,024 INFO L226 Difference]: Without dead ends: 72 [2020-02-10 20:43:39,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-02-10 20:43:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-02-10 20:43:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:43:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 98 transitions. [2020-02-10 20:43:39,026 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 98 transitions. Word has length 19 [2020-02-10 20:43:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:39,026 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 98 transitions. [2020-02-10 20:43:39,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 98 transitions. [2020-02-10 20:43:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:39,027 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:39,027 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:39,027 INFO L427 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:39,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1566429444, now seen corresponding path program 699 times [2020-02-10 20:43:39,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:39,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256609831] [2020-02-10 20:43:39,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:39,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256609831] [2020-02-10 20:43:39,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:39,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:39,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803120380] [2020-02-10 20:43:39,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:39,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:39,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:39,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:39,235 INFO L87 Difference]: Start difference. First operand 50 states and 98 transitions. Second operand 8 states. [2020-02-10 20:43:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:39,299 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2020-02-10 20:43:39,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:39,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:39,299 INFO L225 Difference]: With dead ends: 86 [2020-02-10 20:43:39,300 INFO L226 Difference]: Without dead ends: 76 [2020-02-10 20:43:39,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-02-10 20:43:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-02-10 20:43:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-02-10 20:43:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 101 transitions. [2020-02-10 20:43:39,301 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 101 transitions. Word has length 19 [2020-02-10 20:43:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:39,302 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 101 transitions. [2020-02-10 20:43:39,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 101 transitions. [2020-02-10 20:43:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:39,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:39,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:39,302 INFO L427 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:39,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:39,302 INFO L82 PathProgramCache]: Analyzing trace with hash 144183864, now seen corresponding path program 700 times [2020-02-10 20:43:39,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:39,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751820809] [2020-02-10 20:43:39,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:39,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751820809] [2020-02-10 20:43:39,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:39,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:39,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341924540] [2020-02-10 20:43:39,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:39,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:39,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:39,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:39,509 INFO L87 Difference]: Start difference. First operand 52 states and 101 transitions. Second operand 8 states. [2020-02-10 20:43:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:39,573 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2020-02-10 20:43:39,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:39,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:39,574 INFO L225 Difference]: With dead ends: 88 [2020-02-10 20:43:39,574 INFO L226 Difference]: Without dead ends: 74 [2020-02-10 20:43:39,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-02-10 20:43:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-02-10 20:43:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:43:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 97 transitions. [2020-02-10 20:43:39,576 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 97 transitions. Word has length 19 [2020-02-10 20:43:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:39,576 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 97 transitions. [2020-02-10 20:43:39,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 97 transitions. [2020-02-10 20:43:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:39,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:39,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:39,576 INFO L427 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:39,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2134454664, now seen corresponding path program 701 times [2020-02-10 20:43:39,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:39,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023975041] [2020-02-10 20:43:39,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:39,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023975041] [2020-02-10 20:43:39,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:39,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:39,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763572914] [2020-02-10 20:43:39,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:39,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:39,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:39,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:39,786 INFO L87 Difference]: Start difference. First operand 50 states and 97 transitions. Second operand 8 states. [2020-02-10 20:43:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:39,827 INFO L93 Difference]: Finished difference Result 86 states and 142 transitions. [2020-02-10 20:43:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:39,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:39,828 INFO L225 Difference]: With dead ends: 86 [2020-02-10 20:43:39,828 INFO L226 Difference]: Without dead ends: 76 [2020-02-10 20:43:39,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-02-10 20:43:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-02-10 20:43:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-02-10 20:43:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 100 transitions. [2020-02-10 20:43:39,829 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 100 transitions. Word has length 19 [2020-02-10 20:43:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:39,830 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 100 transitions. [2020-02-10 20:43:39,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 100 transitions. [2020-02-10 20:43:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:39,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:39,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:39,830 INFO L427 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:39,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1305205978, now seen corresponding path program 702 times [2020-02-10 20:43:39,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:39,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656180857] [2020-02-10 20:43:39,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:40,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656180857] [2020-02-10 20:43:40,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:40,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:40,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027858009] [2020-02-10 20:43:40,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:40,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:40,035 INFO L87 Difference]: Start difference. First operand 52 states and 100 transitions. Second operand 8 states. [2020-02-10 20:43:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:40,094 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2020-02-10 20:43:40,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:40,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:40,095 INFO L225 Difference]: With dead ends: 88 [2020-02-10 20:43:40,095 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 20:43:40,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 20:43:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2020-02-10 20:43:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-02-10 20:43:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 95 transitions. [2020-02-10 20:43:40,097 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 95 transitions. Word has length 19 [2020-02-10 20:43:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:40,097 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 95 transitions. [2020-02-10 20:43:40,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 95 transitions. [2020-02-10 20:43:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:40,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:40,097 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:40,097 INFO L427 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1872802496, now seen corresponding path program 703 times [2020-02-10 20:43:40,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:40,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78305770] [2020-02-10 20:43:40,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:40,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78305770] [2020-02-10 20:43:40,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:40,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:40,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132912503] [2020-02-10 20:43:40,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:40,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:40,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:40,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:40,310 INFO L87 Difference]: Start difference. First operand 49 states and 95 transitions. Second operand 8 states. [2020-02-10 20:43:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:40,370 INFO L93 Difference]: Finished difference Result 81 states and 130 transitions. [2020-02-10 20:43:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:40,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:40,371 INFO L225 Difference]: With dead ends: 81 [2020-02-10 20:43:40,371 INFO L226 Difference]: Without dead ends: 71 [2020-02-10 20:43:40,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-02-10 20:43:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2020-02-10 20:43:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-02-10 20:43:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 94 transitions. [2020-02-10 20:43:40,372 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 94 transitions. Word has length 19 [2020-02-10 20:43:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:40,373 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 94 transitions. [2020-02-10 20:43:40,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 94 transitions. [2020-02-10 20:43:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:40,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:40,373 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:40,373 INFO L427 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:40,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:40,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1633160158, now seen corresponding path program 704 times [2020-02-10 20:43:40,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:40,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774065022] [2020-02-10 20:43:40,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:40,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774065022] [2020-02-10 20:43:40,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:40,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:40,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617299392] [2020-02-10 20:43:40,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:40,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:40,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:40,584 INFO L87 Difference]: Start difference. First operand 49 states and 94 transitions. Second operand 8 states. [2020-02-10 20:43:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:40,628 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2020-02-10 20:43:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:40,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:40,629 INFO L225 Difference]: With dead ends: 81 [2020-02-10 20:43:40,629 INFO L226 Difference]: Without dead ends: 70 [2020-02-10 20:43:40,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-02-10 20:43:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2020-02-10 20:43:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-02-10 20:43:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 92 transitions. [2020-02-10 20:43:40,630 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 92 transitions. Word has length 19 [2020-02-10 20:43:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:40,631 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 92 transitions. [2020-02-10 20:43:40,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 92 transitions. [2020-02-10 20:43:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:40,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:40,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:40,631 INFO L427 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:40,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:40,631 INFO L82 PathProgramCache]: Analyzing trace with hash 799717116, now seen corresponding path program 705 times [2020-02-10 20:43:40,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:40,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054079086] [2020-02-10 20:43:40,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:40,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054079086] [2020-02-10 20:43:40,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:40,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:40,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297098757] [2020-02-10 20:43:40,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:40,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:40,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:40,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:40,825 INFO L87 Difference]: Start difference. First operand 48 states and 92 transitions. Second operand 8 states. [2020-02-10 20:43:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:40,886 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-02-10 20:43:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:40,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:40,887 INFO L225 Difference]: With dead ends: 83 [2020-02-10 20:43:40,887 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 20:43:40,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 20:43:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2020-02-10 20:43:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:43:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 95 transitions. [2020-02-10 20:43:40,889 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 95 transitions. Word has length 19 [2020-02-10 20:43:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:40,889 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 95 transitions. [2020-02-10 20:43:40,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 95 transitions. [2020-02-10 20:43:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:40,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:40,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:40,890 INFO L427 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:40,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1754696120, now seen corresponding path program 706 times [2020-02-10 20:43:40,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:40,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508716868] [2020-02-10 20:43:40,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:41,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508716868] [2020-02-10 20:43:41,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:41,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:41,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116916999] [2020-02-10 20:43:41,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:41,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:41,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:41,090 INFO L87 Difference]: Start difference. First operand 50 states and 95 transitions. Second operand 8 states. [2020-02-10 20:43:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:41,151 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2020-02-10 20:43:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:41,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:41,152 INFO L225 Difference]: With dead ends: 77 [2020-02-10 20:43:41,152 INFO L226 Difference]: Without dead ends: 62 [2020-02-10 20:43:41,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-02-10 20:43:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2020-02-10 20:43:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-02-10 20:43:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2020-02-10 20:43:41,153 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 91 transitions. Word has length 19 [2020-02-10 20:43:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:41,154 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 91 transitions. [2020-02-10 20:43:41,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 91 transitions. [2020-02-10 20:43:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:41,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:41,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:41,154 INFO L427 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:41,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:41,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2123951560, now seen corresponding path program 707 times [2020-02-10 20:43:41,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:41,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933259408] [2020-02-10 20:43:41,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:41,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933259408] [2020-02-10 20:43:41,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:41,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:41,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20833423] [2020-02-10 20:43:41,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:41,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:41,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:41,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:41,353 INFO L87 Difference]: Start difference. First operand 48 states and 91 transitions. Second operand 8 states. [2020-02-10 20:43:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:41,394 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-02-10 20:43:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:41,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:41,395 INFO L225 Difference]: With dead ends: 83 [2020-02-10 20:43:41,395 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 20:43:41,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 20:43:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2020-02-10 20:43:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:43:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 94 transitions. [2020-02-10 20:43:41,397 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 94 transitions. Word has length 19 [2020-02-10 20:43:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:41,397 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 94 transitions. [2020-02-10 20:43:41,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 94 transitions. [2020-02-10 20:43:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:41,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:41,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:41,398 INFO L427 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash -634546564, now seen corresponding path program 708 times [2020-02-10 20:43:41,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:41,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494431336] [2020-02-10 20:43:41,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:41,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494431336] [2020-02-10 20:43:41,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:41,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:41,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190137046] [2020-02-10 20:43:41,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:41,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:41,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:41,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:41,598 INFO L87 Difference]: Start difference. First operand 50 states and 94 transitions. Second operand 8 states. [2020-02-10 20:43:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:41,656 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2020-02-10 20:43:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:41,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:41,657 INFO L225 Difference]: With dead ends: 77 [2020-02-10 20:43:41,657 INFO L226 Difference]: Without dead ends: 61 [2020-02-10 20:43:41,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-02-10 20:43:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2020-02-10 20:43:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-02-10 20:43:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 89 transitions. [2020-02-10 20:43:41,659 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 89 transitions. Word has length 19 [2020-02-10 20:43:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:41,659 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 89 transitions. [2020-02-10 20:43:41,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 89 transitions. [2020-02-10 20:43:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:41,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:41,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:41,660 INFO L427 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash -472337856, now seen corresponding path program 709 times [2020-02-10 20:43:41,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:41,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967149899] [2020-02-10 20:43:41,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:41,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967149899] [2020-02-10 20:43:41,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:41,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:41,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405582165] [2020-02-10 20:43:41,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:41,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:41,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:41,861 INFO L87 Difference]: Start difference. First operand 47 states and 89 transitions. Second operand 8 states. [2020-02-10 20:43:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:41,925 INFO L93 Difference]: Finished difference Result 79 states and 126 transitions. [2020-02-10 20:43:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:41,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:41,925 INFO L225 Difference]: With dead ends: 79 [2020-02-10 20:43:41,926 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 20:43:41,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 20:43:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2020-02-10 20:43:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-02-10 20:43:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 87 transitions. [2020-02-10 20:43:41,928 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 87 transitions. Word has length 19 [2020-02-10 20:43:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:41,928 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 87 transitions. [2020-02-10 20:43:41,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2020-02-10 20:43:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:41,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:41,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:41,929 INFO L427 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:41,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:41,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1238275452, now seen corresponding path program 710 times [2020-02-10 20:43:41,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:41,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797540107] [2020-02-10 20:43:41,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:42,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797540107] [2020-02-10 20:43:42,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:42,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:42,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23774343] [2020-02-10 20:43:42,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:42,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:42,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:42,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:42,128 INFO L87 Difference]: Start difference. First operand 47 states and 87 transitions. Second operand 8 states. [2020-02-10 20:43:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:42,188 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2020-02-10 20:43:42,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:42,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:42,189 INFO L225 Difference]: With dead ends: 81 [2020-02-10 20:43:42,189 INFO L226 Difference]: Without dead ends: 67 [2020-02-10 20:43:42,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-02-10 20:43:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2020-02-10 20:43:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-02-10 20:43:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 82 transitions. [2020-02-10 20:43:42,191 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 82 transitions. Word has length 19 [2020-02-10 20:43:42,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:42,191 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 82 transitions. [2020-02-10 20:43:42,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 82 transitions. [2020-02-10 20:43:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:42,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:42,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:42,191 INFO L427 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1872802496, now seen corresponding path program 711 times [2020-02-10 20:43:42,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:42,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115415865] [2020-02-10 20:43:42,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:42,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115415865] [2020-02-10 20:43:42,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:42,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:42,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636762952] [2020-02-10 20:43:42,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:42,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:42,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:42,385 INFO L87 Difference]: Start difference. First operand 45 states and 82 transitions. Second operand 8 states. [2020-02-10 20:43:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:42,445 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2020-02-10 20:43:42,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:42,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:42,446 INFO L225 Difference]: With dead ends: 76 [2020-02-10 20:43:42,446 INFO L226 Difference]: Without dead ends: 66 [2020-02-10 20:43:42,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-02-10 20:43:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2020-02-10 20:43:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-02-10 20:43:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 77 transitions. [2020-02-10 20:43:42,447 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 77 transitions. Word has length 19 [2020-02-10 20:43:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:42,448 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 77 transitions. [2020-02-10 20:43:42,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2020-02-10 20:43:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:42,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:42,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:42,448 INFO L427 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:42,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:42,448 INFO L82 PathProgramCache]: Analyzing trace with hash 143755162, now seen corresponding path program 712 times [2020-02-10 20:43:42,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:42,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932126281] [2020-02-10 20:43:42,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:42,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932126281] [2020-02-10 20:43:42,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:42,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:42,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164625981] [2020-02-10 20:43:42,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:42,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:42,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:42,646 INFO L87 Difference]: Start difference. First operand 43 states and 77 transitions. Second operand 8 states. [2020-02-10 20:43:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:42,705 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2020-02-10 20:43:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:42,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:42,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:42,706 INFO L225 Difference]: With dead ends: 70 [2020-02-10 20:43:42,706 INFO L226 Difference]: Without dead ends: 55 [2020-02-10 20:43:42,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-02-10 20:43:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2020-02-10 20:43:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-02-10 20:43:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-02-10 20:43:42,707 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 72 transitions. Word has length 19 [2020-02-10 20:43:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:42,708 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-02-10 20:43:42,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 72 transitions. [2020-02-10 20:43:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:42,708 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:42,708 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:42,708 INFO L427 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash 777853504, now seen corresponding path program 713 times [2020-02-10 20:43:42,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:42,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301959655] [2020-02-10 20:43:42,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:42,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301959655] [2020-02-10 20:43:42,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:42,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:42,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762983916] [2020-02-10 20:43:42,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:42,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:42,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:42,910 INFO L87 Difference]: Start difference. First operand 41 states and 72 transitions. Second operand 8 states. [2020-02-10 20:43:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:42,970 INFO L93 Difference]: Finished difference Result 71 states and 119 transitions. [2020-02-10 20:43:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:42,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:42,970 INFO L225 Difference]: With dead ends: 71 [2020-02-10 20:43:42,971 INFO L226 Difference]: Without dead ends: 59 [2020-02-10 20:43:42,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-02-10 20:43:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2020-02-10 20:43:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-02-10 20:43:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 80 transitions. [2020-02-10 20:43:42,972 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 80 transitions. Word has length 19 [2020-02-10 20:43:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:42,972 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 80 transitions. [2020-02-10 20:43:42,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 80 transitions. [2020-02-10 20:43:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:42,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:42,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:42,973 INFO L427 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:42,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1633160158, now seen corresponding path program 714 times [2020-02-10 20:43:42,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:42,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548729515] [2020-02-10 20:43:42,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:43,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548729515] [2020-02-10 20:43:43,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:43,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:43,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12002717] [2020-02-10 20:43:43,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:43,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:43,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:43,170 INFO L87 Difference]: Start difference. First operand 45 states and 80 transitions. Second operand 8 states. [2020-02-10 20:43:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:43,227 INFO L93 Difference]: Finished difference Result 58 states and 98 transitions. [2020-02-10 20:43:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:43,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:43,228 INFO L225 Difference]: With dead ends: 58 [2020-02-10 20:43:43,228 INFO L226 Difference]: Without dead ends: 39 [2020-02-10 20:43:43,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-02-10 20:43:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-02-10 20:43:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 20:43:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2020-02-10 20:43:43,229 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 68 transitions. Word has length 19 [2020-02-10 20:43:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:43,230 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 68 transitions. [2020-02-10 20:43:43,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2020-02-10 20:43:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:43,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:43,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:43,230 INFO L427 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:43,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:43,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1654166366, now seen corresponding path program 715 times [2020-02-10 20:43:43,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:43,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611961353] [2020-02-10 20:43:43,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:43,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611961353] [2020-02-10 20:43:43,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:43,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:43,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715268752] [2020-02-10 20:43:43,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:43,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:43,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:43,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:43,431 INFO L87 Difference]: Start difference. First operand 39 states and 68 transitions. Second operand 8 states. [2020-02-10 20:43:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:43,469 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2020-02-10 20:43:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:43,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:43,469 INFO L225 Difference]: With dead ends: 58 [2020-02-10 20:43:43,470 INFO L226 Difference]: Without dead ends: 48 [2020-02-10 20:43:43,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-02-10 20:43:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2020-02-10 20:43:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 20:43:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2020-02-10 20:43:43,471 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 19 [2020-02-10 20:43:43,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:43,471 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2020-02-10 20:43:43,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2020-02-10 20:43:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:43,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:43,472 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:43,472 INFO L427 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 798859712, now seen corresponding path program 716 times [2020-02-10 20:43:43,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:43,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374583299] [2020-02-10 20:43:43,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:43,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374583299] [2020-02-10 20:43:43,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:43,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:43,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63905759] [2020-02-10 20:43:43,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:43,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:43,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:43,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:43,675 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 8 states. [2020-02-10 20:43:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:43,730 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-02-10 20:43:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:43,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:43,730 INFO L225 Difference]: With dead ends: 60 [2020-02-10 20:43:43,730 INFO L226 Difference]: Without dead ends: 46 [2020-02-10 20:43:43,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-02-10 20:43:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2020-02-10 20:43:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-02-10 20:43:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2020-02-10 20:43:43,732 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 19 [2020-02-10 20:43:43,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:43,732 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2020-02-10 20:43:43,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2020-02-10 20:43:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:43,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:43,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:43,733 INFO L427 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:43,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1029859972, now seen corresponding path program 717 times [2020-02-10 20:43:43,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:43,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158296697] [2020-02-10 20:43:43,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:43,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158296697] [2020-02-10 20:43:43,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:43,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:43,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358949407] [2020-02-10 20:43:43,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:43,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:43,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:43,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:43,932 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 8 states. [2020-02-10 20:43:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:43,970 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2020-02-10 20:43:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:43,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:43,971 INFO L225 Difference]: With dead ends: 54 [2020-02-10 20:43:43,971 INFO L226 Difference]: Without dead ends: 44 [2020-02-10 20:43:43,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-02-10 20:43:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2020-02-10 20:43:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-02-10 20:43:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2020-02-10 20:43:43,972 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 19 [2020-02-10 20:43:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:43,973 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-02-10 20:43:43,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2020-02-10 20:43:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:43,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:43,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:43,973 INFO L427 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:43,973 INFO L82 PathProgramCache]: Analyzing trace with hash 459545024, now seen corresponding path program 718 times [2020-02-10 20:43:43,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:43,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064613322] [2020-02-10 20:43:43,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:44,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064613322] [2020-02-10 20:43:44,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:44,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:44,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226302253] [2020-02-10 20:43:44,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:44,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:44,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:44,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:44,183 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 8 states. [2020-02-10 20:43:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:44,244 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2020-02-10 20:43:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:44,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:44,244 INFO L225 Difference]: With dead ends: 48 [2020-02-10 20:43:44,245 INFO L226 Difference]: Without dead ends: 33 [2020-02-10 20:43:44,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-02-10 20:43:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-02-10 20:43:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-02-10 20:43:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2020-02-10 20:43:44,246 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 19 [2020-02-10 20:43:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:44,246 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions. [2020-02-10 20:43:44,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions. [2020-02-10 20:43:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:44,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:44,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:44,247 INFO L427 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:44,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:44,247 INFO L82 PathProgramCache]: Analyzing trace with hash -274225668, now seen corresponding path program 719 times [2020-02-10 20:43:44,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:44,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040179239] [2020-02-10 20:43:44,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:44,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040179239] [2020-02-10 20:43:44,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:44,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:44,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113682484] [2020-02-10 20:43:44,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:44,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:44,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:44,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:44,447 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand 8 states. [2020-02-10 20:43:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:44,498 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2020-02-10 20:43:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:44,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:44,499 INFO L225 Difference]: With dead ends: 41 [2020-02-10 20:43:44,499 INFO L226 Difference]: Without dead ends: 29 [2020-02-10 20:43:44,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-02-10 20:43:44,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-02-10 20:43:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-02-10 20:43:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2020-02-10 20:43:44,501 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2020-02-10 20:43:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:44,501 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-02-10 20:43:44,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-02-10 20:43:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:43:44,501 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:44,501 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:44,502 INFO L427 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:44,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:44,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1029859972, now seen corresponding path program 720 times [2020-02-10 20:43:44,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:44,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856100082] [2020-02-10 20:43:44,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:44,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856100082] [2020-02-10 20:43:44,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:44,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:43:44,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564592841] [2020-02-10 20:43:44,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:43:44,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:43:44,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:43:44,703 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 8 states. [2020-02-10 20:43:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:44,751 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-02-10 20:43:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:43:44,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:43:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:44,751 INFO L225 Difference]: With dead ends: 28 [2020-02-10 20:43:44,751 INFO L226 Difference]: Without dead ends: 0 [2020-02-10 20:43:44,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:43:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-02-10 20:43:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-02-10 20:43:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-02-10 20:43:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-02-10 20:43:44,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-02-10 20:43:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:44,752 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-02-10 20:43:44,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:43:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-02-10 20:43:44,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-02-10 20:43:44,756 INFO L202 PluginConnector]: Adding new model example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:43:44 BasicIcfg [2020-02-10 20:43:44,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:43:44,757 INFO L168 Benchmark]: Toolchain (without parser) took 205138.26 ms. Allocated memory was 144.7 MB in the beginning and 186.6 MB in the end (delta: 41.9 MB). Free memory was 118.6 MB in the beginning and 135.2 MB in the end (delta: -16.6 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-02-10 20:43:44,757 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:43:44,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.44 ms. Allocated memory is still 144.7 MB. Free memory was 118.4 MB in the beginning and 116.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-02-10 20:43:44,758 INFO L168 Benchmark]: Boogie Preprocessor took 19.70 ms. Allocated memory is still 144.7 MB. Free memory was 116.6 MB in the beginning and 115.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 20:43:44,758 INFO L168 Benchmark]: RCFGBuilder took 260.59 ms. Allocated memory is still 144.7 MB. Free memory was 115.5 MB in the beginning and 103.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-02-10 20:43:44,759 INFO L168 Benchmark]: TraceAbstraction took 204816.66 ms. Allocated memory was 144.7 MB in the beginning and 186.6 MB in the end (delta: 41.9 MB). Free memory was 102.8 MB in the beginning and 135.2 MB in the end (delta: -32.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-02-10 20:43:44,761 INFO L336 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.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.44 ms. Allocated memory is still 144.7 MB. Free memory was 118.4 MB in the beginning and 116.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.70 ms. Allocated memory is still 144.7 MB. Free memory was 116.6 MB in the beginning and 115.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 260.59 ms. Allocated memory is still 144.7 MB. Free memory was 115.5 MB in the beginning and 103.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 204816.66 ms. Allocated memory was 144.7 MB in the beginning and 186.6 MB in the end (delta: 41.9 MB). Free memory was 102.8 MB in the beginning and 135.2 MB in the end (delta: -32.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.3s, 52 ProgramPointsBefore, 45 ProgramPointsAfterwards, 63 TransitionsBefore, 56 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 210 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 225 CheckedPairsTotal, 7 TotalNumberOfCompositions - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. Result: SAFE, OverallTime: 204.5s, OverallIterations: 724, TraceHistogramMax: 1, AutomataDifference: 55.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 48598 SDtfs, 89022 SDslu, 114886 SDs, 0 SdLazy, 25831 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5772 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 5044 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2880 ImplicationChecksByTransitivity, 159.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=794occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 724 MinimizatonAttempts, 91280 StatesRemovedByMinimization, 714 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 140.1s InterpolantComputationTime, 13756 NumberOfCodeBlocks, 13756 NumberOfCodeBlocksAsserted, 724 NumberOfCheckSat, 13032 ConstructedInterpolants, 0 QuantifiedInterpolants, 4750668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 724 InterpolantComputations, 724 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...